java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label51.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 20:47:00,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 20:47:00,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 20:47:00,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 20:47:00,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 20:47:00,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 20:47:00,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 20:47:00,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 20:47:00,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 20:47:00,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 20:47:00,937 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 20:47:00,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 20:47:00,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 20:47:00,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 20:47:00,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 20:47:00,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 20:47:00,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 20:47:00,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 20:47:00,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 20:47:00,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 20:47:00,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 20:47:00,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 20:47:00,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 20:47:00,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 20:47:00,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 20:47:00,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 20:47:00,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 20:47:00,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 20:47:00,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 20:47:00,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 20:47:00,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 20:47:00,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 20:47:00,957 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 20:47:00,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 20:47:00,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 20:47:00,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 20:47:00,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 20:47:00,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 20:47:00,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 20:47:00,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 20:47:00,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 20:47:00,963 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 20:47:00,978 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 20:47:00,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 20:47:00,979 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 20:47:00,979 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 20:47:00,980 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 20:47:00,980 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 20:47:00,980 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 20:47:00,981 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 20:47:00,981 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 20:47:00,981 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 20:47:00,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 20:47:00,982 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 20:47:00,982 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 20:47:00,982 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 20:47:00,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 20:47:00,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 20:47:00,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 20:47:00,983 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 20:47:00,983 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 20:47:00,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 20:47:00,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 20:47:00,984 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 20:47:00,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 20:47:00,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 20:47:00,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 20:47:00,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 20:47:00,985 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 20:47:00,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 20:47:00,985 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 20:47:00,985 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 20:47:01,014 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 20:47:01,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 20:47:01,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 20:47:01,030 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 20:47:01,031 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 20:47:01,032 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label51.c [2019-10-02 20:47:01,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541ca2132/95f6d5c91be948a081318240f257bbdb/FLAG858ddb026 [2019-10-02 20:47:01,720 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 20:47:01,721 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label51.c [2019-10-02 20:47:01,735 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541ca2132/95f6d5c91be948a081318240f257bbdb/FLAG858ddb026 [2019-10-02 20:47:01,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541ca2132/95f6d5c91be948a081318240f257bbdb [2019-10-02 20:47:01,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 20:47:01,958 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 20:47:01,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 20:47:01,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 20:47:01,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 20:47:01,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:47:01" (1/1) ... [2019-10-02 20:47:01,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409c6ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:47:01, skipping insertion in model container [2019-10-02 20:47:01,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:47:01" (1/1) ... [2019-10-02 20:47:01,979 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 20:47:02,043 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 20:47:02,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 20:47:02,653 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 20:47:02,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 20:47:02,817 INFO L192 MainTranslator]: Completed translation [2019-10-02 20:47:02,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:47:02 WrapperNode [2019-10-02 20:47:02,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 20:47:02,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 20:47:02,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 20:47:02,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 20:47:02,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:47:02" (1/1) ... [2019-10-02 20:47:02,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:47:02" (1/1) ... [2019-10-02 20:47:02,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:47:02" (1/1) ... [2019-10-02 20:47:02,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:47:02" (1/1) ... [2019-10-02 20:47:02,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:47:02" (1/1) ... [2019-10-02 20:47:02,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:47:02" (1/1) ... [2019-10-02 20:47:02,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:47:02" (1/1) ... [2019-10-02 20:47:02,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 20:47:02,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 20:47:02,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 20:47:02,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 20:47:02,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:47:02" (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 [2019-10-02 20:47:03,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 20:47:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 20:47:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 20:47:03,058 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 20:47:03,058 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 20:47:03,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 20:47:03,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 20:47:03,059 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 20:47:03,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 20:47:03,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 20:47:03,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 20:47:04,858 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 20:47:04,859 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 20:47:04,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:47:04 BoogieIcfgContainer [2019-10-02 20:47:04,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 20:47:04,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 20:47:04,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 20:47:04,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 20:47:04,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 08:47:01" (1/3) ... [2019-10-02 20:47:04,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162ba84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:47:04, skipping insertion in model container [2019-10-02 20:47:04,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:47:02" (2/3) ... [2019-10-02 20:47:04,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162ba84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:47:04, skipping insertion in model container [2019-10-02 20:47:04,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:47:04" (3/3) ... [2019-10-02 20:47:04,871 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label51.c [2019-10-02 20:47:04,883 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 20:47:04,894 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 20:47:04,915 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 20:47:04,954 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 20:47:04,955 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 20:47:04,956 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 20:47:04,956 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 20:47:04,956 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 20:47:04,956 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 20:47:04,957 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 20:47:04,957 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 20:47:04,995 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-10-02 20:47:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 20:47:05,009 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:47:05,010 INFO L411 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] [2019-10-02 20:47:05,013 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:47:05,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:47:05,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1352567654, now seen corresponding path program 1 times [2019-10-02 20:47:05,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:47:05,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:47:05,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:47:05,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:47:05,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:47:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:47:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:47:05,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:47:05,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 20:47:05,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:47:05,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:47:05,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:47:05,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:47:05,413 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 3 states. [2019-10-02 20:47:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:47:07,453 INFO L93 Difference]: Finished difference Result 440 states and 713 transitions. [2019-10-02 20:47:07,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:47:07,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-02 20:47:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:47:07,473 INFO L225 Difference]: With dead ends: 440 [2019-10-02 20:47:07,474 INFO L226 Difference]: Without dead ends: 372 [2019-10-02 20:47:07,475 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:47:07,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-10-02 20:47:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2019-10-02 20:47:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-02 20:47:07,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 596 transitions. [2019-10-02 20:47:07,553 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 596 transitions. Word has length 41 [2019-10-02 20:47:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:47:07,554 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 596 transitions. [2019-10-02 20:47:07,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:47:07,554 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 596 transitions. [2019-10-02 20:47:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-02 20:47:07,560 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:47:07,561 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:47:07,561 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:47:07,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:47:07,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1876604734, now seen corresponding path program 1 times [2019-10-02 20:47:07,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:47:07,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:47:07,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:47:07,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:47:07,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:47:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:47:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:47:07,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:47:07,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 20:47:07,775 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:47:07,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 20:47:07,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 20:47:07,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 20:47:07,779 INFO L87 Difference]: Start difference. First operand 372 states and 596 transitions. Second operand 5 states. [2019-10-02 20:47:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:47:09,345 INFO L93 Difference]: Finished difference Result 574 states and 848 transitions. [2019-10-02 20:47:09,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 20:47:09,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-10-02 20:47:09,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:47:09,356 INFO L225 Difference]: With dead ends: 574 [2019-10-02 20:47:09,356 INFO L226 Difference]: Without dead ends: 574 [2019-10-02 20:47:09,357 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 20:47:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-02 20:47:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 564. [2019-10-02 20:47:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-02 20:47:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 831 transitions. [2019-10-02 20:47:09,436 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 831 transitions. Word has length 117 [2019-10-02 20:47:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:47:09,437 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 831 transitions. [2019-10-02 20:47:09,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 20:47:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 831 transitions. [2019-10-02 20:47:09,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 20:47:09,448 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:47:09,448 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:47:09,449 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:47:09,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:47:09,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1520330050, now seen corresponding path program 1 times [2019-10-02 20:47:09,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:47:09,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:47:09,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:47:09,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:47:09,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:47:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:47:09,796 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:47:09,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:47:09,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 20:47:09,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:47:09,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 20:47:09,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 20:47:09,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 20:47:09,799 INFO L87 Difference]: Start difference. First operand 564 states and 831 transitions. Second operand 6 states. [2019-10-02 20:47:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:47:11,211 INFO L93 Difference]: Finished difference Result 968 states and 1421 transitions. [2019-10-02 20:47:11,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 20:47:11,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-10-02 20:47:11,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:47:11,223 INFO L225 Difference]: With dead ends: 968 [2019-10-02 20:47:11,224 INFO L226 Difference]: Without dead ends: 968 [2019-10-02 20:47:11,225 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 20:47:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-10-02 20:47:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 942. [2019-10-02 20:47:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-10-02 20:47:11,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1352 transitions. [2019-10-02 20:47:11,284 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1352 transitions. Word has length 181 [2019-10-02 20:47:11,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:47:11,285 INFO L475 AbstractCegarLoop]: Abstraction has 942 states and 1352 transitions. [2019-10-02 20:47:11,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 20:47:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1352 transitions. [2019-10-02 20:47:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 20:47:11,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:47:11,290 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 20:47:11,291 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:47:11,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:47:11,291 INFO L82 PathProgramCache]: Analyzing trace with hash -906348779, now seen corresponding path program 1 times [2019-10-02 20:47:11,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:47:11,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:47:11,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:47:11,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:47:11,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:47:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:47:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 142 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:47:11,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:47:11,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:47:11,459 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 201 with the following transitions: [2019-10-02 20:47:11,461 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:47:11,518 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:47:11,518 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:47:15,160 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:47:15,162 INFO L272 AbstractInterpreter]: Visited 88 different actions 88 times. Never merged. Never widened. Performed 215 root evaluator evaluations with a maximum evaluation depth of 13. Performed 215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Never found a fixpoint. Largest state had 24 variables. [2019-10-02 20:47:15,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:47:15,166 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:47:18,377 INFO L227 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 78.01% of their original sizes. [2019-10-02 20:47:18,377 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:47:18,450 INFO L420 sIntCurrentIteration]: We unified 199 AI predicates to 199 [2019-10-02 20:47:18,450 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:47:18,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:47:18,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2019-10-02 20:47:18,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:47:18,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 20:47:18,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 20:47:18,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:47:18,453 INFO L87 Difference]: Start difference. First operand 942 states and 1352 transitions. Second operand 10 states. [2019-10-02 20:48:35,129 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:51:10,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:51:10,165 INFO L93 Difference]: Finished difference Result 1128 states and 1547 transitions. [2019-10-02 20:51:10,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 20:51:10,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 200 [2019-10-02 20:51:10,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:51:10,173 INFO L225 Difference]: With dead ends: 1128 [2019-10-02 20:51:10,173 INFO L226 Difference]: Without dead ends: 1128 [2019-10-02 20:51:10,174 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-10-02 20:51:10,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-10-02 20:51:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1124. [2019-10-02 20:51:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-10-02 20:51:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1541 transitions. [2019-10-02 20:51:10,210 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1541 transitions. Word has length 200 [2019-10-02 20:51:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:51:10,211 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1541 transitions. [2019-10-02 20:51:10,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 20:51:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1541 transitions. [2019-10-02 20:51:10,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-02 20:51:10,217 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:51:10,218 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:51:10,218 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:51:10,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:51:10,219 INFO L82 PathProgramCache]: Analyzing trace with hash 42666077, now seen corresponding path program 1 times [2019-10-02 20:51:10,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:51:10,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:51:10,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:51:10,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:51:10,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:51:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:51:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 187 proven. 146 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 20:51:11,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:51:11,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:51:11,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2019-10-02 20:51:11,062 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:51:11,073 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:51:11,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:51:14,927 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:51:14,928 INFO L272 AbstractInterpreter]: Visited 93 different actions 181 times. Merged at 4 different actions 5 times. Never widened. Performed 400 root evaluator evaluations with a maximum evaluation depth of 13. Performed 400 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 20:51:14,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:51:14,929 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:51:17,099 INFO L227 lantSequenceWeakener]: Weakened 281 states. On average, predicates are now at 77.66% of their original sizes. [2019-10-02 20:51:17,100 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:51:17,194 INFO L420 sIntCurrentIteration]: We unified 283 AI predicates to 283 [2019-10-02 20:51:17,194 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:51:17,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:51:17,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2019-10-02 20:51:17,195 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:51:17,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 20:51:17,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 20:51:17,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:51:17,196 INFO L87 Difference]: Start difference. First operand 1124 states and 1541 transitions. Second operand 11 states. [2019-10-02 20:51:48,937 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:53:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:53:08,286 INFO L93 Difference]: Finished difference Result 1340 states and 1768 transitions. [2019-10-02 20:53:08,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 20:53:08,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 284 [2019-10-02 20:53:08,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:53:08,293 INFO L225 Difference]: With dead ends: 1340 [2019-10-02 20:53:08,294 INFO L226 Difference]: Without dead ends: 1340 [2019-10-02 20:53:08,294 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:53:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-10-02 20:53:08,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1124. [2019-10-02 20:53:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-10-02 20:53:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1541 transitions. [2019-10-02 20:53:08,326 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1541 transitions. Word has length 284 [2019-10-02 20:53:08,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:53:08,326 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1541 transitions. [2019-10-02 20:53:08,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 20:53:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1541 transitions. [2019-10-02 20:53:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-02 20:53:08,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:53:08,332 INFO L411 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:53:08,333 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:53:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:53:08,333 INFO L82 PathProgramCache]: Analyzing trace with hash -322300343, now seen corresponding path program 1 times [2019-10-02 20:53:08,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:53:08,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:53:08,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:53:08,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:53:08,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:53:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:53:08,809 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 159 proven. 125 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 20:53:08,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:53:08,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:53:08,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 311 with the following transitions: [2019-10-02 20:53:08,820 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:53:08,830 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:53:08,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:53:22,523 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:53:22,524 INFO L272 AbstractInterpreter]: Visited 119 different actions 233 times. Merged at 4 different actions 5 times. Never widened. Performed 557 root evaluator evaluations with a maximum evaluation depth of 13. Performed 557 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 20:53:22,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:53:22,525 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:53:29,490 INFO L227 lantSequenceWeakener]: Weakened 307 states. On average, predicates are now at 77.63% of their original sizes. [2019-10-02 20:53:29,490 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:53:29,577 INFO L420 sIntCurrentIteration]: We unified 309 AI predicates to 309 [2019-10-02 20:53:29,578 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:53:29,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:53:29,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2019-10-02 20:53:29,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:53:29,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 20:53:29,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 20:53:29,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:53:29,580 INFO L87 Difference]: Start difference. First operand 1124 states and 1541 transitions. Second operand 11 states. [2019-10-02 20:54:10,596 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:56:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:56:13,189 INFO L93 Difference]: Finished difference Result 1492 states and 1931 transitions. [2019-10-02 20:56:13,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 20:56:13,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 310 [2019-10-02 20:56:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:56:13,196 INFO L225 Difference]: With dead ends: 1492 [2019-10-02 20:56:13,197 INFO L226 Difference]: Without dead ends: 1492 [2019-10-02 20:56:13,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2019-10-02 20:56:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2019-10-02 20:56:13,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1490. [2019-10-02 20:56:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2019-10-02 20:56:13,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1929 transitions. [2019-10-02 20:56:13,228 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1929 transitions. Word has length 310 [2019-10-02 20:56:13,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:56:13,229 INFO L475 AbstractCegarLoop]: Abstraction has 1490 states and 1929 transitions. [2019-10-02 20:56:13,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 20:56:13,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1929 transitions. [2019-10-02 20:56:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-02 20:56:13,235 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:56:13,236 INFO L411 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:56:13,236 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:56:13,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:56:13,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1143235427, now seen corresponding path program 1 times [2019-10-02 20:56:13,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:56:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:56:13,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:56:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:56:13,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:56:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:56:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 255 proven. 2 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 20:56:13,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:56:13,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:56:13,518 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 337 with the following transitions: [2019-10-02 20:56:13,518 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:56:13,525 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:56:13,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:56:26,156 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:56:52,201 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:56:52,202 INFO L272 AbstractInterpreter]: Visited 119 different actions 580 times. Merged at 6 different actions 25 times. Never widened. Performed 1147 root evaluator evaluations with a maximum evaluation depth of 22. Performed 1147 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 5 fixpoints after 2 different actions. Largest state had 24 variables. [2019-10-02 20:56:52,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:56:52,202 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:56:59,372 INFO L227 lantSequenceWeakener]: Weakened 333 states. On average, predicates are now at 77.6% of their original sizes. [2019-10-02 20:56:59,372 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:56:59,438 INFO L420 sIntCurrentIteration]: We unified 335 AI predicates to 335 [2019-10-02 20:56:59,438 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:56:59,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:56:59,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 15 [2019-10-02 20:56:59,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:56:59,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 20:56:59,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 20:56:59,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:56:59,440 INFO L87 Difference]: Start difference. First operand 1490 states and 1929 transitions. Second operand 10 states. [2019-10-02 20:58:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:58:27,291 INFO L93 Difference]: Finished difference Result 1683 states and 2160 transitions. [2019-10-02 20:58:27,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 20:58:27,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 336 [2019-10-02 20:58:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:58:27,301 INFO L225 Difference]: With dead ends: 1683 [2019-10-02 20:58:27,301 INFO L226 Difference]: Without dead ends: 1683 [2019-10-02 20:58:27,301 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:58:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-10-02 20:58:27,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1676. [2019-10-02 20:58:27,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1676 states. [2019-10-02 20:58:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2153 transitions. [2019-10-02 20:58:27,338 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2153 transitions. Word has length 336 [2019-10-02 20:58:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:58:27,338 INFO L475 AbstractCegarLoop]: Abstraction has 1676 states and 2153 transitions. [2019-10-02 20:58:27,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 20:58:27,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2153 transitions. [2019-10-02 20:58:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-10-02 20:58:27,346 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:58:27,346 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-10-02 20:58:27,347 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:58:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:58:27,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1924245905, now seen corresponding path program 1 times [2019-10-02 20:58:27,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:58:27,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:58:27,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:58:27,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:58:27,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:58:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:58:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 226 proven. 157 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-10-02 20:58:27,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:58:27,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:58:27,719 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 395 with the following transitions: [2019-10-02 20:58:27,719 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [237], [239], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:58:27,723 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:58:27,724 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:58:41,922 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:58:41,922 INFO L272 AbstractInterpreter]: Visited 120 different actions 357 times. Merged at 6 different actions 17 times. Never widened. Performed 652 root evaluator evaluations with a maximum evaluation depth of 13. Performed 652 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2019-10-02 20:58:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:58:41,923 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:58:45,337 INFO L227 lantSequenceWeakener]: Weakened 391 states. On average, predicates are now at 77.57% of their original sizes. [2019-10-02 20:58:45,337 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:58:45,399 INFO L420 sIntCurrentIteration]: We unified 393 AI predicates to 393 [2019-10-02 20:58:45,400 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:58:45,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:58:45,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2019-10-02 20:58:45,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:58:45,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 20:58:45,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 20:58:45,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:58:45,402 INFO L87 Difference]: Start difference. First operand 1676 states and 2153 transitions. Second operand 10 states. [2019-10-02 20:59:20,111 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.