java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-newlib/float_req_bl_1231_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2c62905 [2018-09-19 16:35:30,658 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-19 16:35:30,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-19 16:35:30,679 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-19 16:35:30,680 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-19 16:35:30,681 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-19 16:35:30,683 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-19 16:35:30,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-19 16:35:30,689 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-19 16:35:30,690 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-19 16:35:30,691 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-19 16:35:30,691 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-19 16:35:30,692 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-19 16:35:30,693 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-19 16:35:30,695 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-19 16:35:30,695 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-19 16:35:30,696 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-19 16:35:30,698 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-19 16:35:30,701 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-19 16:35:30,706 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-19 16:35:30,710 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-19 16:35:30,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-19 16:35:30,716 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-19 16:35:30,717 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-19 16:35:30,717 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-19 16:35:30,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-19 16:35:30,723 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-19 16:35:30,724 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-19 16:35:30,725 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-19 16:35:30,728 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-19 16:35:30,729 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-19 16:35:30,730 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-19 16:35:30,730 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-19 16:35:30,730 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-19 16:35:30,732 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-19 16:35:30,734 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-19 16:35:30,734 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-09-19 16:35:30,767 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-19 16:35:30,767 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-19 16:35:30,768 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-19 16:35:30,771 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-19 16:35:30,773 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-19 16:35:30,773 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-19 16:35:30,773 INFO L133 SettingsManager]: * Use SBE=true [2018-09-19 16:35:30,775 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-19 16:35:30,775 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-19 16:35:30,775 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-19 16:35:30,775 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-19 16:35:30,776 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-19 16:35:30,776 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-19 16:35:30,776 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-19 16:35:30,776 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-09-19 16:35:30,776 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-09-19 16:35:30,777 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-19 16:35:30,777 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-19 16:35:30,777 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-19 16:35:30,777 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-19 16:35:30,778 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-19 16:35:30,778 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-19 16:35:30,778 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-19 16:35:30,778 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-19 16:35:30,780 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-19 16:35:30,780 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-19 16:35:30,780 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-19 16:35:30,780 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-09-19 16:35:30,781 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-19 16:35:30,781 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-09-19 16:35:30,781 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-09-19 16:35:30,781 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-19 16:35:30,850 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-19 16:35:30,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-19 16:35:30,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-19 16:35:30,875 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-19 16:35:30,875 INFO L276 PluginConnector]: CDTParser initialized [2018-09-19 16:35:30,876 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-09-19 16:35:31,235 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb1ff6a7/cd2c79e33e0d4bad8fd5f3e60001f90b/FLAG99e2c4eb4 [2018-09-19 16:35:31,407 INFO L277 CDTParser]: Found 1 translation units. [2018-09-19 16:35:31,408 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-09-19 16:35:31,416 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb1ff6a7/cd2c79e33e0d4bad8fd5f3e60001f90b/FLAG99e2c4eb4 [2018-09-19 16:35:31,431 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb1ff6a7/cd2c79e33e0d4bad8fd5f3e60001f90b [2018-09-19 16:35:31,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-19 16:35:31,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-19 16:35:31,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-19 16:35:31,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-19 16:35:31,452 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-19 16:35:31,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:35:31" (1/1) ... [2018-09-19 16:35:31,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e7eb30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:35:31, skipping insertion in model container [2018-09-19 16:35:31,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.09 04:35:31" (1/1) ... [2018-09-19 16:35:31,470 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-19 16:35:31,751 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:35:31,777 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-19 16:35:31,813 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-19 16:35:31,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:35:31 WrapperNode [2018-09-19 16:35:31,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-19 16:35:31,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-19 16:35:31,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-19 16:35:31,879 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-19 16:35:31,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:35:31" (1/1) ... [2018-09-19 16:35:31,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:35:31" (1/1) ... [2018-09-19 16:35:31,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:35:31" (1/1) ... [2018-09-19 16:35:31,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:35:31" (1/1) ... [2018-09-19 16:35:31,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:35:31" (1/1) ... [2018-09-19 16:35:31,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:35:31" (1/1) ... [2018-09-19 16:35:31,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:35:31" (1/1) ... [2018-09-19 16:35:31,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-19 16:35:31,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-19 16:35:31,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-19 16:35:31,969 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-19 16:35:31,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:35:31" (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-19 16:35:32,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-19 16:35:32,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-19 16:35:32,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-09-19 16:35:32,119 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2018-09-19 16:35:32,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-09-19 16:35:32,119 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-09-19 16:35:32,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-19 16:35:32,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-09-19 16:35:32,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-09-19 16:35:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-09-19 16:35:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-09-19 16:35:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-09-19 16:35:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-09-19 16:35:32,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-09-19 16:35:32,123 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2018-09-19 16:35:32,123 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-09-19 16:35:32,123 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-09-19 16:35:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-19 16:35:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-19 16:35:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-19 16:35:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-09-19 16:35:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-09-19 16:35:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4 [2018-09-19 16:35:32,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-09-19 16:35:32,690 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:35:32,699 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:35:32,789 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:35:32,817 WARN L312 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-09-19 16:35:32,847 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-19 16:35:32,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:35:32 BoogieIcfgContainer [2018-09-19 16:35:32,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-19 16:35:32,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-19 16:35:32,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-19 16:35:32,852 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-19 16:35:32,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.09 04:35:31" (1/3) ... [2018-09-19 16:35:32,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7246fadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:35:32, skipping insertion in model container [2018-09-19 16:35:32,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.09 04:35:31" (2/3) ... [2018-09-19 16:35:32,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7246fadb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.09 04:35:32, skipping insertion in model container [2018-09-19 16:35:32,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.09 04:35:32" (3/3) ... [2018-09-19 16:35:32,857 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231_true-unreach-call.c [2018-09-19 16:35:32,868 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-19 16:35:32,878 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-09-19 16:35:32,927 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-19 16:35:32,927 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-19 16:35:32,928 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-19 16:35:32,928 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-19 16:35:32,928 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-19 16:35:32,928 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-19 16:35:32,928 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-19 16:35:32,929 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-19 16:35:32,929 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-19 16:35:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-09-19 16:35:32,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-19 16:35:32,961 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:32,963 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:35:32,965 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash -578541119, now seen corresponding path program 1 times [2018-09-19 16:35:32,977 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:32,978 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:32,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:33,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:35:33,106 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:35:33,126 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:35:33,126 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-19 16:35:33,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-19 16:35:33,148 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-19 16:35:33,149 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:35:33,152 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 2 states. [2018-09-19 16:35:33,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:33,187 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2018-09-19 16:35:33,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-19 16:35:33,189 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2018-09-19 16:35:33,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:33,202 INFO L225 Difference]: With dead ends: 121 [2018-09-19 16:35:33,203 INFO L226 Difference]: Without dead ends: 67 [2018-09-19 16:35:33,207 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-19 16:35:33,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-19 16:35:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-19 16:35:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-19 16:35:33,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2018-09-19 16:35:33,268 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 35 [2018-09-19 16:35:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:33,270 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2018-09-19 16:35:33,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-19 16:35:33,271 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2018-09-19 16:35:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-19 16:35:33,274 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:33,274 INFO L376 BasicCegarLoop]: trace histogram [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] [2018-09-19 16:35:33,275 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:33,275 INFO L82 PathProgramCache]: Analyzing trace with hash -687584990, now seen corresponding path program 1 times [2018-09-19 16:35:33,276 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:33,276 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:33,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:33,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-19 16:35:33,410 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:35:33,424 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:35:33,424 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:35:33,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:35:33,426 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:35:33,427 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:33,427 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand 4 states. [2018-09-19 16:35:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:33,760 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2018-09-19 16:35:33,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-19 16:35:33,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-09-19 16:35:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:33,764 INFO L225 Difference]: With dead ends: 124 [2018-09-19 16:35:33,764 INFO L226 Difference]: Without dead ends: 76 [2018-09-19 16:35:33,766 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-19 16:35:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-19 16:35:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-09-19 16:35:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-19 16:35:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2018-09-19 16:35:33,782 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 44 [2018-09-19 16:35:33,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:33,786 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2018-09-19 16:35:33,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:35:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2018-09-19 16:35:33,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-19 16:35:33,789 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:33,790 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 16:35:33,790 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:33,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1505699155, now seen corresponding path program 1 times [2018-09-19 16:35:33,792 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:33,792 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:35:33,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:33,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-19 16:35:33,916 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:35:33,931 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:35:33,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:35:33,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:35:33,935 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:35:33,935 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:33,935 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand 4 states. [2018-09-19 16:35:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:34,069 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2018-09-19 16:35:34,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:35:34,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-09-19 16:35:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:34,078 INFO L225 Difference]: With dead ends: 94 [2018-09-19 16:35:34,078 INFO L226 Difference]: Without dead ends: 72 [2018-09-19 16:35:34,080 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-19 16:35:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-19 16:35:34,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-19 16:35:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-09-19 16:35:34,099 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 49 [2018-09-19 16:35:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:34,100 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-09-19 16:35:34,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:35:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-09-19 16:35:34,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-19 16:35:34,110 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:34,110 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 16:35:34,113 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:34,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1992239203, now seen corresponding path program 1 times [2018-09-19 16:35:34,114 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:34,114 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:34,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:34,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-19 16:35:34,237 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:35:34,252 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:35:34,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:35:34,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:35:34,253 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:35:34,253 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:34,253 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 4 states. [2018-09-19 16:35:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:34,300 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2018-09-19 16:35:34,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:35:34,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-09-19 16:35:34,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:34,303 INFO L225 Difference]: With dead ends: 97 [2018-09-19 16:35:34,303 INFO L226 Difference]: Without dead ends: 75 [2018-09-19 16:35:34,304 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:34,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-19 16:35:34,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-09-19 16:35:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-19 16:35:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-09-19 16:35:34,314 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 50 [2018-09-19 16:35:34,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:34,315 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-09-19 16:35:34,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:35:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-09-19 16:35:34,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-19 16:35:34,317 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:34,317 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 16:35:34,318 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:34,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1840128433, now seen corresponding path program 1 times [2018-09-19 16:35:34,319 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:34,319 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:34,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:34,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:34,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-19 16:35:34,410 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:35:34,426 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:35:34,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:35:34,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:35:34,428 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:35:34,428 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:34,428 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 4 states. [2018-09-19 16:35:34,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:34,541 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2018-09-19 16:35:34,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:35:34,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-09-19 16:35:34,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:34,548 INFO L225 Difference]: With dead ends: 97 [2018-09-19 16:35:34,548 INFO L226 Difference]: Without dead ends: 75 [2018-09-19 16:35:34,551 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:34,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-19 16:35:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-09-19 16:35:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-19 16:35:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-09-19 16:35:34,576 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2018-09-19 16:35:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:34,577 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-09-19 16:35:34,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:35:34,577 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-09-19 16:35:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-19 16:35:34,581 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:34,581 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 16:35:34,582 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:34,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2119680801, now seen corresponding path program 1 times [2018-09-19 16:35:34,583 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:34,583 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:34,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:34,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-19 16:35:34,794 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:35:34,808 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:35:34,809 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:35:34,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:35:34,811 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:35:34,812 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:34,812 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 4 states. [2018-09-19 16:35:34,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:34,950 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2018-09-19 16:35:34,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:35:34,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-09-19 16:35:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:34,954 INFO L225 Difference]: With dead ends: 97 [2018-09-19 16:35:34,954 INFO L226 Difference]: Without dead ends: 75 [2018-09-19 16:35:34,957 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:34,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-19 16:35:34,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-09-19 16:35:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-19 16:35:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-09-19 16:35:34,977 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 52 [2018-09-19 16:35:34,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:34,978 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-09-19 16:35:34,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:35:34,978 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-09-19 16:35:34,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-19 16:35:34,979 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:34,980 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 16:35:34,980 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:34,980 INFO L82 PathProgramCache]: Analyzing trace with hash -667734686, now seen corresponding path program 1 times [2018-09-19 16:35:34,981 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:34,981 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:35:34,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:35,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:35,289 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-19 16:35:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-19 16:35:35,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:35:35,800 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-19 16:35:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-19 16:35:36,196 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:35:36,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-09-19 16:35:36,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 16:35:36,197 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 16:35:36,197 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-09-19 16:35:36,198 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 13 states. [2018-09-19 16:35:37,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:37,221 INFO L93 Difference]: Finished difference Result 112 states and 142 transitions. [2018-09-19 16:35:37,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:35:37,221 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-09-19 16:35:37,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:37,223 INFO L225 Difference]: With dead ends: 112 [2018-09-19 16:35:37,223 INFO L226 Difference]: Without dead ends: 98 [2018-09-19 16:35:37,225 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-09-19 16:35:37,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-19 16:35:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2018-09-19 16:35:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-19 16:35:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 109 transitions. [2018-09-19 16:35:37,237 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 109 transitions. Word has length 52 [2018-09-19 16:35:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:37,238 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 109 transitions. [2018-09-19 16:35:37,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 16:35:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 109 transitions. [2018-09-19 16:35:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-19 16:35:37,239 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:37,240 INFO L376 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 16:35:37,240 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:37,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1808229183, now seen corresponding path program 1 times [2018-09-19 16:35:37,241 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:37,241 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:37,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:37,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:37,489 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-19 16:35:37,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-09-19 16:35:37,602 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:35:37,619 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:35:37,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-09-19 16:35:37,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:35:37,620 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:35:37,620 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-19 16:35:37,620 INFO L87 Difference]: Start difference. First operand 84 states and 109 transitions. Second operand 8 states. [2018-09-19 16:35:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:38,256 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2018-09-19 16:35:38,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-19 16:35:38,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-09-19 16:35:38,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:38,259 INFO L225 Difference]: With dead ends: 149 [2018-09-19 16:35:38,259 INFO L226 Difference]: Without dead ends: 97 [2018-09-19 16:35:38,261 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-09-19 16:35:38,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-19 16:35:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2018-09-19 16:35:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-19 16:35:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 108 transitions. [2018-09-19 16:35:38,274 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 108 transitions. Word has length 54 [2018-09-19 16:35:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:38,274 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 108 transitions. [2018-09-19 16:35:38,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:35:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2018-09-19 16:35:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-19 16:35:38,276 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:38,276 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 16:35:38,277 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1711558660, now seen corresponding path program 1 times [2018-09-19 16:35:38,277 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:38,277 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:38,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:38,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:35:38,364 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:35:38,375 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:35:38,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-19 16:35:38,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-19 16:35:38,376 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-19 16:35:38,376 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 16:35:38,377 INFO L87 Difference]: Start difference. First operand 84 states and 108 transitions. Second operand 3 states. [2018-09-19 16:35:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:38,423 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2018-09-19 16:35:38,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-19 16:35:38,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-09-19 16:35:38,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:38,425 INFO L225 Difference]: With dead ends: 87 [2018-09-19 16:35:38,425 INFO L226 Difference]: Without dead ends: 85 [2018-09-19 16:35:38,426 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-19 16:35:38,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-19 16:35:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-19 16:35:38,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-19 16:35:38,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2018-09-19 16:35:38,439 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 59 [2018-09-19 16:35:38,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:38,440 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2018-09-19 16:35:38,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-19 16:35:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2018-09-19 16:35:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-19 16:35:38,441 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:38,442 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 16:35:38,442 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:38,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1665853812, now seen corresponding path program 1 times [2018-09-19 16:35:38,443 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:38,443 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:35:38,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:38,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-19 16:35:38,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:35:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-19 16:35:39,486 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:35:39,487 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-09-19 16:35:39,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-19 16:35:39,488 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-19 16:35:39,488 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-09-19 16:35:39,489 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand 19 states. [2018-09-19 16:35:39,918 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-09-19 16:35:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:41,056 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2018-09-19 16:35:41,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 16:35:41,057 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2018-09-19 16:35:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:41,059 INFO L225 Difference]: With dead ends: 124 [2018-09-19 16:35:41,059 INFO L226 Difference]: Without dead ends: 122 [2018-09-19 16:35:41,060 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-09-19 16:35:41,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-19 16:35:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 95. [2018-09-19 16:35:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-19 16:35:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2018-09-19 16:35:41,076 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 57 [2018-09-19 16:35:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:41,076 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2018-09-19 16:35:41,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-19 16:35:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2018-09-19 16:35:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-19 16:35:41,078 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:41,078 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 16:35:41,079 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:41,079 INFO L82 PathProgramCache]: Analyzing trace with hash 582633770, now seen corresponding path program 1 times [2018-09-19 16:35:41,079 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:41,080 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:41,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:41,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-09-19 16:35:41,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:35:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-19 16:35:41,764 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:35:41,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-09-19 16:35:41,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 16:35:41,765 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 16:35:41,765 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:35:41,765 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand 12 states. [2018-09-19 16:35:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:42,384 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2018-09-19 16:35:42,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-19 16:35:42,387 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2018-09-19 16:35:42,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:42,388 INFO L225 Difference]: With dead ends: 121 [2018-09-19 16:35:42,388 INFO L226 Difference]: Without dead ends: 105 [2018-09-19 16:35:42,389 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-09-19 16:35:42,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-19 16:35:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2018-09-19 16:35:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-19 16:35:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2018-09-19 16:35:42,401 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 64 [2018-09-19 16:35:42,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:42,402 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2018-09-19 16:35:42,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 16:35:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2018-09-19 16:35:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-19 16:35:42,404 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:42,404 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 16:35:42,404 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:42,405 INFO L82 PathProgramCache]: Analyzing trace with hash 301740450, now seen corresponding path program 1 times [2018-09-19 16:35:42,405 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:42,405 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:42,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:42,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-19 16:35:42,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:35:43,186 WARN L178 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-09-19 16:35:43,495 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-19 16:35:43,511 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:35:43,511 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2018-09-19 16:35:43,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 16:35:43,512 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 16:35:43,512 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-09-19 16:35:43,512 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand 14 states. [2018-09-19 16:35:44,376 WARN L178 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-09-19 16:35:45,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:45,403 INFO L93 Difference]: Finished difference Result 158 states and 198 transitions. [2018-09-19 16:35:45,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-19 16:35:45,403 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2018-09-19 16:35:45,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:45,404 INFO L225 Difference]: With dead ends: 158 [2018-09-19 16:35:45,404 INFO L226 Difference]: Without dead ends: 97 [2018-09-19 16:35:45,405 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:35:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-19 16:35:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2018-09-19 16:35:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-19 16:35:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2018-09-19 16:35:45,419 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 64 [2018-09-19 16:35:45,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:45,420 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2018-09-19 16:35:45,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 16:35:45,420 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2018-09-19 16:35:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-19 16:35:45,421 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:45,422 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 16:35:45,422 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:45,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1385854870, now seen corresponding path program 1 times [2018-09-19 16:35:45,423 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:45,423 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:45,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:45,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:35:45,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:35:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-19 16:35:45,981 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:35:45,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-09-19 16:35:45,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-19 16:35:45,983 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-19 16:35:45,983 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:35:45,983 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand 12 states. [2018-09-19 16:35:46,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:46,437 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2018-09-19 16:35:46,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 16:35:46,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-09-19 16:35:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:46,441 INFO L225 Difference]: With dead ends: 100 [2018-09-19 16:35:46,441 INFO L226 Difference]: Without dead ends: 97 [2018-09-19 16:35:46,442 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-09-19 16:35:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-19 16:35:46,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2018-09-19 16:35:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-19 16:35:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 114 transitions. [2018-09-19 16:35:46,451 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 114 transitions. Word has length 66 [2018-09-19 16:35:46,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:46,451 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 114 transitions. [2018-09-19 16:35:46,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-19 16:35:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2018-09-19 16:35:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-19 16:35:46,453 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:46,453 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 16:35:46,454 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:46,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1812870296, now seen corresponding path program 1 times [2018-09-19 16:35:46,454 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:46,454 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:46,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:46,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:46,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:35:46,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-19 16:35:46,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:35:46,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:35:46,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:35:46,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:35:46,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-19 16:35:46,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-19 16:35:46,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:35:46,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:35:46,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:35:46,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:35:47,156 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2018-09-19 16:35:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-19 16:35:47,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:35:47,821 WARN L178 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-09-19 16:35:48,322 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:35:48,674 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-09-19 16:35:49,133 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-19 16:35:49,133 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-19 16:35:49,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:49,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:49,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:35:49,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-19 16:35:49,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:35:49,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:35:49,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:35:49,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:35:49,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-19 16:35:49,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-19 16:35:49,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:35:49,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:35:49,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:35:49,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:35:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-19 16:35:49,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:35:49,890 WARN L178 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-09-19 16:35:50,102 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:35:50,575 WARN L178 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-09-19 16:35:50,746 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:35:50,954 WARN L178 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:35:51,313 WARN L178 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-09-19 16:35:51,592 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-09-19 16:35:51,745 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:35:51,745 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 19 [2018-09-19 16:35:51,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-19 16:35:51,746 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-19 16:35:51,746 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2018-09-19 16:35:51,747 INFO L87 Difference]: Start difference. First operand 91 states and 114 transitions. Second operand 19 states. [2018-09-19 16:35:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:54,805 INFO L93 Difference]: Finished difference Result 139 states and 179 transitions. [2018-09-19 16:35:54,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-19 16:35:54,806 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 71 [2018-09-19 16:35:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:54,808 INFO L225 Difference]: With dead ends: 139 [2018-09-19 16:35:54,809 INFO L226 Difference]: Without dead ends: 108 [2018-09-19 16:35:54,810 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 170 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2018-09-19 16:35:54,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-19 16:35:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2018-09-19 16:35:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-19 16:35:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 122 transitions. [2018-09-19 16:35:54,820 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 122 transitions. Word has length 71 [2018-09-19 16:35:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:54,821 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 122 transitions. [2018-09-19 16:35:54,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-19 16:35:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions. [2018-09-19 16:35:54,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-19 16:35:54,822 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:54,822 INFO L376 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 16:35:54,823 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:54,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1908488178, now seen corresponding path program 1 times [2018-09-19 16:35:54,823 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:54,823 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:54,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:54,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:35:55,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:35:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-09-19 16:35:55,449 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:35:55,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2018-09-19 16:35:55,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 16:35:55,450 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 16:35:55,451 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-09-19 16:35:55,451 INFO L87 Difference]: Start difference. First operand 97 states and 122 transitions. Second operand 13 states. [2018-09-19 16:35:55,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:55,901 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2018-09-19 16:35:55,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-19 16:35:55,901 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2018-09-19 16:35:55,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:55,903 INFO L225 Difference]: With dead ends: 107 [2018-09-19 16:35:55,904 INFO L226 Difference]: Without dead ends: 86 [2018-09-19 16:35:55,905 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-09-19 16:35:55,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-19 16:35:55,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-19 16:35:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-19 16:35:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2018-09-19 16:35:55,915 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 64 [2018-09-19 16:35:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:55,915 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2018-09-19 16:35:55,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 16:35:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2018-09-19 16:35:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-19 16:35:55,917 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:55,917 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-09-19 16:35:55,917 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:55,918 INFO L82 PathProgramCache]: Analyzing trace with hash -991804753, now seen corresponding path program 1 times [2018-09-19 16:35:55,918 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:55,918 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:55,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:56,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:35:56,065 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:35:56,077 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:35:56,077 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:35:56,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:35:56,078 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:35:56,078 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:56,078 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 4 states. [2018-09-19 16:35:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:56,157 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2018-09-19 16:35:56,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:35:56,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-09-19 16:35:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:56,159 INFO L225 Difference]: With dead ends: 118 [2018-09-19 16:35:56,159 INFO L226 Difference]: Without dead ends: 89 [2018-09-19 16:35:56,160 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-19 16:35:56,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-19 16:35:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-19 16:35:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2018-09-19 16:35:56,172 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 70 [2018-09-19 16:35:56,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:56,173 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2018-09-19 16:35:56,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:35:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2018-09-19 16:35:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-19 16:35:56,174 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:56,174 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 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-19 16:35:56,177 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash 709072009, now seen corresponding path program 1 times [2018-09-19 16:35:56,178 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:56,178 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:56,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:56,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:35:56,274 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:35:56,285 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:35:56,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:35:56,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:35:56,287 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:35:56,287 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:56,287 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand 4 states. [2018-09-19 16:35:56,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:56,322 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2018-09-19 16:35:56,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:35:56,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2018-09-19 16:35:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:56,323 INFO L225 Difference]: With dead ends: 122 [2018-09-19 16:35:56,323 INFO L226 Difference]: Without dead ends: 93 [2018-09-19 16:35:56,324 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-19 16:35:56,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-09-19 16:35:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-19 16:35:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2018-09-19 16:35:56,334 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 71 [2018-09-19 16:35:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:56,335 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2018-09-19 16:35:56,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:35:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2018-09-19 16:35:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-19 16:35:56,336 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:56,336 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-09-19 16:35:56,337 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:56,337 INFO L82 PathProgramCache]: Analyzing trace with hash 261347179, now seen corresponding path program 1 times [2018-09-19 16:35:56,337 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:56,338 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:56,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:56,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:35:56,441 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:35:56,451 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:35:56,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:35:56,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:35:56,451 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:35:56,452 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:56,452 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand 4 states. [2018-09-19 16:35:56,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:56,487 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2018-09-19 16:35:56,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:35:56,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-09-19 16:35:56,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:56,490 INFO L225 Difference]: With dead ends: 122 [2018-09-19 16:35:56,490 INFO L226 Difference]: Without dead ends: 93 [2018-09-19 16:35:56,491 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:35:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-19 16:35:56,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2018-09-19 16:35:56,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-19 16:35:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2018-09-19 16:35:56,499 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 72 [2018-09-19 16:35:56,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:56,500 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2018-09-19 16:35:56,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:35:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2018-09-19 16:35:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-19 16:35:56,501 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:56,501 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-09-19 16:35:56,502 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:56,502 INFO L82 PathProgramCache]: Analyzing trace with hash -2067103916, now seen corresponding path program 1 times [2018-09-19 16:35:56,502 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:56,502 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:56,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:56,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:35:56,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:35:57,228 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-19 16:35:57,228 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-19 16:35:57,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:57,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:35:57,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:35:57,630 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:35:57,630 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-09-19 16:35:57,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-19 16:35:57,631 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-19 16:35:57,631 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:35:57,631 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand 8 states. [2018-09-19 16:35:58,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:35:58,432 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2018-09-19 16:35:58,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-19 16:35:58,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-09-19 16:35:58,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:35:58,434 INFO L225 Difference]: With dead ends: 104 [2018-09-19 16:35:58,434 INFO L226 Difference]: Without dead ends: 92 [2018-09-19 16:35:58,435 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-09-19 16:35:58,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-19 16:35:58,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-19 16:35:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-19 16:35:58,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 113 transitions. [2018-09-19 16:35:58,444 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 113 transitions. Word has length 72 [2018-09-19 16:35:58,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:35:58,444 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 113 transitions. [2018-09-19 16:35:58,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-19 16:35:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 113 transitions. [2018-09-19 16:35:58,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-19 16:35:58,445 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:35:58,446 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-09-19 16:35:58,446 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:35:58,446 INFO L82 PathProgramCache]: Analyzing trace with hash 233718674, now seen corresponding path program 1 times [2018-09-19 16:35:58,446 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:35:58,447 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2018-09-19 16:35:58,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:35:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:35:58,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:35:58,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:35:58,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-19 16:35:58,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:35:58,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:35:58,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:35:58,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:35:58,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-19 16:35:58,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-19 16:35:58,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:35:58,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:35:58,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:35:58,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:35:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-19 16:35:58,982 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:35:58,994 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:35:58,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-09-19 16:35:58,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-19 16:35:58,995 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-19 16:35:58,995 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-19 16:35:58,996 INFO L87 Difference]: Start difference. First operand 92 states and 113 transitions. Second operand 13 states. [2018-09-19 16:36:00,565 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-09-19 16:36:00,750 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-09-19 16:36:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:36:00,908 INFO L93 Difference]: Finished difference Result 129 states and 157 transitions. [2018-09-19 16:36:00,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-19 16:36:00,909 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-09-19 16:36:00,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:36:00,910 INFO L225 Difference]: With dead ends: 129 [2018-09-19 16:36:00,911 INFO L226 Difference]: Without dead ends: 115 [2018-09-19 16:36:00,911 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:36:00,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-19 16:36:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2018-09-19 16:36:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-19 16:36:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2018-09-19 16:36:00,921 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 72 [2018-09-19 16:36:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:36:00,921 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2018-09-19 16:36:00,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-19 16:36:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2018-09-19 16:36:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-19 16:36:00,922 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:36:00,923 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:36:00,923 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:36:00,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1606252820, now seen corresponding path program 1 times [2018-09-19 16:36:00,923 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:36:00,924 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:36:00,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2018-09-19 16:36:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:36:00,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:36:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-19 16:36:01,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:36:01,671 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-09-19 16:36:02,060 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-19 16:36:02,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:36:02,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-09-19 16:36:02,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-19 16:36:02,070 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-19 16:36:02,071 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:36:02,071 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand 21 states. [2018-09-19 16:36:03,131 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-09-19 16:36:03,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:36:03,544 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2018-09-19 16:36:03,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 16:36:03,548 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 73 [2018-09-19 16:36:03,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:36:03,549 INFO L225 Difference]: With dead ends: 113 [2018-09-19 16:36:03,549 INFO L226 Difference]: Without dead ends: 99 [2018-09-19 16:36:03,550 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-09-19 16:36:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-19 16:36:03,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-09-19 16:36:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-19 16:36:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2018-09-19 16:36:03,558 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 73 [2018-09-19 16:36:03,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:36:03,558 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2018-09-19 16:36:03,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-19 16:36:03,558 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2018-09-19 16:36:03,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-19 16:36:03,559 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:36:03,559 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:36:03,560 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:36:03,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1926449733, now seen corresponding path program 1 times [2018-09-19 16:36:03,560 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:36:03,560 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2018-09-19 16:36:03,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:36:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:36:03,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:36:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-09-19 16:36:03,658 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:36:03,667 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:36:03,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:36:03,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:36:03,668 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:36:03,668 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:36:03,668 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand 4 states. [2018-09-19 16:36:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:36:03,692 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2018-09-19 16:36:03,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:36:03,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-09-19 16:36:03,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:36:03,696 INFO L225 Difference]: With dead ends: 119 [2018-09-19 16:36:03,696 INFO L226 Difference]: Without dead ends: 89 [2018-09-19 16:36:03,697 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:36:03,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-19 16:36:03,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-09-19 16:36:03,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-19 16:36:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2018-09-19 16:36:03,704 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 73 [2018-09-19 16:36:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:36:03,705 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2018-09-19 16:36:03,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:36:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2018-09-19 16:36:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-19 16:36:03,706 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:36:03,706 INFO L376 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:36:03,706 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:36:03,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1517625508, now seen corresponding path program 1 times [2018-09-19 16:36:03,707 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:36:03,707 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2018-09-19 16:36:03,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:36:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:36:03,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:36:03,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:36:03,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-19 16:36:03,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:36:03,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:03,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:03,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:36:04,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-19 16:36:04,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-19 16:36:04,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:36:04,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:04,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:04,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:36:04,353 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2018-09-19 16:36:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-09-19 16:36:04,643 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:36:04,653 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:36:04,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-09-19 16:36:04,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-19 16:36:04,653 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-19 16:36:04,654 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:36:04,654 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 17 states. [2018-09-19 16:36:06,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:36:06,968 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2018-09-19 16:36:06,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-19 16:36:06,968 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-09-19 16:36:06,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:36:06,969 INFO L225 Difference]: With dead ends: 115 [2018-09-19 16:36:06,969 INFO L226 Difference]: Without dead ends: 76 [2018-09-19 16:36:06,970 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-09-19 16:36:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-19 16:36:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2018-09-19 16:36:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-19 16:36:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-09-19 16:36:06,976 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 73 [2018-09-19 16:36:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:36:06,976 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2018-09-19 16:36:06,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-19 16:36:06,977 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-09-19 16:36:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-19 16:36:06,977 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:36:06,977 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:36:06,978 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:36:06,978 INFO L82 PathProgramCache]: Analyzing trace with hash -921011684, now seen corresponding path program 1 times [2018-09-19 16:36:06,978 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:36:06,978 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2018-09-19 16:36:06,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:36:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:36:07,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:36:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-09-19 16:36:07,374 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:36:07,388 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:36:07,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-09-19 16:36:07,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-19 16:36:07,389 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-19 16:36:07,389 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-19 16:36:07,389 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 9 states. [2018-09-19 16:36:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:36:08,051 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-09-19 16:36:08,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-19 16:36:08,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-09-19 16:36:08,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:36:08,052 INFO L225 Difference]: With dead ends: 84 [2018-09-19 16:36:08,052 INFO L226 Difference]: Without dead ends: 65 [2018-09-19 16:36:08,052 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-09-19 16:36:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-19 16:36:08,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-09-19 16:36:08,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-19 16:36:08,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2018-09-19 16:36:08,058 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 86 [2018-09-19 16:36:08,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:36:08,058 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2018-09-19 16:36:08,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-19 16:36:08,059 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2018-09-19 16:36:08,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-19 16:36:08,059 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:36:08,060 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-19 16:36:08,060 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:36:08,060 INFO L82 PathProgramCache]: Analyzing trace with hash -780463074, now seen corresponding path program 1 times [2018-09-19 16:36:08,060 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:36:08,061 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2018-09-19 16:36:08,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:36:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:36:08,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:36:08,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:36:08,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-19 16:36:08,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:36:08,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:08,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:08,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:36:08,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-19 16:36:08,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-19 16:36:08,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:36:08,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:08,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:08,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:36:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-19 16:36:08,999 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:36:09,010 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:36:09,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 16:36:09,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 16:36:09,011 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 16:36:09,011 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-19 16:36:09,012 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 14 states. [2018-09-19 16:36:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:36:10,458 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2018-09-19 16:36:10,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 16:36:10,460 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2018-09-19 16:36:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:36:10,461 INFO L225 Difference]: With dead ends: 87 [2018-09-19 16:36:10,461 INFO L226 Difference]: Without dead ends: 66 [2018-09-19 16:36:10,462 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-09-19 16:36:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-19 16:36:10,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-19 16:36:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-19 16:36:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2018-09-19 16:36:10,469 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 86 [2018-09-19 16:36:10,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:36:10,469 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2018-09-19 16:36:10,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 16:36:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-09-19 16:36:10,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-19 16:36:10,470 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:36:10,470 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-09-19 16:36:10,471 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:36:10,471 INFO L82 PathProgramCache]: Analyzing trace with hash 150448904, now seen corresponding path program 1 times [2018-09-19 16:36:10,471 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:36:10,471 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2018-09-19 16:36:10,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:36:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:36:10,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:36:10,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:36:10,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-19 16:36:10,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:36:10,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:10,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:10,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:36:10,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-19 16:36:10,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-19 16:36:10,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:36:10,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:10,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:10,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:36:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-19 16:36:11,100 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:36:11,110 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:36:11,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 16:36:11,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 16:36:11,111 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 16:36:11,112 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-19 16:36:11,112 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 14 states. [2018-09-19 16:36:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:36:12,685 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2018-09-19 16:36:12,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 16:36:12,685 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 87 [2018-09-19 16:36:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:36:12,686 INFO L225 Difference]: With dead ends: 89 [2018-09-19 16:36:12,687 INFO L226 Difference]: Without dead ends: 68 [2018-09-19 16:36:12,687 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-09-19 16:36:12,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-19 16:36:12,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-09-19 16:36:12,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-19 16:36:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2018-09-19 16:36:12,693 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 87 [2018-09-19 16:36:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:36:12,694 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2018-09-19 16:36:12,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 16:36:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2018-09-19 16:36:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-19 16:36:12,694 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:36:12,695 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-09-19 16:36:12,695 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:36:12,695 INFO L82 PathProgramCache]: Analyzing trace with hash 271528528, now seen corresponding path program 1 times [2018-09-19 16:36:12,695 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:36:12,696 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:36:12,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2018-09-19 16:36:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:36:12,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:36:12,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:36:12,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-19 16:36:12,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:36:12,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:12,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:12,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:36:12,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-19 16:36:12,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-19 16:36:12,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:36:12,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:12,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:12,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:36:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-19 16:36:13,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:36:13,364 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-09-19 16:36:14,432 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-09-19 16:36:14,442 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:36:14,442 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-09-19 16:36:14,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-19 16:36:14,443 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-19 16:36:14,443 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-09-19 16:36:14,443 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand 21 states. [2018-09-19 16:36:15,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:36:15,876 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2018-09-19 16:36:15,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-19 16:36:15,877 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2018-09-19 16:36:15,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:36:15,878 INFO L225 Difference]: With dead ends: 91 [2018-09-19 16:36:15,878 INFO L226 Difference]: Without dead ends: 76 [2018-09-19 16:36:15,880 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 153 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2018-09-19 16:36:15,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-19 16:36:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2018-09-19 16:36:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-19 16:36:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2018-09-19 16:36:15,887 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 87 [2018-09-19 16:36:15,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:36:15,888 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2018-09-19 16:36:15,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-19 16:36:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2018-09-19 16:36:15,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-19 16:36:15,889 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:36:15,889 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-09-19 16:36:15,889 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:36:15,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1779536988, now seen corresponding path program 1 times [2018-09-19 16:36:15,890 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:36:15,890 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:36:15,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2018-09-19 16:36:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:36:15,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:36:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-09-19 16:36:16,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-19 16:36:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-09-19 16:36:16,787 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-19 16:36:16,787 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-09-19 16:36:16,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-19 16:36:16,788 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-19 16:36:16,788 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-09-19 16:36:16,788 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 17 states. [2018-09-19 16:36:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:36:17,517 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2018-09-19 16:36:17,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-19 16:36:17,518 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-09-19 16:36:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:36:17,519 INFO L225 Difference]: With dead ends: 86 [2018-09-19 16:36:17,519 INFO L226 Difference]: Without dead ends: 71 [2018-09-19 16:36:17,519 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-09-19 16:36:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-19 16:36:17,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2018-09-19 16:36:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-19 16:36:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-09-19 16:36:17,525 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 88 [2018-09-19 16:36:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:36:17,525 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-09-19 16:36:17,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-19 16:36:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-09-19 16:36:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-19 16:36:17,526 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:36:17,526 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-09-19 16:36:17,526 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:36:17,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1716355938, now seen corresponding path program 1 times [2018-09-19 16:36:17,527 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:36:17,527 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2018-09-19 16:36:17,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-19 16:36:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:36:17,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:36:17,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:36:17,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-19 16:36:17,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:36:17,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:17,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:17,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:36:17,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-19 16:36:17,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-19 16:36:17,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:36:17,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:17,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:17,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:36:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-19 16:36:18,128 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:36:18,138 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:36:18,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 16:36:18,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 16:36:18,139 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 16:36:18,139 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-19 16:36:18,139 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 14 states. [2018-09-19 16:36:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:36:20,299 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-09-19 16:36:20,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 16:36:20,300 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2018-09-19 16:36:20,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:36:20,301 INFO L225 Difference]: With dead ends: 88 [2018-09-19 16:36:20,302 INFO L226 Difference]: Without dead ends: 67 [2018-09-19 16:36:20,302 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-09-19 16:36:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-19 16:36:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-09-19 16:36:20,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-19 16:36:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-09-19 16:36:20,312 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 88 [2018-09-19 16:36:20,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:36:20,312 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-09-19 16:36:20,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 16:36:20,313 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-09-19 16:36:20,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-19 16:36:20,313 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:36:20,316 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-09-19 16:36:20,316 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:36:20,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1492273228, now seen corresponding path program 1 times [2018-09-19 16:36:20,317 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:36:20,317 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:36:20,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2018-09-19 16:36:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:36:20,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:36:20,655 WARN L178 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-09-19 16:36:20,890 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-19 16:36:21,175 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-19 16:36:21,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-09-19 16:36:21,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-19 16:36:21,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:36:21,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:21,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:21,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:21 [2018-09-19 16:36:21,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-09-19 16:36:21,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-09-19 16:36:21,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-19 16:36:21,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:21,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-19 16:36:21,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:9 [2018-09-19 16:36:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-09-19 16:36:21,567 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:36:21,576 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:36:21,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-09-19 16:36:21,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-19 16:36:21,577 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-19 16:36:21,577 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-19 16:36:21,578 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 14 states. [2018-09-19 16:36:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:36:22,901 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2018-09-19 16:36:22,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-19 16:36:22,902 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2018-09-19 16:36:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:36:22,903 INFO L225 Difference]: With dead ends: 86 [2018-09-19 16:36:22,903 INFO L226 Difference]: Without dead ends: 65 [2018-09-19 16:36:22,903 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2018-09-19 16:36:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-19 16:36:22,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-09-19 16:36:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-19 16:36:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-09-19 16:36:22,908 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 89 [2018-09-19 16:36:22,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:36:22,908 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-09-19 16:36:22,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-19 16:36:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-09-19 16:36:22,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-19 16:36:22,909 INFO L368 BasicCegarLoop]: Found error trace [2018-09-19 16:36:22,909 INFO L376 BasicCegarLoop]: trace histogram [6, 6, 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] [2018-09-19 16:36:22,910 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-19 16:36:22,910 INFO L82 PathProgramCache]: Analyzing trace with hash -2109592371, now seen corresponding path program 1 times [2018-09-19 16:36:22,910 INFO L227 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-09-19 16:36:22,910 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-09-19 16:36:22,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2018-09-19 16:36:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-19 16:36:23,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-19 16:36:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-09-19 16:36:23,143 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-09-19 16:36:23,162 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-19 16:36:23,162 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-19 16:36:23,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-19 16:36:23,163 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-19 16:36:23,163 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:36:23,163 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 4 states. [2018-09-19 16:36:23,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-19 16:36:23,219 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-09-19 16:36:23,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-19 16:36:23,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-09-19 16:36:23,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-19 16:36:23,220 INFO L225 Difference]: With dead ends: 66 [2018-09-19 16:36:23,220 INFO L226 Difference]: Without dead ends: 0 [2018-09-19 16:36:23,221 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-19 16:36:23,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-19 16:36:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-19 16:36:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-19 16:36:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-19 16:36:23,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 89 [2018-09-19 16:36:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-19 16:36:23,222 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-19 16:36:23,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-19 16:36:23,222 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-19 16:36:23,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-19 16:36:23,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-19 16:36:23,659 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-19 16:36:23,839 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-09-19 16:36:24,068 WARN L178 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 9 [2018-09-19 16:36:24,348 INFO L426 ceAbstractionStarter]: For program point isnan_floatFINAL(line 57) no Hoare annotation was computed. [2018-09-19 16:36:24,348 INFO L429 ceAbstractionStarter]: At program point isnan_floatENTRY(line 57) the Hoare annotation is: true [2018-09-19 16:36:24,348 INFO L426 ceAbstractionStarter]: For program point isnan_floatEXIT(line 57) no Hoare annotation was computed. [2018-09-19 16:36:24,348 INFO L429 ceAbstractionStarter]: At program point fmin_floatENTRY(lines 35 42) the Hoare annotation is: true [2018-09-19 16:36:24,349 INFO L426 ceAbstractionStarter]: For program point fmin_floatEXIT(lines 35 42) no Hoare annotation was computed. [2018-09-19 16:36:24,349 INFO L426 ceAbstractionStarter]: For program point fmin_floatFINAL(lines 35 42) no Hoare annotation was computed. [2018-09-19 16:36:24,349 INFO L426 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-09-19 16:36:24,349 INFO L426 ceAbstractionStarter]: For program point L41-2(line 41) no Hoare annotation was computed. [2018-09-19 16:36:24,349 INFO L422 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (= fmin_float_~x |fmin_float_#in~x|) (= fmin_float_~y |fmin_float_#in~y|)) [2018-09-19 16:36:24,349 INFO L426 ceAbstractionStarter]: For program point L38-1(lines 38 39) no Hoare annotation was computed. [2018-09-19 16:36:24,349 INFO L422 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (and (= fmin_float_~x |fmin_float_#in~x|) (= fmin_float_~y |fmin_float_#in~y|)) [2018-09-19 16:36:24,349 INFO L426 ceAbstractionStarter]: For program point L36-1(lines 36 37) no Hoare annotation was computed. [2018-09-19 16:36:24,349 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:36:24,349 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:36:24,349 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:36:24,350 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-19 16:36:24,350 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-19 16:36:24,350 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-19 16:36:24,350 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-19 16:36:24,350 INFO L422 ceAbstractionStarter]: At program point L68-3(line 68) the Hoare annotation is: (and (= (_ bv1 32) |main_#t~ret9|) |main_#t~short11| (not (fp.eq main_~x~0 main_~x~0))) [2018-09-19 16:36:24,350 INFO L426 ceAbstractionStarter]: For program point L68-4(line 68) no Hoare annotation was computed. [2018-09-19 16:36:24,350 INFO L426 ceAbstractionStarter]: For program point L68-6(line 68) no Hoare annotation was computed. [2018-09-19 16:36:24,350 INFO L426 ceAbstractionStarter]: For program point L68-7(lines 68 69) no Hoare annotation was computed. [2018-09-19 16:36:24,350 INFO L426 ceAbstractionStarter]: For program point L68-9(lines 68 84) no Hoare annotation was computed. [2018-09-19 16:36:24,351 INFO L426 ceAbstractionStarter]: For program point L68-11(lines 68 84) no Hoare annotation was computed. [2018-09-19 16:36:24,351 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 59 87) no Hoare annotation was computed. [2018-09-19 16:36:24,351 INFO L426 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2018-09-19 16:36:24,351 INFO L426 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-09-19 16:36:24,351 INFO L422 ceAbstractionStarter]: At program point L69(line 69) the Hoare annotation is: (let ((.cse0 (not |main_#t~short11|)) (.cse2 (fp.eq main_~x~0 main_~x~0)) (.cse1 (not |main_#t~short15|))) (or (and .cse0 .cse1 (= (_ bv1 32) |main_#t~ret9|) (= (bvadd |main_#t~ret10| (_ bv4294967295 32)) (_ bv0 32)) (not (fp.eq main_~y~0 main_~y~0)) (not .cse2)) (and .cse0 .cse2 .cse1 (= (_ bv0 32) |main_#t~ret9|)))) [2018-09-19 16:36:24,351 INFO L426 ceAbstractionStarter]: For program point L69-1(line 69) no Hoare annotation was computed. [2018-09-19 16:36:24,351 INFO L426 ceAbstractionStarter]: For program point L69-2(line 69) no Hoare annotation was computed. [2018-09-19 16:36:24,352 INFO L422 ceAbstractionStarter]: At program point L69-3(line 69) the Hoare annotation is: (and |main_#t~short14| (not |main_#t~short11|) (fp.eq main_~x~0 main_~x~0) (not |main_#t~short15|) (= |main_#t~ret12| (_ bv0 32)) (= (_ bv0 32) |main_#t~ret9|)) [2018-09-19 16:36:24,352 INFO L426 ceAbstractionStarter]: For program point L69-4(line 69) no Hoare annotation was computed. [2018-09-19 16:36:24,352 INFO L426 ceAbstractionStarter]: For program point L69-6(line 69) no Hoare annotation was computed. [2018-09-19 16:36:24,352 INFO L422 ceAbstractionStarter]: At program point L74(line 74) the Hoare annotation is: (let ((.cse1 (fp.eq main_~y~0 main_~y~0)) (.cse0 (fp.eq main_~x~0 main_~x~0))) (or (and (= main_~x~0 main_~res~0) .cse0 (not .cse1)) (and (= main_~y~0 main_~res~0) .cse1 (not .cse0)))) [2018-09-19 16:36:24,352 INFO L426 ceAbstractionStarter]: For program point L74-1(line 74) no Hoare annotation was computed. [2018-09-19 16:36:24,352 INFO L426 ceAbstractionStarter]: For program point L74-2(line 74) no Hoare annotation was computed. [2018-09-19 16:36:24,352 INFO L422 ceAbstractionStarter]: At program point L74-3(line 74) the Hoare annotation is: (and (= main_~y~0 main_~res~0) |main_#t~short19| (fp.eq main_~y~0 main_~y~0) (not (fp.eq main_~x~0 main_~x~0))) [2018-09-19 16:36:24,353 INFO L426 ceAbstractionStarter]: For program point L74-4(line 74) no Hoare annotation was computed. [2018-09-19 16:36:24,353 INFO L426 ceAbstractionStarter]: For program point L74-6(lines 74 77) no Hoare annotation was computed. [2018-09-19 16:36:24,353 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 75) no Hoare annotation was computed. [2018-09-19 16:36:24,353 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 59 87) no Hoare annotation was computed. [2018-09-19 16:36:24,353 INFO L426 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-09-19 16:36:24,353 INFO L422 ceAbstractionStarter]: At program point L71(line 71) the Hoare annotation is: (let ((.cse1 (fp.eq main_~y~0 main_~y~0)) (.cse0 (fp.eq main_~x~0 main_~x~0))) (or (and .cse0 (not .cse1)) (and .cse1 (not .cse0)))) [2018-09-19 16:36:24,353 INFO L426 ceAbstractionStarter]: For program point L71-1(line 71) no Hoare annotation was computed. [2018-09-19 16:36:24,353 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 59 87) the Hoare annotation is: true [2018-09-19 16:36:24,354 INFO L422 ceAbstractionStarter]: At program point L80(line 80) the Hoare annotation is: (or (and (= main_~x~0 main_~res~0) (not (fp.eq main_~y~0 main_~y~0))) (not (fp.eq main_~x~0 main_~x~0))) [2018-09-19 16:36:24,354 INFO L426 ceAbstractionStarter]: For program point L80-1(line 80) no Hoare annotation was computed. [2018-09-19 16:36:24,354 INFO L426 ceAbstractionStarter]: For program point L80-2(line 80) no Hoare annotation was computed. [2018-09-19 16:36:24,354 INFO L422 ceAbstractionStarter]: At program point L80-3(line 80) the Hoare annotation is: (and (= main_~x~0 main_~res~0) (fp.eq main_~x~0 main_~x~0) |main_#t~short22| (not (fp.eq main_~y~0 main_~y~0))) [2018-09-19 16:36:24,354 INFO L426 ceAbstractionStarter]: For program point L80-4(line 80) no Hoare annotation was computed. [2018-09-19 16:36:24,354 INFO L426 ceAbstractionStarter]: For program point L80-6(lines 80 83) no Hoare annotation was computed. [2018-09-19 16:36:24,354 INFO L429 ceAbstractionStarter]: At program point L68(line 68) the Hoare annotation is: true [2018-09-19 16:36:24,355 INFO L426 ceAbstractionStarter]: For program point L68-1(line 68) no Hoare annotation was computed. [2018-09-19 16:36:24,355 INFO L426 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2018-09-19 16:36:24,355 INFO L426 ceAbstractionStarter]: For program point L29(lines 29 32) no Hoare annotation was computed. [2018-09-19 16:36:24,355 INFO L426 ceAbstractionStarter]: For program point __fpclassify_floatFINAL(lines 12 33) no Hoare annotation was computed. [2018-09-19 16:36:24,355 INFO L426 ceAbstractionStarter]: For program point L23(lines 23 32) no Hoare annotation was computed. [2018-09-19 16:36:24,355 INFO L426 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-09-19 16:36:24,355 INFO L426 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2018-09-19 16:36:24,355 INFO L422 ceAbstractionStarter]: At program point L15-3(lines 15 19) the Hoare annotation is: (= __fpclassify_float_~x |__fpclassify_float_#in~x|) [2018-09-19 16:36:24,355 INFO L426 ceAbstractionStarter]: For program point L15-4(lines 12 33) no Hoare annotation was computed. [2018-09-19 16:36:24,355 INFO L426 ceAbstractionStarter]: For program point L26(lines 26 32) no Hoare annotation was computed. [2018-09-19 16:36:24,356 INFO L426 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-09-19 16:36:24,356 INFO L426 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2018-09-19 16:36:24,356 INFO L426 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-09-19 16:36:24,356 INFO L426 ceAbstractionStarter]: For program point L18-2(line 18) no Hoare annotation was computed. [2018-09-19 16:36:24,356 INFO L426 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2018-09-19 16:36:24,356 INFO L426 ceAbstractionStarter]: For program point L16-2(line 16) no Hoare annotation was computed. [2018-09-19 16:36:24,356 INFO L426 ceAbstractionStarter]: For program point L16-3(line 16) no Hoare annotation was computed. [2018-09-19 16:36:24,356 INFO L429 ceAbstractionStarter]: At program point __fpclassify_floatENTRY(lines 12 33) the Hoare annotation is: true [2018-09-19 16:36:24,356 INFO L426 ceAbstractionStarter]: For program point __fpclassify_floatEXIT(lines 12 33) no Hoare annotation was computed. [2018-09-19 16:36:24,357 INFO L426 ceAbstractionStarter]: For program point __signbit_floatFINAL(lines 44 54) no Hoare annotation was computed. [2018-09-19 16:36:24,357 INFO L426 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2018-09-19 16:36:24,357 INFO L426 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-09-19 16:36:24,357 INFO L426 ceAbstractionStarter]: For program point L50-1(line 50) no Hoare annotation was computed. [2018-09-19 16:36:24,357 INFO L426 ceAbstractionStarter]: For program point __signbit_floatENTRY(lines 44 54) no Hoare annotation was computed. [2018-09-19 16:36:24,357 INFO L426 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-09-19 16:36:24,357 INFO L426 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2018-09-19 16:36:24,357 INFO L426 ceAbstractionStarter]: For program point L48-1(line 48) no Hoare annotation was computed. [2018-09-19 16:36:24,357 INFO L426 ceAbstractionStarter]: For program point L48-2(line 48) no Hoare annotation was computed. [2018-09-19 16:36:24,358 INFO L426 ceAbstractionStarter]: For program point L47-1(lines 47 51) no Hoare annotation was computed. [2018-09-19 16:36:24,358 INFO L426 ceAbstractionStarter]: For program point L48-3(line 48) no Hoare annotation was computed. [2018-09-19 16:36:24,358 INFO L426 ceAbstractionStarter]: For program point L47-3(lines 47 51) no Hoare annotation was computed. [2018-09-19 16:36:24,358 INFO L426 ceAbstractionStarter]: For program point __signbit_floatEXIT(lines 44 54) no Hoare annotation was computed. [2018-09-19 16:36:24,358 INFO L426 ceAbstractionStarter]: For program point L47-4(lines 47 51) no Hoare annotation was computed. [2018-09-19 16:36:24,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.09 04:36:24 BoogieIcfgContainer [2018-09-19 16:36:24,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-19 16:36:24,372 INFO L168 Benchmark]: Toolchain (without parser) took 52930.53 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -454.7 MB). Peak memory consumption was 625.4 MB. Max. memory is 7.1 GB. [2018-09-19 16:36:24,373 INFO L168 Benchmark]: CDTParser took 0.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:36:24,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-19 16:36:24,375 INFO L168 Benchmark]: Boogie Preprocessor took 89.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-19 16:36:24,375 INFO L168 Benchmark]: RCFGBuilder took 879.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.7 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2018-09-19 16:36:24,376 INFO L168 Benchmark]: TraceAbstraction took 51522.66 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 352.8 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 299.4 MB). Peak memory consumption was 652.3 MB. Max. memory is 7.1 GB. [2018-09-19 16:36:24,378 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.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 433.01 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 89.79 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 879.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.7 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 51522.66 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 352.8 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 299.4 MB). Peak memory consumption was 652.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 75]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 81]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: x == \old(x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 86 locations, 2 error locations. SAFE Result, 51.4s OverallTime, 31 OverallIterations, 6 TraceHistogramMax, 26.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2311 SDtfs, 1032 SDslu, 12986 SDs, 0 SdLazy, 5515 SolverSat, 250 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3058 GetRequests, 2664 SyntacticMatches, 8 SemanticMatches, 386 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 19.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=14, 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: 0.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 179 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 156 PreInvPairs, 180 NumberOfFragments, 159 HoareAnnotationTreeSize, 156 FomulaSimplifications, 780 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 19 FomulaSimplificationsInter, 99 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 20.1s InterpolantComputationTime, 2251 NumberOfCodeBlocks, 2251 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2824 ConstructedInterpolants, 35 QuantifiedInterpolants, 633855 SizeOfPredicates, 186 NumberOfNonLiveVariables, 4300 ConjunctsInSsa, 337 ConjunctsInUnsatCore, 42 InterpolantComputations, 20 PerfectInterpolantSequences, 1229/1365 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...