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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem17_label45_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dace188-m [2018-09-14 18:06:56,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-14 18:06:56,956 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-14 18:06:56,968 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-14 18:06:56,968 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-14 18:06:56,969 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-14 18:06:56,970 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-14 18:06:56,972 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-14 18:06:56,974 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-14 18:06:56,974 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-14 18:06:56,975 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-14 18:06:56,976 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-14 18:06:56,977 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-14 18:06:56,977 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-14 18:06:56,979 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-14 18:06:56,979 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-14 18:06:56,980 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-14 18:06:56,982 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-14 18:06:56,984 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-14 18:06:56,989 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-14 18:06:56,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-14 18:06:56,994 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-14 18:06:56,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-14 18:06:56,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-14 18:06:56,998 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-14 18:06:56,999 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-14 18:06:57,000 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-14 18:06:57,003 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-14 18:06:57,005 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-14 18:06:57,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-14 18:06:57,007 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-14 18:06:57,008 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-14 18:06:57,008 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-14 18:06:57,008 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-14 18:06:57,011 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-14 18:06:57,012 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-14 18:06:57,012 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-09-14 18:06:57,030 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-14 18:06:57,030 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-14 18:06:57,031 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-14 18:06:57,031 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-14 18:06:57,031 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-14 18:06:57,032 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-14 18:06:57,032 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-14 18:06:57,032 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-14 18:06:57,032 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-14 18:06:57,032 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-14 18:06:57,033 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-14 18:06:57,033 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-14 18:06:57,034 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-14 18:06:57,034 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-14 18:06:57,034 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-14 18:06:57,034 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-14 18:06:57,034 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-14 18:06:57,034 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-14 18:06:57,035 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-14 18:06:57,035 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-14 18:06:57,035 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-14 18:06:57,035 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-14 18:06:57,035 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-14 18:06:57,036 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-14 18:06:57,036 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-14 18:06:57,036 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-14 18:06:57,036 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-14 18:06:57,036 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-14 18:06:57,037 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-14 18:06:57,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-14 18:06:57,037 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-14 18:06:57,037 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-14 18:06:57,037 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-14 18:06:57,080 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-14 18:06:57,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-14 18:06:57,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-14 18:06:57,100 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-14 18:06:57,100 INFO L276 PluginConnector]: CDTParser initialized [2018-09-14 18:06:57,101 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem17_label45_true-unreach-call.c [2018-09-14 18:06:57,466 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a03a24997/dc4234429ac04b59887bb4fbc3fd6ce5/FLAGa775780b1 [2018-09-14 18:06:57,908 INFO L277 CDTParser]: Found 1 translation units. [2018-09-14 18:06:57,910 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem17_label45_true-unreach-call.c [2018-09-14 18:06:57,934 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a03a24997/dc4234429ac04b59887bb4fbc3fd6ce5/FLAGa775780b1 [2018-09-14 18:06:57,950 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a03a24997/dc4234429ac04b59887bb4fbc3fd6ce5 [2018-09-14 18:06:57,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-14 18:06:57,965 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-14 18:06:57,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-14 18:06:57,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-14 18:06:57,974 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-14 18:06:57,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 06:06:57" (1/1) ... [2018-09-14 18:06:57,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a64aa8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:06:57, skipping insertion in model container [2018-09-14 18:06:57,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.09 06:06:57" (1/1) ... [2018-09-14 18:06:57,994 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-14 18:06:59,094 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 18:06:59,115 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-14 18:06:59,494 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-14 18:06:59,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:06:59 WrapperNode [2018-09-14 18:06:59,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-14 18:06:59,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-14 18:06:59,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-14 18:06:59,719 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-14 18:06:59,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:06:59" (1/1) ... [2018-09-14 18:06:59,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:06:59" (1/1) ... [2018-09-14 18:07:00,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-14 18:07:00,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-14 18:07:00,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-14 18:07:00,023 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-14 18:07:00,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:06:59" (1/1) ... [2018-09-14 18:07:00,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:06:59" (1/1) ... [2018-09-14 18:07:00,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:06:59" (1/1) ... [2018-09-14 18:07:00,646 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:06:59" (1/1) ... [2018-09-14 18:07:00,755 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:06:59" (1/1) ... [2018-09-14 18:07:00,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:06:59" (1/1) ... [2018-09-14 18:07:00,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:06:59" (1/1) ... [2018-09-14 18:07:00,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-14 18:07:00,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-14 18:07:00,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-14 18:07:00,893 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-14 18:07:00,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:06:59" (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-09-14 18:07:00,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-14 18:07:00,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-14 18:07:00,971 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2018-09-14 18:07:00,971 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2018-09-14 18:07:00,971 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-09-14 18:07:00,972 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-09-14 18:07:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-14 18:07:00,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-14 18:07:00,972 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-14 18:07:00,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-14 18:07:12,364 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-14 18:07:12,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 06:07:12 BoogieIcfgContainer [2018-09-14 18:07:12,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-14 18:07:12,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-14 18:07:12,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-14 18:07:12,370 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-14 18:07:12,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.09 06:06:57" (1/3) ... [2018-09-14 18:07:12,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b721b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 06:07:12, skipping insertion in model container [2018-09-14 18:07:12,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.09 06:06:59" (2/3) ... [2018-09-14 18:07:12,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b721b66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.09 06:07:12, skipping insertion in model container [2018-09-14 18:07:12,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.09 06:07:12" (3/3) ... [2018-09-14 18:07:12,374 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label45_true-unreach-call.c [2018-09-14 18:07:12,384 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-14 18:07:12,394 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-14 18:07:12,453 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-14 18:07:12,454 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-14 18:07:12,455 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-14 18:07:12,455 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-14 18:07:12,455 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-14 18:07:12,455 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-14 18:07:12,455 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-14 18:07:12,455 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-14 18:07:12,456 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-14 18:07:12,493 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-09-14 18:07:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-14 18:07:12,502 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:07:12,503 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 18:07:12,504 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:07:12,509 INFO L82 PathProgramCache]: Analyzing trace with hash 363269502, now seen corresponding path program 1 times [2018-09-14 18:07:12,511 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:07:12,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:07:12,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:07:12,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:07:12,563 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:07:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:07:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 18:07:13,022 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:07:13,023 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 18:07:13,023 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:07:13,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 18:07:13,044 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 18:07:13,045 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 18:07:13,047 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-09-14 18:07:24,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:07:24,986 INFO L93 Difference]: Finished difference Result 2166 states and 4013 transitions. [2018-09-14 18:07:24,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 18:07:24,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-09-14 18:07:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:07:25,030 INFO L225 Difference]: With dead ends: 2166 [2018-09-14 18:07:25,031 INFO L226 Difference]: Without dead ends: 1556 [2018-09-14 18:07:25,043 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-09-14 18:07:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2018-09-14 18:07:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1068. [2018-09-14 18:07:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2018-09-14 18:07:25,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1850 transitions. [2018-09-14 18:07:25,194 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1850 transitions. Word has length 57 [2018-09-14 18:07:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:07:25,195 INFO L480 AbstractCegarLoop]: Abstraction has 1068 states and 1850 transitions. [2018-09-14 18:07:25,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 18:07:25,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1850 transitions. [2018-09-14 18:07:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-14 18:07:25,203 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:07:25,204 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 18:07:25,204 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:07:25,204 INFO L82 PathProgramCache]: Analyzing trace with hash 448805847, now seen corresponding path program 1 times [2018-09-14 18:07:25,205 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:07:25,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:07:25,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:07:25,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:07:25,207 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:07:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:07:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 18:07:25,524 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:07:25,524 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 18:07:25,524 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:07:25,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 18:07:25,526 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 18:07:25,527 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 18:07:25,527 INFO L87 Difference]: Start difference. First operand 1068 states and 1850 transitions. Second operand 6 states. [2018-09-14 18:07:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:07:33,633 INFO L93 Difference]: Finished difference Result 3059 states and 5419 transitions. [2018-09-14 18:07:33,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 18:07:33,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-09-14 18:07:33,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:07:33,651 INFO L225 Difference]: With dead ends: 3059 [2018-09-14 18:07:33,651 INFO L226 Difference]: Without dead ends: 1997 [2018-09-14 18:07:33,656 INFO L604 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 [2018-09-14 18:07:33,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2018-09-14 18:07:33,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1975. [2018-09-14 18:07:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2018-09-14 18:07:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3181 transitions. [2018-09-14 18:07:33,745 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3181 transitions. Word has length 133 [2018-09-14 18:07:33,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:07:33,746 INFO L480 AbstractCegarLoop]: Abstraction has 1975 states and 3181 transitions. [2018-09-14 18:07:33,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 18:07:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3181 transitions. [2018-09-14 18:07:33,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-14 18:07:33,757 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:07:33,757 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 18:07:33,758 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:07:33,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1245309791, now seen corresponding path program 1 times [2018-09-14 18:07:33,758 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:07:33,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:07:33,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:07:33,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:07:33,760 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:07:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:07:34,055 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-09-14 18:07:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 18:07:34,313 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:07:34,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-09-14 18:07:34,313 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:07:34,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-14 18:07:34,314 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-14 18:07:34,314 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-09-14 18:07:34,314 INFO L87 Difference]: Start difference. First operand 1975 states and 3181 transitions. Second operand 6 states. [2018-09-14 18:07:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:07:40,488 INFO L93 Difference]: Finished difference Result 4880 states and 7834 transitions. [2018-09-14 18:07:40,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-14 18:07:40,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2018-09-14 18:07:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:07:40,507 INFO L225 Difference]: With dead ends: 4880 [2018-09-14 18:07:40,508 INFO L226 Difference]: Without dead ends: 2911 [2018-09-14 18:07:40,516 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-09-14 18:07:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2018-09-14 18:07:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2880. [2018-09-14 18:07:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2018-09-14 18:07:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3936 transitions. [2018-09-14 18:07:40,596 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3936 transitions. Word has length 137 [2018-09-14 18:07:40,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:07:40,597 INFO L480 AbstractCegarLoop]: Abstraction has 2880 states and 3936 transitions. [2018-09-14 18:07:40,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-14 18:07:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3936 transitions. [2018-09-14 18:07:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-14 18:07:40,600 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:07:40,601 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 18:07:40,601 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:07:40,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1452513378, now seen corresponding path program 1 times [2018-09-14 18:07:40,601 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:07:40,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:07:40,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:07:40,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:07:40,603 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:07:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:07:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-14 18:07:40,886 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:07:40,886 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 18:07:40,886 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:07:40,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 18:07:40,887 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 18:07:40,887 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 18:07:40,888 INFO L87 Difference]: Start difference. First operand 2880 states and 3936 transitions. Second operand 4 states. [2018-09-14 18:07:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:07:48,329 INFO L93 Difference]: Finished difference Result 6190 states and 8599 transitions. [2018-09-14 18:07:48,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 18:07:48,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-09-14 18:07:48,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:07:48,345 INFO L225 Difference]: With dead ends: 6190 [2018-09-14 18:07:48,345 INFO L226 Difference]: Without dead ends: 3316 [2018-09-14 18:07:48,356 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-09-14 18:07:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3316 states. [2018-09-14 18:07:48,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3316 to 3316. [2018-09-14 18:07:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3316 states. [2018-09-14 18:07:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 4437 transitions. [2018-09-14 18:07:48,448 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 4437 transitions. Word has length 167 [2018-09-14 18:07:48,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:07:48,449 INFO L480 AbstractCegarLoop]: Abstraction has 3316 states and 4437 transitions. [2018-09-14 18:07:48,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 18:07:48,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 4437 transitions. [2018-09-14 18:07:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-14 18:07:48,453 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:07:48,453 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-09-14 18:07:48,454 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:07:48,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1272782136, now seen corresponding path program 1 times [2018-09-14 18:07:48,454 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:07:48,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:07:48,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:07:48,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:07:48,455 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:07:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:07:48,751 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-09-14 18:07:48,751 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:07:48,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-14 18:07:48,751 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:07:48,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-14 18:07:48,752 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-14 18:07:48,753 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 18:07:48,753 INFO L87 Difference]: Start difference. First operand 3316 states and 4437 transitions. Second operand 3 states. [2018-09-14 18:07:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:07:57,564 INFO L93 Difference]: Finished difference Result 9271 states and 12485 transitions. [2018-09-14 18:07:57,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-14 18:07:57,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 221 [2018-09-14 18:07:57,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:07:57,590 INFO L225 Difference]: With dead ends: 9271 [2018-09-14 18:07:57,591 INFO L226 Difference]: Without dead ends: 5961 [2018-09-14 18:07:57,603 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-14 18:07:57,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5961 states. [2018-09-14 18:07:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5961 to 5961. [2018-09-14 18:07:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5961 states. [2018-09-14 18:07:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5961 states to 5961 states and 7394 transitions. [2018-09-14 18:07:57,744 INFO L78 Accepts]: Start accepts. Automaton has 5961 states and 7394 transitions. Word has length 221 [2018-09-14 18:07:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:07:57,745 INFO L480 AbstractCegarLoop]: Abstraction has 5961 states and 7394 transitions. [2018-09-14 18:07:57,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-14 18:07:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 5961 states and 7394 transitions. [2018-09-14 18:07:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-14 18:07:57,752 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:07:57,752 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-09-14 18:07:57,752 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:07:57,753 INFO L82 PathProgramCache]: Analyzing trace with hash -998255095, now seen corresponding path program 1 times [2018-09-14 18:07:57,753 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:07:57,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:07:57,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:07:57,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:07:57,754 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:07:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:07:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 100 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 18:07:58,314 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 18:07:58,314 INFO L197 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-09-14 18:07:58,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:07:58,324 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 18:07:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:07:58,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 18:07:59,018 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2018-09-14 18:07:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-09-14 18:07:59,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 18:07:59,999 WARN L178 SmtUtils]: Spent 611.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-09-14 18:08:01,005 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 100 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 18:08:01,027 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-14 18:08:01,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2018-09-14 18:08:01,028 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:08:01,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-14 18:08:01,029 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-14 18:08:01,029 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-09-14 18:08:01,029 INFO L87 Difference]: Start difference. First operand 5961 states and 7394 transitions. Second operand 5 states. [2018-09-14 18:08:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:08:11,844 INFO L93 Difference]: Finished difference Result 14151 states and 17394 transitions. [2018-09-14 18:08:11,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-14 18:08:11,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2018-09-14 18:08:11,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:08:11,888 INFO L225 Difference]: With dead ends: 14151 [2018-09-14 18:08:11,889 INFO L226 Difference]: Without dead ends: 8196 [2018-09-14 18:08:11,905 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 484 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-09-14 18:08:11,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8196 states. [2018-09-14 18:08:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8196 to 8142. [2018-09-14 18:08:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8142 states. [2018-09-14 18:08:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8142 states to 8142 states and 9898 transitions. [2018-09-14 18:08:12,133 INFO L78 Accepts]: Start accepts. Automaton has 8142 states and 9898 transitions. Word has length 244 [2018-09-14 18:08:12,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:08:12,133 INFO L480 AbstractCegarLoop]: Abstraction has 8142 states and 9898 transitions. [2018-09-14 18:08:12,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-14 18:08:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 8142 states and 9898 transitions. [2018-09-14 18:08:12,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-09-14 18:08:12,150 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:08:12,151 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 18:08:12,151 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:08:12,151 INFO L82 PathProgramCache]: Analyzing trace with hash 248035201, now seen corresponding path program 1 times [2018-09-14 18:08:12,151 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:08:12,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:08:12,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:08:12,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:08:12,153 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:08:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:08:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-09-14 18:08:12,532 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:08:12,532 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 18:08:12,533 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:08:12,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 18:08:12,533 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 18:08:12,534 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 18:08:12,534 INFO L87 Difference]: Start difference. First operand 8142 states and 9898 transitions. Second operand 4 states. [2018-09-14 18:08:21,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:08:21,792 INFO L93 Difference]: Finished difference Result 20975 states and 25995 transitions. [2018-09-14 18:08:21,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 18:08:21,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 287 [2018-09-14 18:08:21,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:08:21,863 INFO L225 Difference]: With dead ends: 20975 [2018-09-14 18:08:21,863 INFO L226 Difference]: Without dead ends: 12839 [2018-09-14 18:08:21,893 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-09-14 18:08:21,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12839 states. [2018-09-14 18:08:22,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12839 to 12805. [2018-09-14 18:08:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12805 states. [2018-09-14 18:08:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12805 states to 12805 states and 15327 transitions. [2018-09-14 18:08:22,173 INFO L78 Accepts]: Start accepts. Automaton has 12805 states and 15327 transitions. Word has length 287 [2018-09-14 18:08:22,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:08:22,174 INFO L480 AbstractCegarLoop]: Abstraction has 12805 states and 15327 transitions. [2018-09-14 18:08:22,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 18:08:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 12805 states and 15327 transitions. [2018-09-14 18:08:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-14 18:08:22,188 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:08:22,189 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 18:08:22,189 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:08:22,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1889614879, now seen corresponding path program 1 times [2018-09-14 18:08:22,189 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:08:22,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:08:22,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:08:22,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:08:22,191 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:08:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:08:23,022 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 160 proven. 142 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-09-14 18:08:23,023 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 18:08:23,023 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 18:08:23,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:08:23,037 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 18:08:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:08:23,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 18:08:23,577 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 17 [2018-09-14 18:08:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 254 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-09-14 18:08:23,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 18:08:25,714 WARN L178 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-09-14 18:08:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 160 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 18:08:26,384 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 18:08:26,384 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 18:08:26,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:08:26,401 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 18:08:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:08:26,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 18:08:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 254 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-09-14 18:08:26,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 18:08:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 160 proven. 211 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-14 18:08:27,712 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 18:08:27,712 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 7, 8] total 16 [2018-09-14 18:08:27,712 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 18:08:27,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-14 18:08:27,715 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-14 18:08:27,715 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-09-14 18:08:27,716 INFO L87 Difference]: Start difference. First operand 12805 states and 15327 transitions. Second operand 10 states. [2018-09-14 18:08:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:08:48,202 INFO L93 Difference]: Finished difference Result 44346 states and 55102 transitions. [2018-09-14 18:08:48,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-14 18:08:48,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 296 [2018-09-14 18:08:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:08:48,322 INFO L225 Difference]: With dead ends: 44346 [2018-09-14 18:08:48,322 INFO L226 Difference]: Without dead ends: 31547 [2018-09-14 18:08:48,364 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 1204 GetRequests, 1178 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2018-09-14 18:08:48,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31547 states. [2018-09-14 18:08:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31547 to 29979. [2018-09-14 18:08:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29979 states. [2018-09-14 18:08:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29979 states to 29979 states and 36321 transitions. [2018-09-14 18:08:48,984 INFO L78 Accepts]: Start accepts. Automaton has 29979 states and 36321 transitions. Word has length 296 [2018-09-14 18:08:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:08:48,984 INFO L480 AbstractCegarLoop]: Abstraction has 29979 states and 36321 transitions. [2018-09-14 18:08:48,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-14 18:08:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 29979 states and 36321 transitions. [2018-09-14 18:08:48,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-09-14 18:08:48,998 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:08:48,999 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 18:08:48,999 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:08:48,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1654593282, now seen corresponding path program 1 times [2018-09-14 18:08:48,999 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:08:49,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:08:49,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:08:49,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:08:49,001 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:08:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:08:49,486 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2018-09-14 18:08:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-09-14 18:08:49,536 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:08:49,536 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 18:08:49,536 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:08:49,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 18:08:49,537 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 18:08:49,537 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 18:08:49,538 INFO L87 Difference]: Start difference. First operand 29979 states and 36321 transitions. Second operand 4 states. [2018-09-14 18:08:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:08:57,356 INFO L93 Difference]: Finished difference Result 76283 states and 95455 transitions. [2018-09-14 18:08:57,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 18:08:57,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2018-09-14 18:08:57,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:08:57,515 INFO L225 Difference]: With dead ends: 76283 [2018-09-14 18:08:57,515 INFO L226 Difference]: Without dead ends: 46751 [2018-09-14 18:08:57,587 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 18:08:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46751 states. [2018-09-14 18:08:58,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46751 to 41370. [2018-09-14 18:08:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41370 states. [2018-09-14 18:08:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41370 states to 41370 states and 50084 transitions. [2018-09-14 18:08:58,376 INFO L78 Accepts]: Start accepts. Automaton has 41370 states and 50084 transitions. Word has length 319 [2018-09-14 18:08:58,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:08:58,376 INFO L480 AbstractCegarLoop]: Abstraction has 41370 states and 50084 transitions. [2018-09-14 18:08:58,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 18:08:58,377 INFO L276 IsEmpty]: Start isEmpty. Operand 41370 states and 50084 transitions. [2018-09-14 18:08:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-09-14 18:08:58,404 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:08:58,405 INFO L376 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, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-14 18:08:58,405 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:08:58,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2022892287, now seen corresponding path program 1 times [2018-09-14 18:08:58,406 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:08:58,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:08:58,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:08:58,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:08:58,407 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:08:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:08:58,848 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-09-14 18:08:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-09-14 18:08:58,951 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-14 18:08:58,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-14 18:08:58,951 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-14 18:08:58,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-14 18:08:58,952 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-14 18:08:58,952 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 18:08:58,952 INFO L87 Difference]: Start difference. First operand 41370 states and 50084 transitions. Second operand 4 states. [2018-09-14 18:09:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:09:07,215 INFO L93 Difference]: Finished difference Result 136862 states and 168192 transitions. [2018-09-14 18:09:07,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-14 18:09:07,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 393 [2018-09-14 18:09:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:09:07,511 INFO L225 Difference]: With dead ends: 136862 [2018-09-14 18:09:07,512 INFO L226 Difference]: Without dead ends: 93746 [2018-09-14 18:09:07,648 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-14 18:09:07,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93746 states. [2018-09-14 18:09:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93746 to 92401. [2018-09-14 18:09:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92401 states. [2018-09-14 18:09:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92401 states to 92401 states and 107895 transitions. [2018-09-14 18:09:09,408 INFO L78 Accepts]: Start accepts. Automaton has 92401 states and 107895 transitions. Word has length 393 [2018-09-14 18:09:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-14 18:09:09,408 INFO L480 AbstractCegarLoop]: Abstraction has 92401 states and 107895 transitions. [2018-09-14 18:09:09,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-14 18:09:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 92401 states and 107895 transitions. [2018-09-14 18:09:09,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2018-09-14 18:09:09,647 INFO L368 BasicCegarLoop]: Found error trace [2018-09-14 18:09:09,648 INFO L376 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-14 18:09:09,648 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-14 18:09:09,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1695991093, now seen corresponding path program 1 times [2018-09-14 18:09:09,648 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-14 18:09:09,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:09:09,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:09:09,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-14 18:09:09,649 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-14 18:09:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:09:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 207 proven. 423 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-09-14 18:09:11,623 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 18:09:11,623 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-14 18:09:11,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:09:11,631 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 18:09:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:09:11,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 18:09:13,965 WARN L1001 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_21 Int)) (let ((.cse0 (mod v_prenex_21 299849))) (let ((.cse1 (+ .cse0 300))) (and (= 0 (mod (+ .cse0 4) 5)) (< .cse1 0) (<= c_~a28~0 (+ (div .cse1 5) 2558)) (< v_prenex_21 0) (not (= (mod .cse0 5) 0)) (not (= 0 .cse0)))))) (exists ((v_prenex_24 Int)) (let ((.cse2 (mod v_prenex_24 299849))) (let ((.cse3 (+ .cse2 300149))) (and (not (= 0 (mod (+ .cse2 4) 5))) (<= c_~a28~0 (+ (div .cse3 5) 2558)) (<= 0 (+ .cse2 300)) (= 0 .cse2) (< .cse3 0))))) (exists ((v_prenex_32 Int)) (let ((.cse4 (mod v_prenex_32 299849))) (let ((.cse5 (+ .cse4 300149))) (and (<= 0 v_prenex_32) (not (= (mod .cse4 5) 0)) (< (+ .cse4 300) 0) (<= 0 .cse5) (<= c_~a28~0 (+ (div .cse5 5) 2557)))))) (exists ((v_prenex_11 Int)) (let ((.cse6 (mod v_prenex_11 299849))) (and (<= c_~a28~0 (+ (div (+ .cse6 300) 5) 2557)) (= (mod .cse6 5) 0) (not (= 0 .cse6)) (= 0 (mod (+ .cse6 4) 5)) (< v_prenex_11 0)))) (exists ((v_prenex_29 Int)) (let ((.cse8 (mod v_prenex_29 299849))) (let ((.cse7 (+ .cse8 300))) (and (<= c_~a28~0 (+ (div .cse7 5) 2557)) (not (= 0 .cse8)) (< v_prenex_29 0) (<= 0 .cse7) (not (= 0 (mod (+ .cse8 4) 5))) (< (+ .cse8 300149) 0))))) (exists ((v_prenex_27 Int)) (let ((.cse9 (mod v_prenex_27 299849))) (let ((.cse10 (+ .cse9 300))) (and (= 0 (mod (+ .cse9 4) 5)) (< v_prenex_27 0) (not (= 0 .cse9)) (<= 0 .cse10) (<= c_~a28~0 (+ (div .cse10 5) 2557)))))) (exists ((v_prenex_23 Int)) (let ((.cse11 (mod v_prenex_23 299849))) (let ((.cse12 (+ .cse11 300149))) (and (not (= 0 (mod (+ .cse11 4) 5))) (= 0 .cse11) (= (mod .cse11 5) 0) (<= c_~a28~0 (+ (div .cse12 5) 2558)) (< .cse12 0))))) (exists ((v_prenex_15 Int)) (let ((.cse13 (mod v_prenex_15 299849))) (and (= 0 .cse13) (<= 0 (+ .cse13 300)) (<= c_~a28~0 (+ (div (+ .cse13 300149) 5) 2557)) (= 0 (mod (+ .cse13 4) 5))))) (exists ((v_prenex_34 Int)) (let ((.cse14 (mod v_prenex_34 299849))) (let ((.cse15 (+ .cse14 300149))) (and (<= 0 (+ .cse14 300)) (<= 0 v_prenex_34) (not (= 0 (mod (+ .cse14 4) 5))) (< .cse15 0) (<= c_~a28~0 (+ (div .cse15 5) 2558)))))) (exists ((v_prenex_22 Int)) (let ((.cse16 (mod v_prenex_22 299849))) (and (< v_prenex_22 0) (< (+ .cse16 300149) 0) (not (= 0 .cse16)) (<= c_~a28~0 (+ (div (+ .cse16 300) 5) 2557)) (not (= 0 (mod (+ .cse16 4) 5))) (= (mod .cse16 5) 0)))) (exists ((v_prenex_16 Int)) (let ((.cse17 (mod v_prenex_16 299849))) (and (<= 0 (+ .cse17 300)) (<= 0 v_prenex_16) (= 0 (mod (+ .cse17 4) 5)) (<= c_~a28~0 (+ (div (+ .cse17 300149) 5) 2557))))) (exists ((v_prenex_30 Int)) (let ((.cse18 (mod v_prenex_30 299849))) (let ((.cse19 (+ .cse18 300149))) (and (= 0 .cse18) (= (mod .cse18 5) 0) (<= c_~a28~0 (+ (div .cse19 5) 2557)) (<= 0 .cse19))))) (exists ((v_prenex_31 Int)) (let ((.cse21 (mod v_prenex_31 299849))) (let ((.cse20 (+ .cse21 300149))) (and (<= c_~a28~0 (+ (div .cse20 5) 2557)) (<= 0 v_prenex_31) (<= 0 .cse20) (= (mod .cse21 5) 0))))) (exists ((v_prenex_17 Int)) (let ((.cse22 (mod v_prenex_17 299849))) (let ((.cse23 (+ .cse22 300149))) (and (not (= 0 (mod (+ .cse22 4) 5))) (<= c_~a28~0 (+ (div .cse23 5) 2558)) (< .cse23 0) (not (= (mod .cse22 5) 0)) (< (+ .cse22 300) 0) (= 0 .cse22))))) (exists ((v_prenex_20 Int)) (let ((.cse25 (mod v_prenex_20 299849))) (let ((.cse24 (+ .cse25 300))) (and (< v_prenex_20 0) (<= c_~a28~0 (+ (div .cse24 5) 2557)) (not (= 0 .cse25)) (<= 0 .cse24) (<= 0 (+ .cse25 300149)))))) (exists ((v_prenex_12 Int)) (let ((.cse27 (mod v_prenex_12 299849))) (let ((.cse26 (+ .cse27 300149))) (and (<= 0 v_prenex_12) (< .cse26 0) (= (mod .cse27 5) 0) (not (= 0 (mod (+ .cse27 4) 5))) (<= c_~a28~0 (+ (div .cse26 5) 2558)))))) (exists ((v_prenex_33 Int)) (let ((.cse28 (mod v_prenex_33 299849))) (and (<= 0 (+ .cse28 300149)) (<= c_~a28~0 (+ (div (+ .cse28 300) 5) 2557)) (< v_prenex_33 0) (= (mod .cse28 5) 0) (not (= 0 .cse28))))) (exists ((v_prenex_14 Int)) (let ((.cse30 (mod v_prenex_14 299849))) (let ((.cse29 (+ .cse30 300))) (and (< .cse29 0) (< v_prenex_14 0) (not (= 0 .cse30)) (<= 0 (+ .cse30 300149)) (<= c_~a28~0 (+ (div .cse29 5) 2558)) (not (= (mod .cse30 5) 0)))))) (exists ((v_prenex_26 Int)) (let ((.cse31 (mod v_prenex_26 299849))) (and (= 0 .cse31) (= (mod .cse31 5) 0) (= 0 (mod (+ .cse31 4) 5)) (<= c_~a28~0 (+ (div (+ .cse31 300149) 5) 2557))))) (exists ((v_prenex_25 Int)) (let ((.cse32 (mod v_prenex_25 299849))) (and (<= 0 v_prenex_25) (= 0 (mod (+ .cse32 4) 5)) (= (mod .cse32 5) 0) (<= c_~a28~0 (+ (div (+ .cse32 300149) 5) 2557))))) (exists ((v_prenex_13 Int)) (let ((.cse33 (mod v_prenex_13 299849))) (and (not (= (mod .cse33 5) 0)) (<= c_~a28~0 (+ (div (+ .cse33 300149) 5) 2557)) (= 0 .cse33) (= 0 (mod (+ .cse33 4) 5)) (< (+ .cse33 300) 0)))) (exists ((v_prenex_10 Int)) (let ((.cse34 (mod v_prenex_10 299849))) (and (<= 0 v_prenex_10) (= 0 (mod (+ .cse34 4) 5)) (< (+ .cse34 300) 0) (not (= (mod .cse34 5) 0)) (<= c_~a28~0 (+ (div (+ .cse34 300149) 5) 2557))))) (exists ((v_prenex_9 Int)) (let ((.cse35 (mod v_prenex_9 299849))) (let ((.cse36 (+ .cse35 300149))) (and (not (= (mod .cse35 5) 0)) (<= c_~a28~0 (+ (div .cse36 5) 2557)) (<= 0 .cse36) (= 0 .cse35) (< (+ .cse35 300) 0))))) (exists ((v_prenex_19 Int)) (let ((.cse38 (mod v_prenex_19 299849))) (let ((.cse37 (+ .cse38 300))) (and (< .cse37 0) (< v_prenex_19 0) (not (= (mod .cse38 5) 0)) (<= c_~a28~0 (+ (div .cse37 5) 2558)) (< (+ .cse38 300149) 0) (not (= 0 (mod (+ .cse38 4) 5))) (not (= 0 .cse38)))))) (exists ((v_prenex_28 Int)) (let ((.cse39 (mod v_prenex_28 299849))) (let ((.cse40 (+ .cse39 300149))) (and (<= 0 (+ .cse39 300)) (= 0 .cse39) (<= c_~a28~0 (+ (div .cse40 5) 2557)) (<= 0 .cse40))))) (exists ((v_~a28~0_1364 Int)) (let ((.cse42 (mod v_~a28~0_1364 299849))) (let ((.cse41 (+ .cse42 300149))) (and (<= 0 v_~a28~0_1364) (<= c_~a28~0 (+ (div .cse41 5) 2557)) (<= 0 .cse41) (<= 0 (+ .cse42 300)))))) (exists ((v_prenex_18 Int)) (let ((.cse43 (mod v_prenex_18 299849))) (let ((.cse44 (+ .cse43 300149))) (and (<= 0 v_prenex_18) (not (= (mod .cse43 5) 0)) (< (+ .cse43 300) 0) (<= c_~a28~0 (+ (div .cse44 5) 2558)) (< .cse44 0) (not (= 0 (mod (+ .cse43 4) 5)))))))) is different from true [2018-09-14 18:09:16,705 WARN L178 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 408 DAG size of output: 19 [2018-09-14 18:09:19,178 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 576 proven. 46 refuted. 0 times theorem prover too weak. 256 trivial. 7 not checked. [2018-09-14 18:09:19,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 18:09:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 627 proven. 2 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-09-14 18:09:20,402 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-14 18:09:20,402 INFO L197 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-09-14 18:09:20,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-14 18:09:20,429 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-14 18:09:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-14 18:09:20,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-14 18:09:21,259 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 22 [2018-09-14 18:09:21,956 WARN L1001 $PredicateComparison]: unable to prove that (or (exists ((|v_old(~a28~0)_AFTER_CALL_29| Int)) (let ((.cse0 (mod |v_old(~a28~0)_AFTER_CALL_29| 299849))) (and (= .cse0 0) (<= c_~a28~0 (+ (div (+ .cse0 300149) 5) 2557))))) (exists ((v_prenex_61 Int)) (and (<= c_~a28~0 (+ (div (+ (mod v_prenex_61 299849) 300149) 5) 2557)) (<= 0 v_prenex_61))) (exists ((v_prenex_62 Int)) (<= c_~a28~0 (+ (div (+ (mod v_prenex_62 299849) 300) 5) 2557)))) is different from true [2018-09-14 18:09:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 576 proven. 46 refuted. 0 times theorem prover too weak. 256 trivial. 7 not checked. [2018-09-14 18:09:22,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-14 18:09:23,257 WARN L178 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-09-14 18:09:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 627 proven. 2 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-09-14 18:09:23,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-14 18:09:23,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6, 8, 6] total 22 [2018-09-14 18:09:23,806 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-14 18:09:23,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-14 18:09:23,808 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-14 18:09:23,808 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=311, Unknown=2, NotChecked=74, Total=462 [2018-09-14 18:09:23,808 INFO L87 Difference]: Start difference. First operand 92401 states and 107895 transitions. Second operand 15 states. [2018-09-14 18:10:32,207 WARN L178 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 437 DAG size of output: 50 [2018-09-14 18:10:33,080 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 449 DAG size of output: 62 [2018-09-14 18:10:48,057 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 440 DAG size of output: 53 [2018-09-14 18:10:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-14 18:10:56,558 INFO L93 Difference]: Finished difference Result 247390 states and 291341 transitions. [2018-09-14 18:10:56,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-14 18:10:56,558 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 891 [2018-09-14 18:10:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-14 18:10:57,276 INFO L225 Difference]: With dead ends: 247390 [2018-09-14 18:10:57,276 INFO L226 Difference]: Without dead ends: 153614 [2018-09-14 18:10:57,535 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3639 GetRequests, 3579 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=570, Invalid=2295, Unknown=5, NotChecked=210, Total=3080 [2018-09-14 18:10:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153614 states. Received shutdown request... [2018-09-14 18:11:00,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153614 to 129717. [2018-09-14 18:11:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129717 states. [2018-09-14 18:11:00,522 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-14 18:11:00,530 WARN L206 ceAbstractionStarter]: Timeout [2018-09-14 18:11:00,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.09 06:11:00 BoogieIcfgContainer [2018-09-14 18:11:00,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-14 18:11:00,532 INFO L168 Benchmark]: Toolchain (without parser) took 242569.50 ms. Allocated memory was 1.5 GB in the beginning and 4.1 GB in the end (delta: 2.5 GB). Free memory was 1.4 GB in the beginning and 3.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.9 GB. Max. memory is 7.1 GB. [2018-09-14 18:11:00,533 INFO L168 Benchmark]: CDTParser took 0.19 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-09-14 18:11:00,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1750.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. [2018-09-14 18:11:00,535 INFO L168 Benchmark]: Boogie Procedure Inliner took 304.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-09-14 18:11:00,537 INFO L168 Benchmark]: Boogie Preprocessor took 869.17 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 932.7 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 123.5 MB. Max. memory is 7.1 GB. [2018-09-14 18:11:00,538 INFO L168 Benchmark]: RCFGBuilder took 11472.72 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.9 GB in the end (delta: 446.9 MB). Peak memory consumption was 446.9 MB. Max. memory is 7.1 GB. [2018-09-14 18:11:00,539 INFO L168 Benchmark]: TraceAbstraction took 228164.94 ms. Allocated memory was 2.5 GB in the beginning and 4.1 GB in the end (delta: 1.6 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-09-14 18:11:00,547 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.19 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 1750.82 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.2 GB in the end (delta: 179.7 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 304.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 869.17 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 932.7 MB). Free memory was 1.2 GB in the beginning and 2.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 123.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 11472.72 ms. Allocated memory is still 2.5 GB. Free memory was 2.3 GB in the beginning and 1.9 GB in the end (delta: 446.9 MB). Peak memory consumption was 446.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 228164.94 ms. Allocated memory was 2.5 GB in the beginning and 4.1 GB in the end (delta: 1.6 GB). Free memory was 1.9 GB in the beginning and 3.1 GB in the end (delta: -1.2 GB). 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: 158]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 158). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 604 locations, 1 error locations. TIMEOUT Result, 228.0s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 194.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5569 SDtfs, 22312 SDslu, 4277 SDs, 0 SdLazy, 63104 SolverSat, 8371 SolverUnsat, 22 SolverUnknown, 0 SolverNotchecked, 157.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5391 GetRequests, 5264 SyntacticMatches, 15 SemanticMatches, 112 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 26.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92401occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 7.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 8923 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 22.7s InterpolantComputationTime, 5763 NumberOfCodeBlocks, 5763 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 8360 ConstructedInterpolants, 307 QuantifiedInterpolants, 28704184 SizeOfPredicates, 14 NumberOfNonLiveVariables, 3868 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 21 InterpolantComputations, 9 PerfectInterpolantSequences, 7133/8378 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem17_label45_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-14_18-11-00-573.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Problem17_label45_true-unreach-call.c_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-14_18-11-00-573.csv Completed graceful shutdown