java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-programs/copysome1_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 01:25:50,674 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 01:25:50,675 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 01:25:50,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 01:25:50,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 01:25:50,688 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 01:25:50,688 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 01:25:50,690 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 01:25:50,691 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 01:25:50,691 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 01:25:50,692 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 01:25:50,692 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 01:25:50,693 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 01:25:50,693 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 01:25:50,694 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 01:25:50,695 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 01:25:50,696 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 01:25:50,697 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 01:25:50,699 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 01:25:50,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 01:25:50,704 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 01:25:50,704 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 01:25:50,704 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 01:25:50,705 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 01:25:50,705 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 01:25:50,706 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 01:25:50,706 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 01:25:50,706 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 01:25:50,707 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 01:25:50,707 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 01:25:50,707 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 01:25:50,707 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 01:25:50,712 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 01:25:50,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 01:25:50,712 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 01:25:50,712 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 01:25:50,713 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 01:25:50,713 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 01:25:50,713 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 01:25:50,713 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 01:25:50,713 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 01:25:50,713 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 01:25:50,713 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 01:25:50,713 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 01:25:50,713 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 01:25:50,713 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 01:25:50,714 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 01:25:50,714 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 01:25:50,714 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 01:25:50,714 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 01:25:50,714 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 01:25:50,714 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 01:25:50,714 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 01:25:50,714 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 01:25:50,714 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 01:25:50,714 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:25:50,714 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 01:25:50,715 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 01:25:50,715 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 01:25:50,715 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 01:25:50,715 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 01:25:50,715 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 01:25:50,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 01:25:50,715 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 01:25:50,715 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 01:25:50,715 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 01:25:50,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 01:25:50,741 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 01:25:50,743 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 01:25:50,744 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 01:25:50,744 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 01:25:50,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-programs/copysome1_true-unreach-call.i [2018-01-30 01:25:50,806 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 01:25:50,807 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 01:25:50,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 01:25:50,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 01:25:50,811 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 01:25:50,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:25:50" (1/1) ... [2018-01-30 01:25:50,813 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395107c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:25:50, skipping insertion in model container [2018-01-30 01:25:50,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 01:25:50" (1/1) ... [2018-01-30 01:25:50,823 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:25:50,831 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 01:25:50,899 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:25:50,907 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 01:25:50,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:25:50 WrapperNode [2018-01-30 01:25:50,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 01:25:50,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 01:25:50,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 01:25:50,911 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 01:25:50,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:25:50" (1/1) ... [2018-01-30 01:25:50,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:25:50" (1/1) ... [2018-01-30 01:25:50,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:25:50" (1/1) ... [2018-01-30 01:25:50,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:25:50" (1/1) ... [2018-01-30 01:25:50,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:25:50" (1/1) ... [2018-01-30 01:25:50,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:25:50" (1/1) ... [2018-01-30 01:25:50,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:25:50" (1/1) ... [2018-01-30 01:25:50,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 01:25:50,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 01:25:50,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 01:25:50,928 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 01:25:50,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:25:50" (1/1) ... No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 01:25:50,968 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 01:25:50,968 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 01:25:50,969 INFO L136 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-01-30 01:25:50,969 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 01:25:50,969 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 01:25:50,969 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-01-30 01:25:50,969 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 01:25:50,969 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 01:25:50,969 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 01:25:50,969 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 01:25:51,293 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 01:25:51,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:25:51 BoogieIcfgContainer [2018-01-30 01:25:51,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 01:25:51,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 01:25:51,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 01:25:51,296 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 01:25:51,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 01:25:50" (1/3) ... [2018-01-30 01:25:51,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29528a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:25:51, skipping insertion in model container [2018-01-30 01:25:51,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 01:25:50" (2/3) ... [2018-01-30 01:25:51,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29528a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:25:51, skipping insertion in model container [2018-01-30 01:25:51,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:25:51" (3/3) ... [2018-01-30 01:25:51,298 INFO L107 eAbstractionObserver]: Analyzing ICFG copysome1_true-unreach-call.i [2018-01-30 01:25:51,303 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 01:25:51,307 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 01:25:51,331 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 01:25:51,331 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 01:25:51,331 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 01:25:51,331 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 01:25:51,331 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 01:25:51,332 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 01:25:51,332 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 01:25:51,332 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 01:25:51,332 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 01:25:51,341 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-30 01:25:51,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 01:25:51,345 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:51,345 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:51,345 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:51,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1517895801, now seen corresponding path program 1 times [2018-01-30 01:25:51,349 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:51,349 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:51,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:51,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:25:51,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:51,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:25:51,416 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:25:51,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 01:25:51,417 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-30 01:25:51,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-30 01:25:51,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-30 01:25:51,425 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-30 01:25:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:51,438 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2018-01-30 01:25:51,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-30 01:25:51,439 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-01-30 01:25:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:51,445 INFO L225 Difference]: With dead ends: 77 [2018-01-30 01:25:51,446 INFO L226 Difference]: Without dead ends: 44 [2018-01-30 01:25:51,447 INFO L553 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 [2018-01-30 01:25:51,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-30 01:25:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-30 01:25:51,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-30 01:25:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-01-30 01:25:51,468 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 22 [2018-01-30 01:25:51,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:51,469 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-01-30 01:25:51,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-30 01:25:51,469 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-01-30 01:25:51,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 01:25:51,469 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:51,470 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:51,470 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:51,470 INFO L82 PathProgramCache]: Analyzing trace with hash 645086330, now seen corresponding path program 1 times [2018-01-30 01:25:51,470 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:51,470 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:51,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:51,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:25:51,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:51,480 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 01:25:51,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:25:51,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 01:25:51,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 01:25:51,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 01:25:51,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 01:25:51,526 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2018-01-30 01:25:51,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:51,597 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2018-01-30 01:25:51,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 01:25:51,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-01-30 01:25:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:51,598 INFO L225 Difference]: With dead ends: 83 [2018-01-30 01:25:51,598 INFO L226 Difference]: Without dead ends: 60 [2018-01-30 01:25:51,599 INFO L553 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 [2018-01-30 01:25:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-30 01:25:51,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2018-01-30 01:25:51,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-30 01:25:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-01-30 01:25:51,602 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 24 [2018-01-30 01:25:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:51,602 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-01-30 01:25:51,602 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 01:25:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-01-30 01:25:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-30 01:25:51,603 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:51,603 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:51,603 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:51,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1022783763, now seen corresponding path program 1 times [2018-01-30 01:25:51,603 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:51,604 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:51,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:51,604 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:25:51,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:51,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 01:25:51,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:25:51,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:25:51,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:25:51,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:25:51,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:25:51,716 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 4 states. [2018-01-30 01:25:51,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:51,959 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-01-30 01:25:51,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:25:51,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-01-30 01:25:51,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:51,960 INFO L225 Difference]: With dead ends: 82 [2018-01-30 01:25:51,960 INFO L226 Difference]: Without dead ends: 60 [2018-01-30 01:25:51,960 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:25:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-30 01:25:51,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2018-01-30 01:25:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-30 01:25:51,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-01-30 01:25:51,964 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 41 [2018-01-30 01:25:51,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:51,964 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-01-30 01:25:51,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:25:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-01-30 01:25:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-30 01:25:51,965 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:51,965 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:51,965 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:51,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1299413867, now seen corresponding path program 1 times [2018-01-30 01:25:51,965 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:51,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:51,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:51,966 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:25:51,966 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:51,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 01:25:52,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:25:52,047 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:25:52,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:25:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:52,086 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:25:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 01:25:52,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:25:52,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-30 01:25:52,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:25:52,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:25:52,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:25:52,116 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 5 states. [2018-01-30 01:25:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:52,240 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-01-30 01:25:52,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:25:52,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-01-30 01:25:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:52,241 INFO L225 Difference]: With dead ends: 97 [2018-01-30 01:25:52,241 INFO L226 Difference]: Without dead ends: 71 [2018-01-30 01:25:52,241 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:25:52,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-30 01:25:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2018-01-30 01:25:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-30 01:25:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-01-30 01:25:52,244 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 42 [2018-01-30 01:25:52,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:52,245 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-01-30 01:25:52,245 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:25:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-01-30 01:25:52,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-30 01:25:52,245 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:52,246 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:52,246 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:52,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1082992470, now seen corresponding path program 2 times [2018-01-30 01:25:52,246 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:52,246 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:52,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:52,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:25:52,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:52,255 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-30 01:25:52,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:25:52,315 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:25:52,332 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:25:52,338 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:25:52,348 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:25:52,357 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:25:52,358 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:25:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 01:25:52,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:25:52,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 8 [2018-01-30 01:25:52,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 01:25:52,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 01:25:52,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-30 01:25:52,438 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 8 states. [2018-01-30 01:25:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:52,735 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2018-01-30 01:25:52,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 01:25:52,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-01-30 01:25:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:52,737 INFO L225 Difference]: With dead ends: 115 [2018-01-30 01:25:52,737 INFO L226 Difference]: Without dead ends: 89 [2018-01-30 01:25:52,737 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-01-30 01:25:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-30 01:25:52,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2018-01-30 01:25:52,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-30 01:25:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-30 01:25:52,741 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 53 [2018-01-30 01:25:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:52,741 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-30 01:25:52,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 01:25:52,742 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-30 01:25:52,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-30 01:25:52,743 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:52,743 INFO L350 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:52,743 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:52,743 INFO L82 PathProgramCache]: Analyzing trace with hash 563143181, now seen corresponding path program 1 times [2018-01-30 01:25:52,743 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:52,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:52,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:52,744 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:25:52,744 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:52,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-01-30 01:25:52,820 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:25:52,820 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:25:52,824 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:25:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:52,847 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:25:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-30 01:25:52,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:25:52,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-01-30 01:25:52,937 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 01:25:52,937 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 01:25:52,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-01-30 01:25:52,938 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 13 states. [2018-01-30 01:25:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:53,312 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2018-01-30 01:25:53,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 01:25:53,312 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2018-01-30 01:25:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:53,313 INFO L225 Difference]: With dead ends: 137 [2018-01-30 01:25:53,313 INFO L226 Difference]: Without dead ends: 105 [2018-01-30 01:25:53,314 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2018-01-30 01:25:53,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-30 01:25:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2018-01-30 01:25:53,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-30 01:25:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-30 01:25:53,319 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 70 [2018-01-30 01:25:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:53,319 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-30 01:25:53,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 01:25:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-30 01:25:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-30 01:25:53,320 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:53,320 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:53,320 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:53,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1510486970, now seen corresponding path program 3 times [2018-01-30 01:25:53,320 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:53,320 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:53,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:53,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:25:53,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:53,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-01-30 01:25:53,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:25:53,388 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:25:53,397 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:25:53,405 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:25:53,413 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:25:53,424 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:25:53,433 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:25:53,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:25:53,442 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-01-30 01:25:53,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:25:53,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-01-30 01:25:53,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 01:25:53,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 01:25:53,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:25:53,459 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 7 states. [2018-01-30 01:25:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:53,551 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2018-01-30 01:25:53,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 01:25:53,556 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-01-30 01:25:53,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:53,557 INFO L225 Difference]: With dead ends: 126 [2018-01-30 01:25:53,557 INFO L226 Difference]: Without dead ends: 111 [2018-01-30 01:25:53,558 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-01-30 01:25:53,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-30 01:25:53,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2018-01-30 01:25:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-30 01:25:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2018-01-30 01:25:53,563 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 82 [2018-01-30 01:25:53,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:53,563 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2018-01-30 01:25:53,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 01:25:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2018-01-30 01:25:53,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-01-30 01:25:53,564 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:53,564 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:53,564 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:53,564 INFO L82 PathProgramCache]: Analyzing trace with hash 762582370, now seen corresponding path program 2 times [2018-01-30 01:25:53,564 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:53,564 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:53,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:53,565 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:25:53,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:53,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:53,697 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2018-01-30 01:25:53,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:25:53,697 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:25:53,702 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:25:53,707 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:25:53,716 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:25:53,717 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:25:53,719 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:25:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-01-30 01:25:53,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:25:53,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 15 [2018-01-30 01:25:53,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 01:25:53,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 01:25:53,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-30 01:25:53,972 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 15 states. [2018-01-30 01:25:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:54,246 INFO L93 Difference]: Finished difference Result 155 states and 167 transitions. [2018-01-30 01:25:54,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 01:25:54,246 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 88 [2018-01-30 01:25:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:54,247 INFO L225 Difference]: With dead ends: 155 [2018-01-30 01:25:54,248 INFO L226 Difference]: Without dead ends: 116 [2018-01-30 01:25:54,248 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2018-01-30 01:25:54,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-30 01:25:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2018-01-30 01:25:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-30 01:25:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-30 01:25:54,252 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 88 [2018-01-30 01:25:54,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:54,253 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-30 01:25:54,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 01:25:54,253 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-30 01:25:54,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-01-30 01:25:54,254 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:54,254 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:54,254 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:54,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1784184981, now seen corresponding path program 4 times [2018-01-30 01:25:54,254 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:54,254 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:54,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:54,255 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:25:54,255 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:54,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-30 01:25:54,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:25:54,547 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:25:54,555 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:25:54,569 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:25:54,571 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:25:54,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 01:25:54,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:25:54,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:25:54,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 01:25:54,619 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:25:54,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 01:25:54,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:25:54,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:25:54,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 01:25:54,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:25:54,663 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:25:54,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 01:25:54,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:25:54,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:25:54,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-01-30 01:25:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-01-30 01:25:54,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:25:54,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 20 [2018-01-30 01:25:54,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-30 01:25:54,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-30 01:25:54,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-01-30 01:25:54,901 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 20 states. [2018-01-30 01:25:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:55,574 INFO L93 Difference]: Finished difference Result 165 states and 180 transitions. [2018-01-30 01:25:55,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 01:25:55,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 100 [2018-01-30 01:25:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:55,576 INFO L225 Difference]: With dead ends: 165 [2018-01-30 01:25:55,576 INFO L226 Difference]: Without dead ends: 150 [2018-01-30 01:25:55,576 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=1243, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 01:25:55,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-30 01:25:55,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2018-01-30 01:25:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-30 01:25:55,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2018-01-30 01:25:55,588 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 100 [2018-01-30 01:25:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:55,588 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2018-01-30 01:25:55,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-30 01:25:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2018-01-30 01:25:55,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-01-30 01:25:55,595 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:55,595 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:55,595 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:55,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1668855275, now seen corresponding path program 1 times [2018-01-30 01:25:55,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:55,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:55,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:55,596 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:25:55,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:55,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:55,673 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-01-30 01:25:55,674 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:25:55,674 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 01:25:55,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 01:25:55,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 01:25:55,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 01:25:55,674 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 4 states. [2018-01-30 01:25:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:55,714 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2018-01-30 01:25:55,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 01:25:55,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-01-30 01:25:55,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:55,715 INFO L225 Difference]: With dead ends: 136 [2018-01-30 01:25:55,715 INFO L226 Difference]: Without dead ends: 123 [2018-01-30 01:25:55,715 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:25:55,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-30 01:25:55,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-01-30 01:25:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-30 01:25:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2018-01-30 01:25:55,720 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 112 [2018-01-30 01:25:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:55,720 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2018-01-30 01:25:55,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 01:25:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2018-01-30 01:25:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-01-30 01:25:55,721 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:55,721 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:55,721 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:55,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1047024108, now seen corresponding path program 1 times [2018-01-30 01:25:55,721 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:55,721 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:55,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:55,722 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:25:55,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:55,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-01-30 01:25:55,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:25:55,782 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:25:55,787 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:25:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:55,824 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:25:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-01-30 01:25:56,167 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:25:56,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 19 [2018-01-30 01:25:56,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 01:25:56,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 01:25:56,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2018-01-30 01:25:56,168 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand 19 states. [2018-01-30 01:25:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:56,520 INFO L93 Difference]: Finished difference Result 210 states and 225 transitions. [2018-01-30 01:25:56,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-30 01:25:56,520 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 117 [2018-01-30 01:25:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:56,522 INFO L225 Difference]: With dead ends: 210 [2018-01-30 01:25:56,523 INFO L226 Difference]: Without dead ends: 156 [2018-01-30 01:25:56,523 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=492, Invalid=1314, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 01:25:56,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-01-30 01:25:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2018-01-30 01:25:56,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-30 01:25:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 138 transitions. [2018-01-30 01:25:56,528 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 138 transitions. Word has length 117 [2018-01-30 01:25:56,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:56,528 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 138 transitions. [2018-01-30 01:25:56,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 01:25:56,528 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 138 transitions. [2018-01-30 01:25:56,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-01-30 01:25:56,529 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:56,529 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:56,529 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:56,529 INFO L82 PathProgramCache]: Analyzing trace with hash -954613201, now seen corresponding path program 1 times [2018-01-30 01:25:56,529 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:56,529 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:56,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:56,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:25:56,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:56,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:56,668 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 2 proven. 177 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-30 01:25:56,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:25:56,668 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:25:56,673 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:25:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:56,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:25:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-30 01:25:56,719 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:25:56,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-01-30 01:25:56,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 01:25:56,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 01:25:56,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-01-30 01:25:56,720 INFO L87 Difference]: Start difference. First operand 132 states and 138 transitions. Second operand 15 states. [2018-01-30 01:25:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:56,973 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2018-01-30 01:25:56,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-30 01:25:56,973 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 129 [2018-01-30 01:25:56,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:56,974 INFO L225 Difference]: With dead ends: 205 [2018-01-30 01:25:56,974 INFO L226 Difference]: Without dead ends: 151 [2018-01-30 01:25:56,975 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-01-30 01:25:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-01-30 01:25:56,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2018-01-30 01:25:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-30 01:25:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2018-01-30 01:25:56,979 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 129 [2018-01-30 01:25:56,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:56,980 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2018-01-30 01:25:56,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 01:25:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2018-01-30 01:25:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-01-30 01:25:56,981 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:56,981 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:56,981 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:56,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1144987214, now seen corresponding path program 2 times [2018-01-30 01:25:56,981 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:56,982 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:56,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:56,982 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:25:56,982 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:56,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:57,142 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 2 proven. 245 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-01-30 01:25:57,142 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:25:57,142 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:25:57,148 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:25:57,154 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:25:57,161 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:25:57,163 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:25:57,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:25:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-01-30 01:25:57,201 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:25:57,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-01-30 01:25:57,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 01:25:57,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 01:25:57,202 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-01-30 01:25:57,202 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand 17 states. [2018-01-30 01:25:57,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:57,505 INFO L93 Difference]: Finished difference Result 216 states and 228 transitions. [2018-01-30 01:25:57,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 01:25:57,515 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 140 [2018-01-30 01:25:57,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:57,516 INFO L225 Difference]: With dead ends: 216 [2018-01-30 01:25:57,516 INFO L226 Difference]: Without dead ends: 162 [2018-01-30 01:25:57,517 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-01-30 01:25:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-30 01:25:57,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 154. [2018-01-30 01:25:57,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-30 01:25:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 160 transitions. [2018-01-30 01:25:57,524 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 160 transitions. Word has length 140 [2018-01-30 01:25:57,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:57,524 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 160 transitions. [2018-01-30 01:25:57,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 01:25:57,524 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2018-01-30 01:25:57,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-01-30 01:25:57,525 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:57,525 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:57,525 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:57,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1407928527, now seen corresponding path program 3 times [2018-01-30 01:25:57,525 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:57,525 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:57,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:57,526 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:25:57,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:57,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 2 proven. 50 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2018-01-30 01:25:57,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:25:57,693 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:25:57,698 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:25:57,705 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:25:57,708 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:25:57,723 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:25:57,730 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:25:57,733 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:25:57,733 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:25:57,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:25:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-01-30 01:25:57,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:25:57,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-01-30 01:25:57,776 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 01:25:57,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 01:25:57,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 01:25:57,776 INFO L87 Difference]: Start difference. First operand 154 states and 160 transitions. Second operand 11 states. [2018-01-30 01:25:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:57,926 INFO L93 Difference]: Finished difference Result 223 states and 237 transitions. [2018-01-30 01:25:57,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-30 01:25:57,926 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2018-01-30 01:25:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:57,927 INFO L225 Difference]: With dead ends: 223 [2018-01-30 01:25:57,927 INFO L226 Difference]: Without dead ends: 200 [2018-01-30 01:25:57,927 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-01-30 01:25:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-01-30 01:25:57,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 161. [2018-01-30 01:25:57,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-30 01:25:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 168 transitions. [2018-01-30 01:25:57,931 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 168 transitions. Word has length 151 [2018-01-30 01:25:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:57,932 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 168 transitions. [2018-01-30 01:25:57,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 01:25:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 168 transitions. [2018-01-30 01:25:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-01-30 01:25:57,932 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:57,933 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:57,933 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:57,933 INFO L82 PathProgramCache]: Analyzing trace with hash 860955511, now seen corresponding path program 2 times [2018-01-30 01:25:57,933 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:57,933 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:57,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:57,933 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:25:57,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:57,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 2 proven. 63 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2018-01-30 01:25:58,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:25:58,274 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:25:58,293 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:25:58,298 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:25:58,310 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:25:58,311 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:25:58,313 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:25:58,453 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-01-30 01:25:58,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:25:58,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 27 [2018-01-30 01:25:58,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 01:25:58,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 01:25:58,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=542, Unknown=0, NotChecked=0, Total=702 [2018-01-30 01:25:58,471 INFO L87 Difference]: Start difference. First operand 161 states and 168 transitions. Second operand 27 states. [2018-01-30 01:25:59,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:25:59,014 INFO L93 Difference]: Finished difference Result 264 states and 282 transitions. [2018-01-30 01:25:59,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 01:25:59,015 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 157 [2018-01-30 01:25:59,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:25:59,015 INFO L225 Difference]: With dead ends: 264 [2018-01-30 01:25:59,016 INFO L226 Difference]: Without dead ends: 203 [2018-01-30 01:25:59,016 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1009, Invalid=2897, Unknown=0, NotChecked=0, Total=3906 [2018-01-30 01:25:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-30 01:25:59,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 172. [2018-01-30 01:25:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-01-30 01:25:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 179 transitions. [2018-01-30 01:25:59,029 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 179 transitions. Word has length 157 [2018-01-30 01:25:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:25:59,029 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 179 transitions. [2018-01-30 01:25:59,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 01:25:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 179 transitions. [2018-01-30 01:25:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-01-30 01:25:59,030 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:25:59,030 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:25:59,030 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:25:59,030 INFO L82 PathProgramCache]: Analyzing trace with hash 667142228, now seen corresponding path program 4 times [2018-01-30 01:25:59,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:25:59,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:25:59,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:59,031 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:25:59,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:25:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:25:59,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:25:59,278 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 2 proven. 80 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2018-01-30 01:25:59,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:25:59,278 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:25:59,282 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:25:59,296 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:25:59,298 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:25:59,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 01:25:59,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:25:59,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:25:59,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 01:25:59,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:25:59,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 01:25:59,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:25:59,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:25:59,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 01:25:59,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:25:59,421 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:25:59,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:25:59,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-01-30 01:25:59,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:25:59,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:25:59,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-30 01:25:59,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:25:59,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:25:59,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:25:59,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:25:59,518 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:25:59,519 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:25:59,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-01-30 01:25:59,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:25:59,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 01:25:59,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:42 [2018-01-30 01:26:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 20 proven. 66 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2018-01-30 01:26:01,837 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:26:01,838 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 23] total 34 [2018-01-30 01:26:01,838 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-30 01:26:01,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-30 01:26:01,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=982, Unknown=12, NotChecked=0, Total=1122 [2018-01-30 01:26:01,838 INFO L87 Difference]: Start difference. First operand 172 states and 179 transitions. Second operand 34 states. [2018-01-30 01:26:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:26:13,016 INFO L93 Difference]: Finished difference Result 349 states and 382 transitions. [2018-01-30 01:26:13,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-30 01:26:13,016 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 169 [2018-01-30 01:26:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:26:13,018 INFO L225 Difference]: With dead ends: 349 [2018-01-30 01:26:13,018 INFO L226 Difference]: Without dead ends: 326 [2018-01-30 01:26:13,019 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1659 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=661, Invalid=4968, Unknown=71, NotChecked=0, Total=5700 [2018-01-30 01:26:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-01-30 01:26:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 228. [2018-01-30 01:26:13,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-01-30 01:26:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 243 transitions. [2018-01-30 01:26:13,030 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 243 transitions. Word has length 169 [2018-01-30 01:26:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:26:13,030 INFO L432 AbstractCegarLoop]: Abstraction has 228 states and 243 transitions. [2018-01-30 01:26:13,030 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-30 01:26:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 243 transitions. [2018-01-30 01:26:13,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-01-30 01:26:13,031 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:26:13,031 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 6, 6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:26:13,031 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:26:13,031 INFO L82 PathProgramCache]: Analyzing trace with hash -909235220, now seen corresponding path program 3 times [2018-01-30 01:26:13,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:26:13,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:26:13,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:13,032 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:26:13,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:13,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:26:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 65 proven. 13 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2018-01-30 01:26:13,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:26:13,148 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:26:13,154 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:26:13,162 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:13,164 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:13,166 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:13,168 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:13,171 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:13,173 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:13,174 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:26:13,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:26:13,265 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2018-01-30 01:26:13,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:26:13,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2018-01-30 01:26:13,283 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-30 01:26:13,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-30 01:26:13,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-01-30 01:26:13,283 INFO L87 Difference]: Start difference. First operand 228 states and 243 transitions. Second operand 18 states. [2018-01-30 01:26:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:26:13,748 INFO L93 Difference]: Finished difference Result 316 states and 345 transitions. [2018-01-30 01:26:13,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-30 01:26:13,748 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 175 [2018-01-30 01:26:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:26:13,749 INFO L225 Difference]: With dead ends: 316 [2018-01-30 01:26:13,749 INFO L226 Difference]: Without dead ends: 250 [2018-01-30 01:26:13,750 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=466, Invalid=1094, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 01:26:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-01-30 01:26:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 242. [2018-01-30 01:26:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-01-30 01:26:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 258 transitions. [2018-01-30 01:26:13,757 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 258 transitions. Word has length 175 [2018-01-30 01:26:13,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:26:13,757 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 258 transitions. [2018-01-30 01:26:13,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-30 01:26:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 258 transitions. [2018-01-30 01:26:13,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-01-30 01:26:13,758 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:26:13,758 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:26:13,758 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:26:13,758 INFO L82 PathProgramCache]: Analyzing trace with hash 56037868, now seen corresponding path program 1 times [2018-01-30 01:26:13,758 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:26:13,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:26:13,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:13,759 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:26:13,759 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:13,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:26:13,839 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2018-01-30 01:26:13,839 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:26:13,839 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:26:13,844 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:26:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:13,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:26:13,994 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 414 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-01-30 01:26:14,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:26:14,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 21] total 25 [2018-01-30 01:26:14,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 01:26:14,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 01:26:14,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2018-01-30 01:26:14,011 INFO L87 Difference]: Start difference. First operand 242 states and 258 transitions. Second operand 25 states. [2018-01-30 01:26:14,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:26:14,462 INFO L93 Difference]: Finished difference Result 401 states and 435 transitions. [2018-01-30 01:26:14,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-30 01:26:14,462 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 189 [2018-01-30 01:26:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:26:14,463 INFO L225 Difference]: With dead ends: 401 [2018-01-30 01:26:14,463 INFO L226 Difference]: Without dead ends: 270 [2018-01-30 01:26:14,464 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=779, Invalid=2413, Unknown=0, NotChecked=0, Total=3192 [2018-01-30 01:26:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-01-30 01:26:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 259. [2018-01-30 01:26:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-01-30 01:26:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 274 transitions. [2018-01-30 01:26:14,473 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 274 transitions. Word has length 189 [2018-01-30 01:26:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:26:14,473 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 274 transitions. [2018-01-30 01:26:14,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 01:26:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 274 transitions. [2018-01-30 01:26:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-01-30 01:26:14,474 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:26:14,474 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:26:14,474 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:26:14,474 INFO L82 PathProgramCache]: Analyzing trace with hash -194363493, now seen corresponding path program 4 times [2018-01-30 01:26:14,474 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:26:14,474 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:26:14,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:14,475 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:26:14,475 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:14,482 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:26:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 2 proven. 175 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2018-01-30 01:26:14,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:26:14,600 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:26:14,613 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:26:14,629 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:26:14,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:26:14,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 01:26:14,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:26:14,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:26:14,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 01:26:14,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:14,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 01:26:14,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:26:14,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:26:14,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 01:26:14,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:14,909 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:14,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 30 [2018-01-30 01:26:14,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:26:14,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:26:14,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2018-01-30 01:26:14,977 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:14,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:14,978 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:14,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-01-30 01:26:14,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:26:14,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:26:14,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2018-01-30 01:26:15,057 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:15,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:15,058 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:15,059 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:15,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 52 [2018-01-30 01:26:15,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:26:15,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:26:15,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:39 [2018-01-30 01:26:15,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:15,177 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:15,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:15,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:15,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:15,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:15,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:15,181 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:15,182 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:15,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 79 [2018-01-30 01:26:15,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:26:15,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 01:26:15,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:51 [2018-01-30 01:26:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 726 backedges. 7 proven. 641 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 01:26:15,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:26:15,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 41] total 53 [2018-01-30 01:26:15,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-30 01:26:15,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-30 01:26:15,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2499, Unknown=0, NotChecked=0, Total=2756 [2018-01-30 01:26:15,861 INFO L87 Difference]: Start difference. First operand 259 states and 274 transitions. Second operand 53 states. [2018-01-30 01:26:23,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:26:23,640 INFO L93 Difference]: Finished difference Result 591 states and 659 transitions. [2018-01-30 01:26:23,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-01-30 01:26:23,640 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 200 [2018-01-30 01:26:23,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:26:23,641 INFO L225 Difference]: With dead ends: 591 [2018-01-30 01:26:23,642 INFO L226 Difference]: Without dead ends: 545 [2018-01-30 01:26:23,645 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8079 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2406, Invalid=20850, Unknown=0, NotChecked=0, Total=23256 [2018-01-30 01:26:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-01-30 01:26:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 301. [2018-01-30 01:26:23,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-01-30 01:26:23,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 322 transitions. [2018-01-30 01:26:23,667 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 322 transitions. Word has length 200 [2018-01-30 01:26:23,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:26:23,667 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 322 transitions. [2018-01-30 01:26:23,667 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-30 01:26:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 322 transitions. [2018-01-30 01:26:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-01-30 01:26:23,668 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:26:23,668 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:26:23,668 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:26:23,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1192325345, now seen corresponding path program 5 times [2018-01-30 01:26:23,668 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:26:23,668 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:26:23,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:23,669 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:26:23,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:23,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:26:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 839 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 644 trivial. 0 not checked. [2018-01-30 01:26:23,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 01:26:23,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 01:26:23,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 01:26:23,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 01:26:23,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-30 01:26:23,817 INFO L87 Difference]: Start difference. First operand 301 states and 322 transitions. Second operand 5 states. [2018-01-30 01:26:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:26:24,047 INFO L93 Difference]: Finished difference Result 438 states and 477 transitions. [2018-01-30 01:26:24,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 01:26:24,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2018-01-30 01:26:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:26:24,048 INFO L225 Difference]: With dead ends: 438 [2018-01-30 01:26:24,048 INFO L226 Difference]: Without dead ends: 312 [2018-01-30 01:26:24,048 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-30 01:26:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-01-30 01:26:24,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 290. [2018-01-30 01:26:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-01-30 01:26:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 303 transitions. [2018-01-30 01:26:24,060 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 303 transitions. Word has length 213 [2018-01-30 01:26:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:26:24,060 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 303 transitions. [2018-01-30 01:26:24,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 01:26:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 303 transitions. [2018-01-30 01:26:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-01-30 01:26:24,061 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:26:24,061 INFO L350 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:26:24,061 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:26:24,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1565396574, now seen corresponding path program 6 times [2018-01-30 01:26:24,061 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:26:24,061 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:26:24,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:24,062 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:26:24,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:24,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:26:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 181 proven. 54 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2018-01-30 01:26:24,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:26:24,291 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:26:24,295 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 01:26:24,302 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:24,303 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:24,306 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:24,308 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:24,310 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:24,313 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:24,318 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:24,321 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:24,324 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:24,327 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:24,331 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:24,332 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:26:24,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:26:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 101 proven. 272 refuted. 0 times theorem prover too weak. 491 trivial. 0 not checked. [2018-01-30 01:26:24,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:26:24,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 29 [2018-01-30 01:26:24,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 01:26:24,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 01:26:24,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2018-01-30 01:26:24,557 INFO L87 Difference]: Start difference. First operand 290 states and 303 transitions. Second operand 29 states. [2018-01-30 01:26:25,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:26:25,572 INFO L93 Difference]: Finished difference Result 379 states and 397 transitions. [2018-01-30 01:26:25,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-01-30 01:26:25,573 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 225 [2018-01-30 01:26:25,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:26:25,574 INFO L225 Difference]: With dead ends: 379 [2018-01-30 01:26:25,574 INFO L226 Difference]: Without dead ends: 291 [2018-01-30 01:26:25,575 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1223, Invalid=3333, Unknown=0, NotChecked=0, Total=4556 [2018-01-30 01:26:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-01-30 01:26:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 283. [2018-01-30 01:26:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-30 01:26:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 294 transitions. [2018-01-30 01:26:25,594 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 294 transitions. Word has length 225 [2018-01-30 01:26:25,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:26:25,595 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 294 transitions. [2018-01-30 01:26:25,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 01:26:25,595 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 294 transitions. [2018-01-30 01:26:25,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-01-30 01:26:25,596 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:26:25,596 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:26:25,596 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:26:25,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1708703946, now seen corresponding path program 5 times [2018-01-30 01:26:25,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:26:25,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:26:25,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:25,596 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:26:25,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:25,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:26:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 4 proven. 407 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2018-01-30 01:26:26,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:26:26,922 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:26:26,927 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-30 01:26:26,933 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:26,934 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:26,936 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:26,938 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:26,940 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:26,942 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:26,945 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:26,947 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:26,950 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:26,954 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:26,959 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:26,971 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:26,971 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:26:26,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:26:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2018-01-30 01:26:27,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:26:27,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-01-30 01:26:27,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 01:26:27,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 01:26:27,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-01-30 01:26:27,011 INFO L87 Difference]: Start difference. First operand 283 states and 294 transitions. Second operand 25 states. [2018-01-30 01:26:27,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:26:27,326 INFO L93 Difference]: Finished difference Result 489 states and 505 transitions. [2018-01-30 01:26:27,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 01:26:27,327 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 233 [2018-01-30 01:26:27,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:26:27,328 INFO L225 Difference]: With dead ends: 489 [2018-01-30 01:26:27,328 INFO L226 Difference]: Without dead ends: 455 [2018-01-30 01:26:27,329 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 01:26:27,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-01-30 01:26:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 290. [2018-01-30 01:26:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-01-30 01:26:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 302 transitions. [2018-01-30 01:26:27,340 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 302 transitions. Word has length 233 [2018-01-30 01:26:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:26:27,341 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 302 transitions. [2018-01-30 01:26:27,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 01:26:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 302 transitions. [2018-01-30 01:26:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-01-30 01:26:27,341 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:26:27,341 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:26:27,342 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:26:27,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1263664498, now seen corresponding path program 7 times [2018-01-30 01:26:27,342 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:26:27,342 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:26:27,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:27,342 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:26:27,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:27,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:26:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 259 proven. 85 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2018-01-30 01:26:28,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:26:28,047 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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 [2018-01-30 01:26:28,052 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:26:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:28,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:26:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 0 proven. 515 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2018-01-30 01:26:28,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:26:28,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 35 [2018-01-30 01:26:28,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-30 01:26:28,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-30 01:26:28,306 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=998, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 01:26:28,306 INFO L87 Difference]: Start difference. First operand 290 states and 302 transitions. Second operand 35 states. [2018-01-30 01:26:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:26:29,179 INFO L93 Difference]: Finished difference Result 477 states and 501 transitions. [2018-01-30 01:26:29,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-30 01:26:29,184 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 239 [2018-01-30 01:26:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:26:29,185 INFO L225 Difference]: With dead ends: 477 [2018-01-30 01:26:29,185 INFO L226 Difference]: Without dead ends: 309 [2018-01-30 01:26:29,185 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1409 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1294, Invalid=5186, Unknown=0, NotChecked=0, Total=6480 [2018-01-30 01:26:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-01-30 01:26:29,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 301. [2018-01-30 01:26:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-01-30 01:26:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 312 transitions. [2018-01-30 01:26:29,208 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 312 transitions. Word has length 239 [2018-01-30 01:26:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:26:29,208 INFO L432 AbstractCegarLoop]: Abstraction has 301 states and 312 transitions. [2018-01-30 01:26:29,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-30 01:26:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 312 transitions. [2018-01-30 01:26:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-01-30 01:26:29,209 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:26:29,209 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:26:29,209 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:26:29,209 INFO L82 PathProgramCache]: Analyzing trace with hash -2136131269, now seen corresponding path program 6 times [2018-01-30 01:26:29,209 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:26:29,209 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:26:29,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:29,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:26:29,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:29,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:26:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 4 proven. 627 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2018-01-30 01:26:29,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:26:29,775 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:26:29,780 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-30 01:26:29,786 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:29,791 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:29,794 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:29,796 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:29,798 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:29,801 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:29,803 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:29,806 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:29,809 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:29,812 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:29,816 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:29,820 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:29,825 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-30 01:26:29,826 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:26:29,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:26:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1136 backedges. 0 proven. 627 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2018-01-30 01:26:29,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:26:29,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-01-30 01:26:29,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-30 01:26:29,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-30 01:26:29,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-01-30 01:26:29,870 INFO L87 Difference]: Start difference. First operand 301 states and 312 transitions. Second operand 25 states. [2018-01-30 01:26:30,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:26:30,151 INFO L93 Difference]: Finished difference Result 488 states and 510 transitions. [2018-01-30 01:26:30,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-01-30 01:26:30,152 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 251 [2018-01-30 01:26:30,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:26:30,153 INFO L225 Difference]: With dead ends: 488 [2018-01-30 01:26:30,153 INFO L226 Difference]: Without dead ends: 320 [2018-01-30 01:26:30,154 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-01-30 01:26:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-01-30 01:26:30,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 312. [2018-01-30 01:26:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-01-30 01:26:30,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 323 transitions. [2018-01-30 01:26:30,165 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 323 transitions. Word has length 251 [2018-01-30 01:26:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:26:30,165 INFO L432 AbstractCegarLoop]: Abstraction has 312 states and 323 transitions. [2018-01-30 01:26:30,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-30 01:26:30,165 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 323 transitions. [2018-01-30 01:26:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-01-30 01:26:30,166 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:26:30,166 INFO L350 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:26:30,166 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:26:30,166 INFO L82 PathProgramCache]: Analyzing trace with hash -964630374, now seen corresponding path program 7 times [2018-01-30 01:26:30,167 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:26:30,167 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:26:30,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:30,167 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:26:30,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:30,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:26:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 4 proven. 750 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2018-01-30 01:26:30,812 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:26:30,812 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:26:30,816 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:26:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:30,848 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:26:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 0 proven. 750 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2018-01-30 01:26:30,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:26:30,898 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-01-30 01:26:30,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-30 01:26:30,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-30 01:26:30,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-01-30 01:26:30,898 INFO L87 Difference]: Start difference. First operand 312 states and 323 transitions. Second operand 27 states. [2018-01-30 01:26:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:26:31,275 INFO L93 Difference]: Finished difference Result 499 states and 521 transitions. [2018-01-30 01:26:31,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-30 01:26:31,277 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 262 [2018-01-30 01:26:31,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:26:31,278 INFO L225 Difference]: With dead ends: 499 [2018-01-30 01:26:31,278 INFO L226 Difference]: Without dead ends: 331 [2018-01-30 01:26:31,279 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-01-30 01:26:31,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-01-30 01:26:31,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 323. [2018-01-30 01:26:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-01-30 01:26:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 334 transitions. [2018-01-30 01:26:31,290 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 334 transitions. Word has length 262 [2018-01-30 01:26:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:26:31,291 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 334 transitions. [2018-01-30 01:26:31,291 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-30 01:26:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 334 transitions. [2018-01-30 01:26:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-01-30 01:26:31,291 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:26:31,292 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:26:31,292 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:26:31,292 INFO L82 PathProgramCache]: Analyzing trace with hash -104450085, now seen corresponding path program 8 times [2018-01-30 01:26:31,292 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:26:31,292 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:26:31,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:31,292 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 01:26:31,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:31,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:26:31,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 4 proven. 884 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2018-01-30 01:26:31,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:26:31,698 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:26:31,703 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:26:31,711 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:31,733 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:31,736 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:26:31,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:26:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2018-01-30 01:26:31,799 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:26:31,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-01-30 01:26:31,800 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-30 01:26:31,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-30 01:26:31,800 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-01-30 01:26:31,800 INFO L87 Difference]: Start difference. First operand 323 states and 334 transitions. Second operand 29 states. [2018-01-30 01:26:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:26:32,183 INFO L93 Difference]: Finished difference Result 510 states and 532 transitions. [2018-01-30 01:26:32,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-30 01:26:32,189 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 273 [2018-01-30 01:26:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:26:32,190 INFO L225 Difference]: With dead ends: 510 [2018-01-30 01:26:32,190 INFO L226 Difference]: Without dead ends: 342 [2018-01-30 01:26:32,190 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-01-30 01:26:32,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-01-30 01:26:32,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 334. [2018-01-30 01:26:32,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-01-30 01:26:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 345 transitions. [2018-01-30 01:26:32,202 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 345 transitions. Word has length 273 [2018-01-30 01:26:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:26:32,203 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 345 transitions. [2018-01-30 01:26:32,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-30 01:26:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 345 transitions. [2018-01-30 01:26:32,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-01-30 01:26:32,203 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:26:32,204 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 12, 12, 12, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:26:32,204 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:26:32,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1065649658, now seen corresponding path program 9 times [2018-01-30 01:26:32,204 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:26:32,204 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:26:32,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:32,204 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:26:32,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:32,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:26:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 4 proven. 1029 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2018-01-30 01:26:32,651 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:26:32,651 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:26:32,656 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:26:32,663 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:32,666 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:32,668 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:32,671 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:32,673 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:32,676 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:32,679 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:32,682 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:32,686 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:32,690 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:32,695 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:32,702 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:32,708 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:32,709 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:26:32,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:26:33,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1538 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 1052 trivial. 0 not checked. [2018-01-30 01:26:33,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:26:33,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 43 [2018-01-30 01:26:33,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-01-30 01:26:33,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-01-30 01:26:33,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=1461, Unknown=0, NotChecked=0, Total=1806 [2018-01-30 01:26:33,948 INFO L87 Difference]: Start difference. First operand 334 states and 345 transitions. Second operand 43 states. [2018-01-30 01:26:34,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:26:34,644 INFO L93 Difference]: Finished difference Result 693 states and 718 transitions. [2018-01-30 01:26:34,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-01-30 01:26:34,644 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 284 [2018-01-30 01:26:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:26:34,645 INFO L225 Difference]: With dead ends: 693 [2018-01-30 01:26:34,645 INFO L226 Difference]: Without dead ends: 525 [2018-01-30 01:26:34,646 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1832 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1909, Invalid=7021, Unknown=0, NotChecked=0, Total=8930 [2018-01-30 01:26:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-01-30 01:26:34,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 352. [2018-01-30 01:26:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-01-30 01:26:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 364 transitions. [2018-01-30 01:26:34,658 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 364 transitions. Word has length 284 [2018-01-30 01:26:34,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:26:34,658 INFO L432 AbstractCegarLoop]: Abstraction has 352 states and 364 transitions. [2018-01-30 01:26:34,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-01-30 01:26:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 364 transitions. [2018-01-30 01:26:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-01-30 01:26:34,659 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:26:34,659 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 13, 13, 13, 13, 12, 12, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:26:34,659 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:26:34,659 INFO L82 PathProgramCache]: Analyzing trace with hash 55966227, now seen corresponding path program 8 times [2018-01-30 01:26:34,659 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:26:34,660 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:26:34,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:34,660 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:26:34,660 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:34,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:26:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1768 backedges. 4 proven. 1185 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-01-30 01:26:35,189 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:26:35,190 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:26:35,195 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 01:26:35,203 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:35,218 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 01:26:35,221 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:26:35,223 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:26:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1768 backedges. 0 proven. 1185 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2018-01-30 01:26:35,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:26:35,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-01-30 01:26:35,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-30 01:26:35,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-30 01:26:35,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-01-30 01:26:35,284 INFO L87 Difference]: Start difference. First operand 352 states and 364 transitions. Second operand 33 states. [2018-01-30 01:26:35,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:26:35,690 INFO L93 Difference]: Finished difference Result 546 states and 570 transitions. [2018-01-30 01:26:35,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-01-30 01:26:35,690 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 301 [2018-01-30 01:26:35,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:26:35,691 INFO L225 Difference]: With dead ends: 546 [2018-01-30 01:26:35,691 INFO L226 Difference]: Without dead ends: 371 [2018-01-30 01:26:35,692 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-01-30 01:26:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-01-30 01:26:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2018-01-30 01:26:35,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-01-30 01:26:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 375 transitions. [2018-01-30 01:26:35,705 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 375 transitions. Word has length 301 [2018-01-30 01:26:35,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:26:35,705 INFO L432 AbstractCegarLoop]: Abstraction has 363 states and 375 transitions. [2018-01-30 01:26:35,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-30 01:26:35,705 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 375 transitions. [2018-01-30 01:26:35,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-01-30 01:26:35,706 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:26:35,706 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 14, 13, 13, 13, 13, 12, 12, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:26:35,706 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:26:35,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1201671246, now seen corresponding path program 9 times [2018-01-30 01:26:35,707 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:26:35,707 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:26:35,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:35,707 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:26:35,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:35,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:26:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1935 backedges. 4 proven. 1352 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2018-01-30 01:26:36,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:26:36,627 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:26:36,632 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 01:26:36,639 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:36,641 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:36,644 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:36,646 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:36,649 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:36,651 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:36,654 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:36,658 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:36,662 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 01:26:36,662 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:26:36,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:26:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1935 backedges. 0 proven. 437 refuted. 0 times theorem prover too weak. 1498 trivial. 0 not checked. [2018-01-30 01:26:36,964 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 01:26:36,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 18] total 51 [2018-01-30 01:26:36,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-30 01:26:36,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-30 01:26:36,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=2010, Unknown=0, NotChecked=0, Total=2550 [2018-01-30 01:26:36,965 INFO L87 Difference]: Start difference. First operand 363 states and 375 transitions. Second operand 51 states. [2018-01-30 01:26:38,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 01:26:38,155 INFO L93 Difference]: Finished difference Result 568 states and 593 transitions. [2018-01-30 01:26:38,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-01-30 01:26:38,155 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 312 [2018-01-30 01:26:38,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 01:26:38,156 INFO L225 Difference]: With dead ends: 568 [2018-01-30 01:26:38,156 INFO L226 Difference]: Without dead ends: 393 [2018-01-30 01:26:38,157 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3484 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3581, Invalid=11425, Unknown=0, NotChecked=0, Total=15006 [2018-01-30 01:26:38,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-01-30 01:26:38,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 381. [2018-01-30 01:26:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-01-30 01:26:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 393 transitions. [2018-01-30 01:26:38,177 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 393 transitions. Word has length 312 [2018-01-30 01:26:38,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 01:26:38,177 INFO L432 AbstractCegarLoop]: Abstraction has 381 states and 393 transitions. [2018-01-30 01:26:38,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-30 01:26:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 393 transitions. [2018-01-30 01:26:38,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-01-30 01:26:38,178 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 01:26:38,178 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 14, 13, 13, 13, 13, 13, 13, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 01:26:38,178 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0AssertViolation]=== [2018-01-30 01:26:38,178 INFO L82 PathProgramCache]: Analyzing trace with hash -189351499, now seen corresponding path program 10 times [2018-01-30 01:26:38,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 01:26:38,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 01:26:38,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:38,180 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 01:26:38,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 01:26:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 01:26:38,191 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 01:26:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2125 backedges. 4 proven. 1530 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2018-01-30 01:26:38,853 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 01:26:38,853 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 01:26:38,857 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-30 01:26:38,889 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 01:26:38,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 01:26:39,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 01:26:39,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:26:39,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:26:39,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-30 01:26:39,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:39,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-01-30 01:26:39,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:26:39,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 01:26:39,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-30 01:26:39,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:39,231 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:39,232 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:39,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-01-30 01:26:39,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:26:39,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-30 01:26:39,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-01-30 01:26:40,200 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,201 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,201 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,202 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,203 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-01-30 01:26:40,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:26:40,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-30 01:26:40,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:42 [2018-01-30 01:26:40,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,415 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,417 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,418 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,419 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,420 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2018-01-30 01:26:40,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:26:40,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-30 01:26:40,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:54 [2018-01-30 01:26:40,612 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,613 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,615 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,616 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,617 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,626 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,627 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:40,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 103 [2018-01-30 01:26:40,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:26:40,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-30 01:26:40,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:66 [2018-01-30 01:26:41,287 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,288 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,290 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,292 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,295 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,296 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,297 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,298 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,299 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,301 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,302 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:41,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 134 [2018-01-30 01:26:41,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:26:41,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-01-30 01:26:41,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:78 [2018-01-30 01:26:49,143 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,144 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,145 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,146 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,147 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,150 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,151 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,152 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,153 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,154 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,155 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,156 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,158 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,162 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 01:26:49,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 169 [2018-01-30 01:26:49,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 01:26:49,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-01-30 01:26:49,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:91, output treesize:90 Received shutdown request... [2018-01-30 01:27:07,483 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-30 01:27:07,483 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 01:27:07,486 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 01:27:07,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:27:07 BoogieIcfgContainer [2018-01-30 01:27:07,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 01:27:07,487 INFO L168 Benchmark]: Toolchain (without parser) took 76679.94 ms. Allocated memory was 149.4 MB in the beginning and 627.6 MB in the end (delta: 478.2 MB). Free memory was 115.7 MB in the beginning and 566.5 MB in the end (delta: -450.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 5.3 GB. [2018-01-30 01:27:07,487 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 149.4 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 01:27:07,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 102.46 ms. Allocated memory is still 149.4 MB. Free memory was 115.4 MB in the beginning and 107.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-01-30 01:27:07,488 INFO L168 Benchmark]: Boogie Preprocessor took 17.19 ms. Allocated memory is still 149.4 MB. Free memory was 107.3 MB in the beginning and 105.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. [2018-01-30 01:27:07,488 INFO L168 Benchmark]: RCFGBuilder took 366.22 ms. Allocated memory is still 149.4 MB. Free memory was 105.7 MB in the beginning and 92.3 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 5.3 GB. [2018-01-30 01:27:07,488 INFO L168 Benchmark]: TraceAbstraction took 76191.94 ms. Allocated memory was 149.4 MB in the beginning and 627.6 MB in the end (delta: 478.2 MB). Free memory was 92.0 MB in the beginning and 566.5 MB in the end (delta: -474.4 MB). Peak memory consumption was 3.7 MB. Max. memory is 5.3 GB. [2018-01-30 01:27:07,489 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 149.4 MB. Free memory is still 120.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 102.46 ms. Allocated memory is still 149.4 MB. Free memory was 115.4 MB in the beginning and 107.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 17.19 ms. Allocated memory is still 149.4 MB. Free memory was 107.3 MB in the beginning and 105.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 5.3 GB. * RCFGBuilder took 366.22 ms. Allocated memory is still 149.4 MB. Free memory was 105.7 MB in the beginning and 92.3 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 76191.94 ms. Allocated memory was 149.4 MB in the beginning and 627.6 MB in the end (delta: 478.2 MB). Free memory was 92.0 MB in the beginning and 566.5 MB in the end (delta: -474.4 MB). Peak memory consumption was 3.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was analyzing trace of length 325 with TraceHistMax 18, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 64 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 1 error locations. TIMEOUT Result, 76.1s OverallTime, 30 OverallIterations, 18 TraceHistogramMax, 29.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1200 SDtfs, 3273 SDslu, 14115 SDs, 0 SdLazy, 10375 SolverSat, 707 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5299 GetRequests, 4066 SyntacticMatches, 0 SemanticMatches, 1233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22871 ImplicationChecksByTransitivity, 29.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381occurred in iteration=29, 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.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 1011 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 8896 NumberOfCodeBlocks, 8532 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 8843 ConstructedInterpolants, 66 QuantifiedInterpolants, 4540746 SizeOfPredicates, 386 NumberOfNonLiveVariables, 5406 ConjunctsInSsa, 482 ConjunctsInUnsatCore, 53 InterpolantComputations, 5 PerfectInterpolantSequences, 18067/33199 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/copysome1_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_01-27-07-493.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/copysome1_true-unreach-call.i_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_01-27-07-493.csv Completed graceful shutdown