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.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem18_label08_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 00:45:04,756 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 00:45:04,759 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 00:45:04,778 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 00:45:04,778 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 00:45:04,779 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 00:45:04,781 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 00:45:04,783 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 00:45:04,785 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 00:45:04,785 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 00:45:04,786 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 00:45:04,787 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 00:45:04,788 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 00:45:04,789 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 00:45:04,790 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 00:45:04,791 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 00:45:04,792 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 00:45:04,794 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 00:45:04,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 00:45:04,800 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 00:45:04,801 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 00:45:04,805 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 00:45:04,811 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 00:45:04,811 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 00:45:04,812 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 00:45:04,813 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 00:45:04,814 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 00:45:04,815 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 00:45:04,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 00:45:04,818 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 00:45:04,818 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 00:45:04,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 00:45:04,820 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 00:45:04,820 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 00:45:04,823 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 00:45:04,823 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 00:45:04,824 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 00:45:04,846 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 00:45:04,847 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 00:45:04,848 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 00:45:04,848 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 00:45:04,848 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 00:45:04,848 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 00:45:04,849 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 00:45:04,849 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 00:45:04,849 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 00:45:04,849 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 00:45:04,849 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 00:45:04,850 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 00:45:04,850 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 00:45:04,851 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 00:45:04,851 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 00:45:04,851 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 00:45:04,851 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 00:45:04,851 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 00:45:04,852 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 00:45:04,852 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 00:45:04,852 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 00:45:04,852 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 00:45:04,852 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 00:45:04,853 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 00:45:04,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 00:45:04,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 00:45:04,853 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 00:45:04,853 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 00:45:04,854 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 00:45:04,854 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 00:45:04,854 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 00:45:04,854 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 00:45:04,854 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 00:45:04,855 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 00:45:04,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 00:45:04,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 00:45:04,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 00:45:04,944 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 00:45:04,944 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 00:45:04,945 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem18_label08_false-unreach-call.c [2018-11-07 00:45:05,009 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/416322abd/2eb3de7b5dab4eee8fc0eca1c1fe899d/FLAG7c182baf2 [2018-11-07 00:45:05,699 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 00:45:05,700 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem18_label08_false-unreach-call.c [2018-11-07 00:45:05,725 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/416322abd/2eb3de7b5dab4eee8fc0eca1c1fe899d/FLAG7c182baf2 [2018-11-07 00:45:05,741 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/416322abd/2eb3de7b5dab4eee8fc0eca1c1fe899d [2018-11-07 00:45:05,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 00:45:05,754 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 00:45:05,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 00:45:05,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 00:45:05,759 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 00:45:05,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:45:05" (1/1) ... [2018-11-07 00:45:05,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fab143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:05, skipping insertion in model container [2018-11-07 00:45:05,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:45:05" (1/1) ... [2018-11-07 00:45:05,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 00:45:05,888 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 00:45:06,988 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 00:45:06,993 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 00:45:07,468 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 00:45:07,501 INFO L193 MainTranslator]: Completed translation [2018-11-07 00:45:07,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:07 WrapperNode [2018-11-07 00:45:07,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 00:45:07,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 00:45:07,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 00:45:07,503 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 00:45:07,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:07" (1/1) ... [2018-11-07 00:45:07,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:07" (1/1) ... [2018-11-07 00:45:07,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 00:45:07,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 00:45:07,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 00:45:07,814 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 00:45:07,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:07" (1/1) ... [2018-11-07 00:45:07,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:07" (1/1) ... [2018-11-07 00:45:07,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:07" (1/1) ... [2018-11-07 00:45:07,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:07" (1/1) ... [2018-11-07 00:45:07,965 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:07" (1/1) ... [2018-11-07 00:45:08,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:07" (1/1) ... [2018-11-07 00:45:08,047 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:07" (1/1) ... [2018-11-07 00:45:08,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 00:45:08,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 00:45:08,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 00:45:08,080 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 00:45:08,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:07" (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 00:45:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-07 00:45:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 00:45:08,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 00:45:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output3 [2018-11-07 00:45:08,156 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output3 [2018-11-07 00:45:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-11-07 00:45:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-11-07 00:45:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-07 00:45:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-07 00:45:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 00:45:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 00:45:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 00:45:08,158 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 00:45:15,972 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 00:45:15,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:45:15 BoogieIcfgContainer [2018-11-07 00:45:15,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 00:45:15,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 00:45:15,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 00:45:15,978 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 00:45:15,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:45:05" (1/3) ... [2018-11-07 00:45:15,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f59dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:45:15, skipping insertion in model container [2018-11-07 00:45:15,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:45:07" (2/3) ... [2018-11-07 00:45:15,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f59dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:45:15, skipping insertion in model container [2018-11-07 00:45:15,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:45:15" (3/3) ... [2018-11-07 00:45:15,982 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label08_false-unreach-call.c [2018-11-07 00:45:15,992 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 00:45:16,003 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 00:45:16,021 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 00:45:16,065 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 00:45:16,065 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 00:45:16,065 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 00:45:16,065 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 00:45:16,065 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 00:45:16,066 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 00:45:16,066 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 00:45:16,066 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 00:45:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states. [2018-11-07 00:45:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 00:45:16,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:45:16,114 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] [2018-11-07 00:45:16,117 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:45:16,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:45:16,123 INFO L82 PathProgramCache]: Analyzing trace with hash 735211228, now seen corresponding path program 1 times [2018-11-07 00:45:16,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:45:16,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:45:16,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:45:16,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:45:16,172 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:45:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:45:16,576 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 3 [2018-11-07 00:45:16,591 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 00:45:16,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:45:16,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 00:45:16,594 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:45:16,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 00:45:16,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 00:45:16,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 00:45:16,646 INFO L87 Difference]: Start difference. First operand 775 states. Second operand 4 states. [2018-11-07 00:45:27,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:45:27,481 INFO L93 Difference]: Finished difference Result 2974 states and 5747 transitions. [2018-11-07 00:45:27,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 00:45:27,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-07 00:45:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:45:27,523 INFO L225 Difference]: With dead ends: 2974 [2018-11-07 00:45:27,523 INFO L226 Difference]: Without dead ends: 2193 [2018-11-07 00:45:27,536 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 00:45:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2193 states. [2018-11-07 00:45:27,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2193 to 1474. [2018-11-07 00:45:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1474 states. [2018-11-07 00:45:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 2384 transitions. [2018-11-07 00:45:27,715 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 2384 transitions. Word has length 28 [2018-11-07 00:45:27,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:45:27,716 INFO L480 AbstractCegarLoop]: Abstraction has 1474 states and 2384 transitions. [2018-11-07 00:45:27,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 00:45:27,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 2384 transitions. [2018-11-07 00:45:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-07 00:45:27,727 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:45:27,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:45:27,728 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:45:27,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:45:27,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1723286230, now seen corresponding path program 1 times [2018-11-07 00:45:27,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:45:27,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:45:27,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:45:27,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:45:27,731 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:45:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:45:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:45:28,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:45:28,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 00:45:28,077 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:45:28,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 00:45:28,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 00:45:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 00:45:28,086 INFO L87 Difference]: Start difference. First operand 1474 states and 2384 transitions. Second operand 5 states. [2018-11-07 00:45:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:45:37,025 INFO L93 Difference]: Finished difference Result 4422 states and 7235 transitions. [2018-11-07 00:45:37,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 00:45:37,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-11-07 00:45:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:45:37,053 INFO L225 Difference]: With dead ends: 4422 [2018-11-07 00:45:37,053 INFO L226 Difference]: Without dead ends: 2954 [2018-11-07 00:45:37,061 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-07 00:45:37,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-11-07 00:45:37,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2930. [2018-11-07 00:45:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2930 states. [2018-11-07 00:45:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 4516 transitions. [2018-11-07 00:45:37,185 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 4516 transitions. Word has length 98 [2018-11-07 00:45:37,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:45:37,186 INFO L480 AbstractCegarLoop]: Abstraction has 2930 states and 4516 transitions. [2018-11-07 00:45:37,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 00:45:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 4516 transitions. [2018-11-07 00:45:37,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-07 00:45:37,195 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:45:37,196 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:45:37,196 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:45:37,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:45:37,197 INFO L82 PathProgramCache]: Analyzing trace with hash 374879586, now seen corresponding path program 1 times [2018-11-07 00:45:37,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:45:37,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:45:37,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:45:37,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:45:37,199 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:45:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:45:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:45:37,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:45:37,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 00:45:37,639 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:45:37,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 00:45:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 00:45:37,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 00:45:37,641 INFO L87 Difference]: Start difference. First operand 2930 states and 4516 transitions. Second operand 6 states. [2018-11-07 00:45:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:45:45,629 INFO L93 Difference]: Finished difference Result 10279 states and 16084 transitions. [2018-11-07 00:45:45,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 00:45:45,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-11-07 00:45:45,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:45:45,692 INFO L225 Difference]: With dead ends: 10279 [2018-11-07 00:45:45,692 INFO L226 Difference]: Without dead ends: 7355 [2018-11-07 00:45:45,713 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 00:45:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7355 states. [2018-11-07 00:45:45,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7355 to 7296. [2018-11-07 00:45:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7296 states. [2018-11-07 00:45:45,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7296 states to 7296 states and 10495 transitions. [2018-11-07 00:45:45,961 INFO L78 Accepts]: Start accepts. Automaton has 7296 states and 10495 transitions. Word has length 102 [2018-11-07 00:45:45,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:45:45,962 INFO L480 AbstractCegarLoop]: Abstraction has 7296 states and 10495 transitions. [2018-11-07 00:45:45,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 00:45:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 7296 states and 10495 transitions. [2018-11-07 00:45:45,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-07 00:45:45,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:45:45,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:45:45,975 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:45:45,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:45:45,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1832820439, now seen corresponding path program 1 times [2018-11-07 00:45:45,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:45:45,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:45:45,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:45:45,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:45:45,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:45:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:45:46,270 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-11-07 00:45:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:45:46,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:45:46,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 00:45:46,434 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:45:46,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 00:45:46,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 00:45:46,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 00:45:46,437 INFO L87 Difference]: Start difference. First operand 7296 states and 10495 transitions. Second operand 6 states. [2018-11-07 00:45:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:45:54,100 INFO L93 Difference]: Finished difference Result 18993 states and 28013 transitions. [2018-11-07 00:45:54,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-07 00:45:54,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2018-11-07 00:45:54,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:45:54,156 INFO L225 Difference]: With dead ends: 18993 [2018-11-07 00:45:54,156 INFO L226 Difference]: Without dead ends: 11703 [2018-11-07 00:45:54,186 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 00:45:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11703 states. [2018-11-07 00:45:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11703 to 11639. [2018-11-07 00:45:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11639 states. [2018-11-07 00:45:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11639 states to 11639 states and 16002 transitions. [2018-11-07 00:45:54,448 INFO L78 Accepts]: Start accepts. Automaton has 11639 states and 16002 transitions. Word has length 123 [2018-11-07 00:45:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:45:54,449 INFO L480 AbstractCegarLoop]: Abstraction has 11639 states and 16002 transitions. [2018-11-07 00:45:54,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 00:45:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 11639 states and 16002 transitions. [2018-11-07 00:45:54,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-07 00:45:54,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:45:54,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:45:54,451 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:45:54,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:45:54,452 INFO L82 PathProgramCache]: Analyzing trace with hash 407388415, now seen corresponding path program 1 times [2018-11-07 00:45:54,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:45:54,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:45:54,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:45:54,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:45:54,453 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:45:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:45:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 00:45:54,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:45:54,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 00:45:54,657 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:45:54,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 00:45:54,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 00:45:54,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 00:45:54,658 INFO L87 Difference]: Start difference. First operand 11639 states and 16002 transitions. Second operand 4 states. [2018-11-07 00:46:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:46:01,122 INFO L93 Difference]: Finished difference Result 27522 states and 38221 transitions. [2018-11-07 00:46:01,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 00:46:01,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2018-11-07 00:46:01,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:46:01,177 INFO L225 Difference]: With dead ends: 27522 [2018-11-07 00:46:01,178 INFO L226 Difference]: Without dead ends: 15889 [2018-11-07 00:46:01,220 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 00:46:01,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15889 states. [2018-11-07 00:46:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15889 to 15886. [2018-11-07 00:46:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15886 states. [2018-11-07 00:46:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15886 states to 15886 states and 19859 transitions. [2018-11-07 00:46:01,655 INFO L78 Accepts]: Start accepts. Automaton has 15886 states and 19859 transitions. Word has length 135 [2018-11-07 00:46:01,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:46:01,655 INFO L480 AbstractCegarLoop]: Abstraction has 15886 states and 19859 transitions. [2018-11-07 00:46:01,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 00:46:01,655 INFO L276 IsEmpty]: Start isEmpty. Operand 15886 states and 19859 transitions. [2018-11-07 00:46:01,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-07 00:46:01,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:46:01,661 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 00:46:01,661 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:46:01,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:46:01,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1510117645, now seen corresponding path program 1 times [2018-11-07 00:46:01,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:46:01,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:46:01,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:46:01,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:46:01,663 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:46:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:46:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-07 00:46:01,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:46:01,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 00:46:01,904 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:46:01,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 00:46:01,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 00:46:01,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 00:46:01,906 INFO L87 Difference]: Start difference. First operand 15886 states and 19859 transitions. Second operand 4 states. [2018-11-07 00:46:09,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:46:09,413 INFO L93 Difference]: Finished difference Result 58570 states and 75868 transitions. [2018-11-07 00:46:09,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 00:46:09,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2018-11-07 00:46:09,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:46:09,577 INFO L225 Difference]: With dead ends: 58570 [2018-11-07 00:46:09,577 INFO L226 Difference]: Without dead ends: 42690 [2018-11-07 00:46:09,623 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 00:46:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42690 states. [2018-11-07 00:46:10,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42690 to 40570. [2018-11-07 00:46:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40570 states. [2018-11-07 00:46:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40570 states to 40570 states and 50550 transitions. [2018-11-07 00:46:10,686 INFO L78 Accepts]: Start accepts. Automaton has 40570 states and 50550 transitions. Word has length 205 [2018-11-07 00:46:10,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:46:10,686 INFO L480 AbstractCegarLoop]: Abstraction has 40570 states and 50550 transitions. [2018-11-07 00:46:10,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 00:46:10,686 INFO L276 IsEmpty]: Start isEmpty. Operand 40570 states and 50550 transitions. [2018-11-07 00:46:10,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-11-07 00:46:10,698 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:46:10,698 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-07 00:46:10,698 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:46:10,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:46:10,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1838878876, now seen corresponding path program 1 times [2018-11-07 00:46:10,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:46:10,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:46:10,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:46:10,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:46:10,710 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:46:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:46:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-07 00:46:11,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 00:46:11,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-07 00:46:11,015 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:46:11,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 00:46:11,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 00:46:11,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-07 00:46:11,017 INFO L87 Difference]: Start difference. First operand 40570 states and 50550 transitions. Second operand 4 states. [2018-11-07 00:46:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:46:18,687 INFO L93 Difference]: Finished difference Result 91037 states and 114482 transitions. [2018-11-07 00:46:18,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 00:46:18,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2018-11-07 00:46:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:46:18,862 INFO L225 Difference]: With dead ends: 91037 [2018-11-07 00:46:18,863 INFO L226 Difference]: Without dead ends: 50473 [2018-11-07 00:46:18,934 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 00:46:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50473 states. [2018-11-07 00:46:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50473 to 49061. [2018-11-07 00:46:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49061 states. [2018-11-07 00:46:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49061 states to 49061 states and 57553 transitions. [2018-11-07 00:46:20,089 INFO L78 Accepts]: Start accepts. Automaton has 49061 states and 57553 transitions. Word has length 286 [2018-11-07 00:46:20,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:46:20,090 INFO L480 AbstractCegarLoop]: Abstraction has 49061 states and 57553 transitions. [2018-11-07 00:46:20,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 00:46:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 49061 states and 57553 transitions. [2018-11-07 00:46:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-11-07 00:46:20,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:46:20,134 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 00:46:20,135 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:46:20,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:46:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1221704300, now seen corresponding path program 1 times [2018-11-07 00:46:20,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:46:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:46:20,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:46:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:46:20,137 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:46:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:46:20,683 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2018-11-07 00:46:21,026 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 00:46:21,462 WARN L179 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-11-07 00:46:21,812 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 42 proven. 157 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 00:46:21,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 00:46:21,812 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 00:46:21,813 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 415 with the following transitions: [2018-11-07 00:46:21,817 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1711], [1719], [1727], [1735], [1743], [1747], [1749], [1752], [1760], [1768], [1776], [1784], [1792], [1800], [1808], [1816], [1824], [1832], [1840], [1848], [1856], [1864], [1872], [1880], [1888], [1896], [1904], [1912], [1920], [1928], [1936], [1944], [1952], [1960], [1968], [1976], [1984], [1992], [2000], [2008], [2016], [2024], [2032], [2040], [2048], [2056], [2064], [2072], [2080], [2088], [2096], [2104], [2112], [2117], [2121], [2125], [2129], [2133], [2137], [2141], [2145], [2149], [2153], [2157], [2161], [2165], [2169], [2173], [2177], [2181], [2185], [2189], [2193], [2197], [2201], [2205], [2209], [2213], [2217], [2221], [2225], [2229], [2233], [2237], [2241], [2245], [2249], [2253], [2257], [2261], [2265], [2269], [2273], [2277], [2281], [2285], [2289], [2293], [2297], [2301], [2305], [2309], [2313], [2317], [2321], [2325], [2329], [2333], [2337], [2341], [2345], [2349], [2353], [2357], [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], [2484], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [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], [2732], [2996], [3000], [3004], [3010], [3014], [3016], [3025], [3026], [3027], [3029], [3030] [2018-11-07 00:46:21,905 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 00:46:21,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 00:46:28,769 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 00:46:28,909 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-07 00:46:28,910 INFO L272 AbstractInterpreter]: Visited 229 different actions 229 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-07 00:46:28,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:46:28,921 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-07 00:46:32,159 INFO L227 lantSequenceWeakener]: Weakened 406 states. On average, predicates are now at 77.43% of their original sizes. [2018-11-07 00:46:32,159 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-07 00:46:32,780 INFO L415 sIntCurrentIteration]: We unified 413 AI predicates to 413 [2018-11-07 00:46:32,781 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-07 00:46:32,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-07 00:46:32,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2018-11-07 00:46:32,782 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 00:46:32,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 00:46:32,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 00:46:32,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-07 00:46:32,784 INFO L87 Difference]: Start difference. First operand 49061 states and 57553 transitions. Second operand 8 states. [2018-11-07 00:48:31,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 00:48:31,129 INFO L93 Difference]: Finished difference Result 98821 states and 115925 transitions. [2018-11-07 00:48:31,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 00:48:31,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 414 [2018-11-07 00:48:31,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 00:48:31,262 INFO L225 Difference]: With dead ends: 98821 [2018-11-07 00:48:31,262 INFO L226 Difference]: Without dead ends: 49766 [2018-11-07 00:48:31,336 INFO L604 BasicCegarLoop]: 2 DeclaredPredicates, 415 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-07 00:48:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49766 states. [2018-11-07 00:48:31,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49766 to 49764. [2018-11-07 00:48:31,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49764 states. [2018-11-07 00:48:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49764 states to 49764 states and 58268 transitions. [2018-11-07 00:48:32,062 INFO L78 Accepts]: Start accepts. Automaton has 49764 states and 58268 transitions. Word has length 414 [2018-11-07 00:48:32,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 00:48:32,063 INFO L480 AbstractCegarLoop]: Abstraction has 49764 states and 58268 transitions. [2018-11-07 00:48:32,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 00:48:32,063 INFO L276 IsEmpty]: Start isEmpty. Operand 49764 states and 58268 transitions. [2018-11-07 00:48:32,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2018-11-07 00:48:32,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 00:48:32,106 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:48:32,106 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 00:48:32,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 00:48:32,107 INFO L82 PathProgramCache]: Analyzing trace with hash 453031471, now seen corresponding path program 1 times [2018-11-07 00:48:32,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 00:48:32,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:48:32,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:48:32,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 00:48:32,108 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 00:48:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:48:32,785 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-07 00:48:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 122 proven. 447 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-07 00:48:33,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 00:48:33,817 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 00:48:33,817 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 602 with the following transitions: [2018-11-07 00:48:33,818 INFO L202 CegarAbsIntRunner]: [0], [1], [1624], [1631], [1639], [1647], [1655], [1663], [1671], [1679], [1687], [1695], [1703], [1711], [1719], [1727], [1735], [1743], [1747], [1749], [1752], [1760], [1768], [1776], [1784], [1792], [1800], [1808], [1816], [1824], [1832], [1840], [1848], [1856], [1864], [1872], [1880], [1888], [1896], [1904], [1912], [1920], [1928], [1936], [1944], [1952], [1960], [1968], [1976], [1984], [1992], [2000], [2008], [2016], [2024], [2032], [2040], [2048], [2056], [2064], [2072], [2080], [2088], [2096], [2104], [2112], [2117], [2121], [2125], [2129], [2133], [2137], [2141], [2145], [2149], [2153], [2157], [2161], [2165], [2169], [2173], [2177], [2181], [2185], [2189], [2193], [2197], [2201], [2205], [2209], [2213], [2217], [2221], [2225], [2229], [2233], [2237], [2241], [2245], [2249], [2253], [2257], [2261], [2265], [2269], [2273], [2277], [2281], [2285], [2289], [2293], [2297], [2301], [2305], [2309], [2313], [2317], [2321], [2325], [2329], [2333], [2337], [2341], [2345], [2349], [2353], [2357], [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], [2484], [2485], [2489], [2493], [2497], [2501], [2505], [2509], [2513], [2517], [2521], [2525], [2529], [2533], [2537], [2541], [2545], [2549], [2553], [2557], [2561], [2565], [2569], [2573], [2577], [2581], [2584], [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], [2732], [2996], [3000], [3004], [3010], [3014], [3016], [3025], [3026], [3027], [3029], [3030] [2018-11-07 00:48:33,827 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 00:48:33,828 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 00:48:38,900 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. Received shutdown request... [2018-11-07 00:48:45,074 WARN L572 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-11-07 00:48:45,075 WARN L158 AbstractInterpreter]: Abstract interpretation run out of time [2018-11-07 00:48:45,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 00:48:45,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 00:48:45,076 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 00:48:45,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 00:48:45,087 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 00:48:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 00:48:45,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 00:48:45,327 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 00:48:45,529 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 00:48:45,529 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 00:48:45,537 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 00:48:45,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:48:45 BoogieIcfgContainer [2018-11-07 00:48:45,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 00:48:45,540 INFO L168 Benchmark]: Toolchain (without parser) took 219785.76 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 298.5 MB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-11-07 00:48:45,541 INFO L168 Benchmark]: CDTParser took 0.21 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 00:48:45,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1747.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. [2018-11-07 00:48:45,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 310.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 782.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -972.6 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-11-07 00:48:45,553 INFO L168 Benchmark]: Boogie Preprocessor took 265.14 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: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2018-11-07 00:48:45,554 INFO L168 Benchmark]: RCFGBuilder took 7894.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 520.8 MB). Peak memory consumption was 520.8 MB. Max. memory is 7.1 GB. [2018-11-07 00:48:45,555 INFO L168 Benchmark]: TraceAbstraction took 209563.33 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 1.1 GB in the end (delta: 588.2 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-07 00:48:45,567 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.21 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 1747.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 148.0 MB). Peak memory consumption was 148.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 310.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 782.8 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -972.6 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 265.14 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: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 7894.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 520.8 MB). Peak memory consumption was 520.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 209563.33 ms. Allocated memory was 2.3 GB in the beginning and 4.1 GB in the end (delta: 1.8 GB). Free memory was 1.7 GB in the beginning and 1.1 GB in the end (delta: 588.2 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 72). Cancelled while BasicCegarLoop was analyzing trace of length 602 with TraceHistMax 4,while TraceCheckSpWp was constructing forward predicates,while XnfDer was eliminating 1 quantified variables from 2 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 775 locations, 1 error locations. TIMEOUT Result, 209.4s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 176.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3445 SDtfs, 15955 SDslu, 1355 SDs, 0 SdLazy, 36728 SolverSat, 9222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 124.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 465 GetRequests, 426 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49764occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 18.3s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.9975567603607397 AbsIntWeakeningRatio, 0.06295399515738499 AbsIntAvgWeakeningVarsNumRemoved, 910.1573849878935 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 4403 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1391 NumberOfCodeBlocks, 1391 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1383 ConstructedInterpolants, 0 QuantifiedInterpolants, 2153327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 392/549 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown