java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test24-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:35:36,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:35:36,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:35:36,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:35:36,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:35:36,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:35:36,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:35:36,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:35:36,811 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:35:36,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:35:36,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:35:36,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:35:36,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:35:36,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:35:36,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:35:36,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:35:36,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:35:36,819 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:35:36,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:35:36,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:35:36,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:35:36,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:35:36,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:35:36,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:35:36,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:35:36,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:35:36,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:35:36,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:35:36,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:35:36,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:35:36,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:35:36,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:35:36,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:35:36,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:35:36,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:35:36,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:35:36,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:35:36,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:35:36,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:35:36,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:35:36,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:35:36,839 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 01:35:36,853 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:35:36,854 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:35:36,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:35:36,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:35:36,855 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:35:36,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:35:36,856 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:35:36,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:35:36,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:35:36,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:35:36,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:35:36,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:35:36,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:35:36,857 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:35:36,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:35:36,857 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:35:36,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:35:36,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:35:36,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:35:36,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:35:36,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:35:36,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:35:36,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:35:36,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:35:36,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:35:36,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:35:36,860 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:35:36,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:35:36,860 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:35:36,888 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:35:36,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:35:36,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:35:36,906 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:35:36,906 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:35:36,907 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test24-2.c [2019-09-08 01:35:36,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dcf36b4f/2936bc3ff2a14fa3b88520d9d4757385/FLAGfb2240645 [2019-09-08 01:35:37,450 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:35:37,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test24-2.c [2019-09-08 01:35:37,458 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dcf36b4f/2936bc3ff2a14fa3b88520d9d4757385/FLAGfb2240645 [2019-09-08 01:35:37,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dcf36b4f/2936bc3ff2a14fa3b88520d9d4757385 [2019-09-08 01:35:37,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:35:37,826 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:35:37,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:35:37,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:35:37,831 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:35:37,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:35:37" (1/1) ... [2019-09-08 01:35:37,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d11683b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:37, skipping insertion in model container [2019-09-08 01:35:37,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:35:37" (1/1) ... [2019-09-08 01:35:37,844 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:35:37,864 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:35:38,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:35:38,112 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:35:38,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:35:38,169 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:35:38,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:38 WrapperNode [2019-09-08 01:35:38,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:35:38,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:35:38,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:35:38,172 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:35:38,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:38" (1/1) ... [2019-09-08 01:35:38,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:38" (1/1) ... [2019-09-08 01:35:38,289 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:38" (1/1) ... [2019-09-08 01:35:38,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:38" (1/1) ... [2019-09-08 01:35:38,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:38" (1/1) ... [2019-09-08 01:35:38,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:38" (1/1) ... [2019-09-08 01:35:38,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:38" (1/1) ... [2019-09-08 01:35:38,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:35:38,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:35:38,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:35:38,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:35:38,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:35:38,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:35:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:35:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 01:35:38,376 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:35:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:35:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 01:35:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 01:35:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 01:35:38,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:35:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 01:35:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 01:35:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 01:35:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:35:38,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:35:38,669 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:35:38,669 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 01:35:38,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:35:38 BoogieIcfgContainer [2019-09-08 01:35:38,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:35:38,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:35:38,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:35:38,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:35:38,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:35:37" (1/3) ... [2019-09-08 01:35:38,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fea0fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:35:38, skipping insertion in model container [2019-09-08 01:35:38,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:38" (2/3) ... [2019-09-08 01:35:38,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fea0fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:35:38, skipping insertion in model container [2019-09-08 01:35:38,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:35:38" (3/3) ... [2019-09-08 01:35:38,679 INFO L109 eAbstractionObserver]: Analyzing ICFG test24-2.c [2019-09-08 01:35:38,690 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:35:38,698 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:35:38,716 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:35:38,748 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:35:38,749 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:35:38,749 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:35:38,749 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:35:38,749 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:35:38,749 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:35:38,750 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:35:38,750 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:35:38,750 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:35:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-08 01:35:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 01:35:38,772 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:38,773 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:38,775 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:38,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:38,779 INFO L82 PathProgramCache]: Analyzing trace with hash 855240046, now seen corresponding path program 1 times [2019-09-08 01:35:38,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:38,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:38,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:38,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:38,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:38,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:38,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:35:38,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 01:35:38,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 01:35:38,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 01:35:38,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:35:38,943 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-08 01:35:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:38,961 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-09-08 01:35:38,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 01:35:38,962 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-09-08 01:35:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:38,972 INFO L225 Difference]: With dead ends: 42 [2019-09-08 01:35:38,972 INFO L226 Difference]: Without dead ends: 20 [2019-09-08 01:35:38,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:35:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-08 01:35:39,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-08 01:35:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-08 01:35:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-08 01:35:39,017 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-09-08 01:35:39,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:39,018 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-08 01:35:39,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 01:35:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-08 01:35:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 01:35:39,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:39,019 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:39,020 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:39,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1631497781, now seen corresponding path program 1 times [2019-09-08 01:35:39,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:39,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:39,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:39,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:39,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:39,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:35:39,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:35:39,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:35:39,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:35:39,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:35:39,113 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2019-09-08 01:35:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:39,144 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-08 01:35:39,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:35:39,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-08 01:35:39,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:39,145 INFO L225 Difference]: With dead ends: 34 [2019-09-08 01:35:39,146 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 01:35:39,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:35:39,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 01:35:39,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-08 01:35:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 01:35:39,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-08 01:35:39,152 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-09-08 01:35:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:39,153 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-08 01:35:39,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:35:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-08 01:35:39,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 01:35:39,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:39,154 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:39,154 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:39,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:39,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1934775405, now seen corresponding path program 1 times [2019-09-08 01:35:39,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:39,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:39,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:39,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:39,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:39,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:39,245 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:39,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:39,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 01:35:39,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:39,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:39,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 01:35:39,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:35:39,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:35:39,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:35:39,352 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2019-09-08 01:35:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:39,389 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-08 01:35:39,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:35:39,390 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-08 01:35:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:39,391 INFO L225 Difference]: With dead ends: 36 [2019-09-08 01:35:39,391 INFO L226 Difference]: Without dead ends: 24 [2019-09-08 01:35:39,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:35:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-08 01:35:39,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-08 01:35:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 01:35:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-08 01:35:39,398 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-09-08 01:35:39,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:39,398 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-08 01:35:39,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:35:39,399 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-08 01:35:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 01:35:39,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:39,400 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:39,400 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:39,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:39,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1739404943, now seen corresponding path program 2 times [2019-09-08 01:35:39,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:39,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:39,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:39,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:39,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:39,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:39,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:35:39,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:39,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:35:39,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:39,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 01:35:39,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-08 01:35:39,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:39,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-08 01:35:39,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 01:35:39,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 01:35:39,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:35:39,589 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2019-09-08 01:35:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:39,626 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-09-08 01:35:39,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 01:35:39,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-08 01:35:39,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:39,628 INFO L225 Difference]: With dead ends: 38 [2019-09-08 01:35:39,628 INFO L226 Difference]: Without dead ends: 26 [2019-09-08 01:35:39,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 01:35:39,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-08 01:35:39,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-09-08 01:35:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 01:35:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-09-08 01:35:39,635 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-09-08 01:35:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:39,636 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-09-08 01:35:39,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 01:35:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-09-08 01:35:39,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 01:35:39,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:39,637 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:39,638 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:39,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:39,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1328015311, now seen corresponding path program 3 times [2019-09-08 01:35:39,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:39,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:39,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:39,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:39,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:39,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:39,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:39,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:39,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:35:39,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 01:35:39,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:39,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 01:35:39,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:35:39,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:39,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 01:35:39,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:35:39,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:35:39,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:35:39,839 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2019-09-08 01:35:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:39,889 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-09-08 01:35:39,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:35:39,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-09-08 01:35:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:39,892 INFO L225 Difference]: With dead ends: 40 [2019-09-08 01:35:39,892 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 01:35:39,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:35:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 01:35:39,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-08 01:35:39,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 01:35:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-08 01:35:39,898 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-09-08 01:35:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:39,899 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-08 01:35:39,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:35:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-08 01:35:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 01:35:39,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:39,901 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:39,901 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:39,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:39,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1523652947, now seen corresponding path program 4 times [2019-09-08 01:35:39,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:39,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:39,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:39,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:39,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:40,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:40,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:40,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:35:40,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:35:40,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:40,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 01:35:40,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:35:40,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:40,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 01:35:40,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:35:40,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:35:40,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:35:40,107 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2019-09-08 01:35:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:40,151 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-09-08 01:35:40,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:35:40,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-09-08 01:35:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:40,154 INFO L225 Difference]: With dead ends: 42 [2019-09-08 01:35:40,155 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 01:35:40,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:35:40,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 01:35:40,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-08 01:35:40,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 01:35:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-09-08 01:35:40,162 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-09-08 01:35:40,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:40,163 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-09-08 01:35:40,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:35:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-09-08 01:35:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:35:40,165 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:40,165 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:40,165 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:40,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:40,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1787714037, now seen corresponding path program 5 times [2019-09-08 01:35:40,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:40,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:40,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:40,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:40,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:40,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:40,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:35:40,319 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:40,372 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-09-08 01:35:40,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:40,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 01:35:40,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:40,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:40,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-08 01:35:40,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 01:35:40,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 01:35:40,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:35:40,399 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 9 states. [2019-09-08 01:35:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:40,454 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-09-08 01:35:40,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 01:35:40,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-09-08 01:35:40,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:40,458 INFO L225 Difference]: With dead ends: 44 [2019-09-08 01:35:40,458 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 01:35:40,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:35:40,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 01:35:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-08 01:35:40,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 01:35:40,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-08 01:35:40,469 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-09-08 01:35:40,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:40,470 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-08 01:35:40,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 01:35:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-08 01:35:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 01:35:40,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:40,472 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:40,473 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:40,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:40,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2147351063, now seen corresponding path program 6 times [2019-09-08 01:35:40,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:40,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:40,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:40,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:40,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:40,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:40,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:40,625 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:35:40,750 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 01:35:40,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:40,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 01:35:40,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:40,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:40,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-08 01:35:40,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 01:35:40,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 01:35:40,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:35:40,806 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 10 states. [2019-09-08 01:35:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:40,876 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-09-08 01:35:40,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 01:35:40,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-09-08 01:35:40,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:40,879 INFO L225 Difference]: With dead ends: 46 [2019-09-08 01:35:40,879 INFO L226 Difference]: Without dead ends: 34 [2019-09-08 01:35:40,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-08 01:35:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-08 01:35:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-08 01:35:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-08 01:35:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-09-08 01:35:40,896 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-09-08 01:35:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:40,896 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-09-08 01:35:40,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 01:35:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-09-08 01:35:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 01:35:40,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:40,898 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:40,899 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:40,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:40,905 INFO L82 PathProgramCache]: Analyzing trace with hash -133817927, now seen corresponding path program 7 times [2019-09-08 01:35:40,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:40,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:40,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:40,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:40,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:41,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:41,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:41,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:41,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:35:41,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:41,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:41,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-08 01:35:41,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 01:35:41,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 01:35:41,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:35:41,145 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2019-09-08 01:35:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:41,201 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-09-08 01:35:41,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:35:41,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2019-09-08 01:35:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:41,205 INFO L225 Difference]: With dead ends: 48 [2019-09-08 01:35:41,205 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 01:35:41,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:35:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 01:35:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-08 01:35:41,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 01:35:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-08 01:35:41,216 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-09-08 01:35:41,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:41,216 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-08 01:35:41,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 01:35:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-08 01:35:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 01:35:41,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:41,220 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:41,220 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:41,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:41,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1903896357, now seen corresponding path program 8 times [2019-09-08 01:35:41,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:41,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:41,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:41,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:41,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:41,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:41,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:41,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:35:41,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:35:41,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:41,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 01:35:41,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:35:41,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:41,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-08 01:35:41,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 01:35:41,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 01:35:41,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:35:41,486 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 12 states. [2019-09-08 01:35:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:41,563 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2019-09-08 01:35:41,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 01:35:41,564 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2019-09-08 01:35:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:41,565 INFO L225 Difference]: With dead ends: 50 [2019-09-08 01:35:41,565 INFO L226 Difference]: Without dead ends: 38 [2019-09-08 01:35:41,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:35:41,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-08 01:35:41,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-08 01:35:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 01:35:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-09-08 01:35:41,576 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-09-08 01:35:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:41,577 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-09-08 01:35:41,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 01:35:41,577 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-09-08 01:35:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 01:35:41,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:41,580 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:41,580 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2142218371, now seen corresponding path program 9 times [2019-09-08 01:35:41,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:41,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:41,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:41,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:41,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:41,726 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:41,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:41,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:35:41,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:41,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-08 01:35:41,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:41,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 01:35:41,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:42,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:42,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-08 01:35:42,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 01:35:42,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 01:35:42,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:35:42,006 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2019-09-08 01:35:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:42,056 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-09-08 01:35:42,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 01:35:42,057 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-09-08 01:35:42,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:42,059 INFO L225 Difference]: With dead ends: 52 [2019-09-08 01:35:42,059 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 01:35:42,062 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-08 01:35:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 01:35:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-08 01:35:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 01:35:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-08 01:35:42,070 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-09-08 01:35:42,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:42,072 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-08 01:35:42,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 01:35:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-08 01:35:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 01:35:42,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:42,074 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:42,074 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:42,075 INFO L82 PathProgramCache]: Analyzing trace with hash 758560159, now seen corresponding path program 10 times [2019-09-08 01:35:42,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:42,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:42,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:42,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:42,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:42,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:42,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:42,237 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:35:42,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:35:42,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:42,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 01:35:42,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:42,295 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:42,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:42,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-08 01:35:42,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 01:35:42,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 01:35:42,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:35:42,303 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 14 states. [2019-09-08 01:35:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:42,361 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-09-08 01:35:42,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 01:35:42,362 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2019-09-08 01:35:42,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:42,363 INFO L225 Difference]: With dead ends: 54 [2019-09-08 01:35:42,363 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 01:35:42,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:35:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 01:35:42,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-08 01:35:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-08 01:35:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-09-08 01:35:42,369 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-09-08 01:35:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:42,369 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-09-08 01:35:42,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 01:35:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-09-08 01:35:42,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:35:42,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:42,370 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:42,371 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:42,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:42,371 INFO L82 PathProgramCache]: Analyzing trace with hash 972952385, now seen corresponding path program 11 times [2019-09-08 01:35:42,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:42,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:42,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:42,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:42,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:42,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:42,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:42,530 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:35:42,778 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-08 01:35:42,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:42,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 01:35:42,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:42,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:42,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-08 01:35:42,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 01:35:42,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 01:35:42,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:35:42,824 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2019-09-08 01:35:42,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:42,890 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-09-08 01:35:42,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 01:35:42,891 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2019-09-08 01:35:42,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:42,892 INFO L225 Difference]: With dead ends: 56 [2019-09-08 01:35:42,892 INFO L226 Difference]: Without dead ends: 44 [2019-09-08 01:35:42,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-08 01:35:42,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-08 01:35:42,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-09-08 01:35:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 01:35:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-09-08 01:35:42,909 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-09-08 01:35:42,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:42,910 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-09-08 01:35:42,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 01:35:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-09-08 01:35:42,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 01:35:42,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:42,915 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:42,916 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:42,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:42,917 INFO L82 PathProgramCache]: Analyzing trace with hash 845451363, now seen corresponding path program 12 times [2019-09-08 01:35:42,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:42,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:42,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:42,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:42,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:43,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:43,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:43,124 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:35:43,913 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-08 01:35:43,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:43,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 01:35:43,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:43,951 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:43,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:43,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-08 01:35:43,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 01:35:43,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 01:35:43,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:35:43,960 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 16 states. [2019-09-08 01:35:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:44,011 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-09-08 01:35:44,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 01:35:44,012 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2019-09-08 01:35:44,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:44,013 INFO L225 Difference]: With dead ends: 58 [2019-09-08 01:35:44,014 INFO L226 Difference]: Without dead ends: 46 [2019-09-08 01:35:44,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-08 01:35:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-08 01:35:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-09-08 01:35:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-08 01:35:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-09-08 01:35:44,019 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-09-08 01:35:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:44,020 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-09-08 01:35:44,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 01:35:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-09-08 01:35:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-08 01:35:44,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:44,021 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:44,021 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:44,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1423946491, now seen corresponding path program 13 times [2019-09-08 01:35:44,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:44,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:44,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:44,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:44,157 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:35:44,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:44,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 01:35:44,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:44,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:44,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-08 01:35:44,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 01:35:44,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 01:35:44,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 01:35:44,250 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 17 states. [2019-09-08 01:35:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:44,307 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-09-08 01:35:44,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 01:35:44,307 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2019-09-08 01:35:44,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:44,308 INFO L225 Difference]: With dead ends: 60 [2019-09-08 01:35:44,308 INFO L226 Difference]: Without dead ends: 48 [2019-09-08 01:35:44,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-08 01:35:44,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-08 01:35:44,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-08 01:35:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-08 01:35:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-09-08 01:35:44,314 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-09-08 01:35:44,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:44,314 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-09-08 01:35:44,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 01:35:44,314 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-09-08 01:35:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-08 01:35:44,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:44,315 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:44,315 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:44,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:44,315 INFO L82 PathProgramCache]: Analyzing trace with hash -471897817, now seen corresponding path program 14 times [2019-09-08 01:35:44,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:44,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:44,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:44,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:44,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:44,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:44,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:44,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:35:44,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:35:44,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:44,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 01:35:44,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:44,613 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:44,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:44,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-08 01:35:44,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 01:35:44,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 01:35:44,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 01:35:44,621 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 18 states. [2019-09-08 01:35:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:44,709 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2019-09-08 01:35:44,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 01:35:44,711 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2019-09-08 01:35:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:44,712 INFO L225 Difference]: With dead ends: 62 [2019-09-08 01:35:44,712 INFO L226 Difference]: Without dead ends: 50 [2019-09-08 01:35:44,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-08 01:35:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-08 01:35:44,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-08 01:35:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-08 01:35:44,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-09-08 01:35:44,725 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-09-08 01:35:44,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:44,726 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-09-08 01:35:44,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 01:35:44,726 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-09-08 01:35:44,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 01:35:44,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:44,730 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:44,730 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:44,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:44,731 INFO L82 PathProgramCache]: Analyzing trace with hash -381156151, now seen corresponding path program 15 times [2019-09-08 01:35:44,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:44,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:44,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:44,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:44,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:44,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:44,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-09-08 01:35:44,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:46,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-08 01:35:46,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:46,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 01:35:46,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:46,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:46,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-08 01:35:46,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 01:35:46,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 01:35:46,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 01:35:46,069 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 19 states. [2019-09-08 01:35:46,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:46,150 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-09-08 01:35:46,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 01:35:46,151 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2019-09-08 01:35:46,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:46,152 INFO L225 Difference]: With dead ends: 64 [2019-09-08 01:35:46,152 INFO L226 Difference]: Without dead ends: 52 [2019-09-08 01:35:46,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-08 01:35:46,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-08 01:35:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-08 01:35:46,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-08 01:35:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-09-08 01:35:46,162 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-09-08 01:35:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:46,162 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-09-08 01:35:46,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 01:35:46,162 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-09-08 01:35:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 01:35:46,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:46,163 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:46,163 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:46,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:46,164 INFO L82 PathProgramCache]: Analyzing trace with hash 922238955, now seen corresponding path program 16 times [2019-09-08 01:35:46,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:46,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:46,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:46,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:46,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:46,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:46,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:46,411 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:35:46,448 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:35:46,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:46,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-08 01:35:46,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:46,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:46,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-08 01:35:46,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 01:35:46,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 01:35:46,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 01:35:46,489 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 20 states. [2019-09-08 01:35:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:46,559 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-09-08 01:35:46,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 01:35:46,560 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2019-09-08 01:35:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:46,561 INFO L225 Difference]: With dead ends: 66 [2019-09-08 01:35:46,561 INFO L226 Difference]: Without dead ends: 54 [2019-09-08 01:35:46,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-08 01:35:46,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-08 01:35:46,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-08 01:35:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-08 01:35:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-09-08 01:35:46,566 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-09-08 01:35:46,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:46,566 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-09-08 01:35:46,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 01:35:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-09-08 01:35:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-08 01:35:46,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:46,567 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:46,568 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:46,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:46,568 INFO L82 PathProgramCache]: Analyzing trace with hash -645514611, now seen corresponding path program 17 times [2019-09-08 01:35:46,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:46,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:46,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:46,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:46,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:46,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:46,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:46,826 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:35:48,362 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-09-08 01:35:48,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:48,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 01:35:48,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:35:48,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:48,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-08 01:35:48,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 01:35:48,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 01:35:48,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:35:48,403 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 21 states. [2019-09-08 01:35:48,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:48,474 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-09-08 01:35:48,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 01:35:48,478 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2019-09-08 01:35:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:48,478 INFO L225 Difference]: With dead ends: 68 [2019-09-08 01:35:48,478 INFO L226 Difference]: Without dead ends: 56 [2019-09-08 01:35:48,479 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-08 01:35:48,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-09-08 01:35:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-09-08 01:35:48,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-08 01:35:48,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-09-08 01:35:48,483 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-09-08 01:35:48,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:48,483 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-09-08 01:35:48,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 01:35:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-09-08 01:35:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 01:35:48,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:48,484 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:48,485 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:48,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:48,485 INFO L82 PathProgramCache]: Analyzing trace with hash 276829359, now seen corresponding path program 18 times [2019-09-08 01:35:48,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:48,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:48,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:48,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:48,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:48,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:48,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:48,719 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-08 01:35:52,963 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-08 01:35:52,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:52,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-08 01:35:52,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:53,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:53,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-08 01:35:53,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 01:35:53,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 01:35:53,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:35:53,005 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 22 states. [2019-09-08 01:35:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:53,091 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-09-08 01:35:53,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 01:35:53,091 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2019-09-08 01:35:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:53,092 INFO L225 Difference]: With dead ends: 70 [2019-09-08 01:35:53,092 INFO L226 Difference]: Without dead ends: 58 [2019-09-08 01:35:53,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-08 01:35:53,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-08 01:35:53,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-09-08 01:35:53,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-09-08 01:35:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-09-08 01:35:53,098 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-09-08 01:35:53,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:53,100 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-09-08 01:35:53,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 01:35:53,100 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-09-08 01:35:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 01:35:53,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:53,101 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:53,101 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:53,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:53,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1886121553, now seen corresponding path program 19 times [2019-09-08 01:35:53,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:53,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:53,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:53,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:53,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:53,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:53,431 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:35:53,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:53,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 01:35:53,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:53,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:53,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-08 01:35:53,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 01:35:53,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 01:35:53,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 01:35:53,520 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 23 states. [2019-09-08 01:35:53,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:53,604 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-09-08 01:35:53,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 01:35:53,604 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2019-09-08 01:35:53,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:53,605 INFO L225 Difference]: With dead ends: 71 [2019-09-08 01:35:53,605 INFO L226 Difference]: Without dead ends: 59 [2019-09-08 01:35:53,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-08 01:35:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-08 01:35:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-09-08 01:35:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-08 01:35:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-09-08 01:35:53,613 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-09-08 01:35:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:53,613 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-09-08 01:35:53,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 01:35:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-09-08 01:35:53,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 01:35:53,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:53,616 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:53,616 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:53,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:53,617 INFO L82 PathProgramCache]: Analyzing trace with hash -2067273869, now seen corresponding path program 20 times [2019-09-08 01:35:53,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:53,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:53,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:53,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:53,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:35:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 01:35:53,817 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-08 01:35:53,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 01:35:53 BoogieIcfgContainer [2019-09-08 01:35:53,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 01:35:53,899 INFO L168 Benchmark]: Toolchain (without parser) took 16073.23 ms. Allocated memory was 133.7 MB in the beginning and 328.2 MB in the end (delta: 194.5 MB). Free memory was 89.7 MB in the beginning and 280.1 MB in the end (delta: -190.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 7.1 GB. [2019-09-08 01:35:53,900 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 107.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 01:35:53,901 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.61 ms. Allocated memory is still 133.7 MB. Free memory was 89.5 MB in the beginning and 78.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-09-08 01:35:53,902 INFO L168 Benchmark]: Boogie Preprocessor took 148.71 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 78.8 MB in the beginning and 176.7 MB in the end (delta: -97.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2019-09-08 01:35:53,902 INFO L168 Benchmark]: RCFGBuilder took 350.56 ms. Allocated memory is still 200.8 MB. Free memory was 176.7 MB in the beginning and 161.6 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2019-09-08 01:35:53,903 INFO L168 Benchmark]: TraceAbstraction took 15225.39 ms. Allocated memory was 200.8 MB in the beginning and 328.2 MB in the end (delta: 127.4 MB). Free memory was 161.6 MB in the beginning and 280.1 MB in the end (delta: -118.5 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. [2019-09-08 01:35:53,907 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 108.1 MB in the beginning and 107.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 343.61 ms. Allocated memory is still 133.7 MB. Free memory was 89.5 MB in the beginning and 78.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.71 ms. Allocated memory was 133.7 MB in the beginning and 200.8 MB in the end (delta: 67.1 MB). Free memory was 78.8 MB in the beginning and 176.7 MB in the end (delta: -97.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 350.56 ms. Allocated memory is still 200.8 MB. Free memory was 176.7 MB in the beginning and 161.6 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15225.39 ms. Allocated memory was 200.8 MB in the beginning and 328.2 MB in the end (delta: 127.4 MB). Free memory was 161.6 MB in the beginning and 280.1 MB in the end (delta: -118.5 MB). Peak memory consumption was 8.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] struct dummy ad1[20], *ad2; [L16] int i, j, *pa; [L17] j=0 VAL [ad1={1:0}, j=0] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=1] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=2] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=3] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=4] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=5] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=6] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=7] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=8] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=9] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=10] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=11] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=12] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=13] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=14] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=15] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=16] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=17] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=18] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=19] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={1:0}, j=20] [L17] COND FALSE !(j<20) VAL [ad1={1:0}, j=20] [L21] i = __VERIFIER_nondet_int() [L22] COND TRUE i >= 0 && i < 10 [L23] ad2 = ad1 [L24] ad1[i].a = i [L25] pa = &ad1[i].a [L26] EXPR ad2[i].a [L26] i = ad2[i].a + 10 [L27] EXPR \read(*pa) VAL [\read(*pa)=0, ad1={1:0}, ad2={1:0}, i=10, j=20, pa={1:0}] [L27] COND FALSE !(i < *pa) [L30] CALL, EXPR check(ad1, i) VAL [\old(b)=10, ad1={1:0}] [L10] EXPR ad1[b].a [L10] return ad1[b].a == b; [L30] RET, EXPR check(ad1, i) VAL [ad1={1:0}, ad2={1:0}, check(ad1, i)=0, i=10, j=20, pa={1:0}] [L30] COND TRUE !check(ad1, i) [L37] __VERIFIER_error() VAL [ad1={1:0}, ad2={1:0}, i=10, j=20, pa={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 15.1s OverallTime, 22 OverallIterations, 20 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 407 SDtfs, 210 SDslu, 2720 SDs, 0 SdLazy, 643 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 955 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=21, 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.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 19 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 9.0s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1537 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 1439 ConstructedInterpolants, 0 QuantifiedInterpolants, 125333 SizeOfPredicates, 19 NumberOfNonLiveVariables, 3078 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 0/4940 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...