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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 22:51:55,000 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:51:55,002 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:51:55,012 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:51:55,012 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:51:55,013 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:51:55,014 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:51:55,015 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:51:55,016 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:51:55,017 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:51:55,018 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:51:55,018 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:51:55,019 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:51:55,020 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:51:55,020 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:51:55,022 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:51:55,023 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:51:55,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:51:55,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:51:55,026 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:51:55,028 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:51:55,028 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:51:55,028 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:51:55,029 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:51:55,030 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:51:55,031 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:51:55,031 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:51:55,032 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:51:55,032 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:51:55,032 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:51:55,032 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:51:55,033 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 22:51:55,042 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:51:55,042 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:51:55,043 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:51:55,043 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:51:55,044 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:51:55,044 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:51:55,044 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:51:55,044 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:51:55,044 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:51:55,044 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:51:55,044 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:51:55,045 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:51:55,045 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:51:55,045 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:51:55,045 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:51:55,045 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:51:55,045 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:51:55,046 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:51:55,046 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:51:55,046 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:51:55,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:51:55,046 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:51:55,046 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:51:55,046 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:51:55,047 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:51:55,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:51:55,084 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:51:55,088 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:51:55,089 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:51:55,089 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:51:55,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:51:55,221 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:51:55,222 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:51:55,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:51:55,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:51:55,228 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:51:55,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:51:55" (1/1) ... [2018-02-03 22:51:55,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@773d0511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:55, skipping insertion in model container [2018-02-03 22:51:55,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:51:55" (1/1) ... [2018-02-03 22:51:55,245 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:51:55,273 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:51:55,359 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:51:55,371 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:51:55,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:55 WrapperNode [2018-02-03 22:51:55,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:51:55,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:51:55,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:51:55,376 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:51:55,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:55" (1/1) ... [2018-02-03 22:51:55,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:55" (1/1) ... [2018-02-03 22:51:55,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:55" (1/1) ... [2018-02-03 22:51:55,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:55" (1/1) ... [2018-02-03 22:51:55,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:55" (1/1) ... [2018-02-03 22:51:55,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:55" (1/1) ... [2018-02-03 22:51:55,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:55" (1/1) ... [2018-02-03 22:51:55,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:51:55,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:51:55,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:51:55,400 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:51:55,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:55" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-03 22:51:55,435 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:51:55,435 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:51:55,435 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncat [2018-02-03 22:51:55,435 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:51:55,435 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:51:55,436 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:51:55,436 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:51:55,436 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:51:55,436 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:51:55,436 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:51:55,436 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncat [2018-02-03 22:51:55,436 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:51:55,436 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:51:55,436 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:51:55,583 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:51:55,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:51:55 BoogieIcfgContainer [2018-02-03 22:51:55,583 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:51:55,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:51:55,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:51:55,586 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:51:55,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:51:55" (1/3) ... [2018-02-03 22:51:55,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19490476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:51:55, skipping insertion in model container [2018-02-03 22:51:55,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:51:55" (2/3) ... [2018-02-03 22:51:55,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19490476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:51:55, skipping insertion in model container [2018-02-03 22:51:55,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:51:55" (3/3) ... [2018-02-03 22:51:55,588 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:51:55,595 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:51:55,599 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-03 22:51:55,634 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:51:55,634 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:51:55,634 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:51:55,634 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:51:55,634 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:51:55,634 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:51:55,634 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:51:55,634 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:51:55,635 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:51:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-02-03 22:51:55,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-02-03 22:51:55,651 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:55,651 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:55,652 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:51:55,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2055638365, now seen corresponding path program 1 times [2018-02-03 22:51:55,657 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:55,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:55,692 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:55,693 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:55,693 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:55,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:55,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:55,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 22:51:55,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 22:51:55,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 22:51:55,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:51:55,778 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-02-03 22:51:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:55,903 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-02-03 22:51:55,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 22:51:55,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-02-03 22:51:55,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:55,913 INFO L225 Difference]: With dead ends: 55 [2018-02-03 22:51:55,913 INFO L226 Difference]: Without dead ends: 51 [2018-02-03 22:51:55,915 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-03 22:51:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-03 22:51:55,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-03 22:51:55,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-03 22:51:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-02-03 22:51:55,944 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 11 [2018-02-03 22:51:55,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:55,944 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-02-03 22:51:55,944 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 22:51:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-02-03 22:51:55,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-03 22:51:55,945 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:55,945 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:55,945 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:51:55,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1872133330, now seen corresponding path program 1 times [2018-02-03 22:51:55,946 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:55,946 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:55,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:55,947 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:55,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:55,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:56,006 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:56,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:51:56,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:51:56,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:51:56,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:51:56,009 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-02-03 22:51:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:56,066 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-02-03 22:51:56,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:51:56,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-02-03 22:51:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:56,067 INFO L225 Difference]: With dead ends: 54 [2018-02-03 22:51:56,067 INFO L226 Difference]: Without dead ends: 51 [2018-02-03 22:51:56,067 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:51:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-03 22:51:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-03 22:51:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-03 22:51:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-03 22:51:56,071 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 15 [2018-02-03 22:51:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:56,072 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-03 22:51:56,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:51:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-03 22:51:56,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-03 22:51:56,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:56,072 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:56,073 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:51:56,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1192074960, now seen corresponding path program 1 times [2018-02-03 22:51:56,073 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:56,073 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:56,074 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:56,074 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:56,074 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:56,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:56,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:56,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:51:56,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:51:56,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:51:56,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:51:56,132 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-02-03 22:51:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:56,174 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-03 22:51:56,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:51:56,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-03 22:51:56,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:56,175 INFO L225 Difference]: With dead ends: 50 [2018-02-03 22:51:56,175 INFO L226 Difference]: Without dead ends: 50 [2018-02-03 22:51:56,175 INFO L554 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-02-03 22:51:56,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-03 22:51:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-03 22:51:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-03 22:51:56,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-02-03 22:51:56,177 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 15 [2018-02-03 22:51:56,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:56,178 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-02-03 22:51:56,178 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:51:56,178 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-02-03 22:51:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-03 22:51:56,178 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:56,178 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:56,178 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:51:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1192074959, now seen corresponding path program 1 times [2018-02-03 22:51:56,178 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:56,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:56,179 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:56,179 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:56,179 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:56,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:56,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:56,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:51:56,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:51:56,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:51:56,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:51:56,279 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 8 states. [2018-02-03 22:51:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:56,371 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-02-03 22:51:56,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:51:56,371 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-02-03 22:51:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:56,371 INFO L225 Difference]: With dead ends: 49 [2018-02-03 22:51:56,372 INFO L226 Difference]: Without dead ends: 49 [2018-02-03 22:51:56,372 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:51:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-03 22:51:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-03 22:51:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-03 22:51:56,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-02-03 22:51:56,374 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 15 [2018-02-03 22:51:56,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:56,374 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-02-03 22:51:56,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:51:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-02-03 22:51:56,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-03 22:51:56,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:56,375 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:56,375 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:51:56,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1700381909, now seen corresponding path program 1 times [2018-02-03 22:51:56,375 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:56,375 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:56,376 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:56,376 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:56,376 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:56,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:56,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:56,412 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:56,412 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:51:56,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:51:56,413 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:51:56,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:51:56,413 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2018-02-03 22:51:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:56,445 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-03 22:51:56,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:51:56,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-03 22:51:56,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:56,446 INFO L225 Difference]: With dead ends: 48 [2018-02-03 22:51:56,447 INFO L226 Difference]: Without dead ends: 48 [2018-02-03 22:51:56,447 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-03 22:51:56,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-03 22:51:56,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-03 22:51:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-03 22:51:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-02-03 22:51:56,450 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 16 [2018-02-03 22:51:56,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:56,450 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-02-03 22:51:56,451 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:51:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-02-03 22:51:56,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-03 22:51:56,451 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:56,451 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:56,451 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:51:56,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1700381910, now seen corresponding path program 1 times [2018-02-03 22:51:56,452 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:56,452 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:56,452 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:56,452 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:56,453 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:56,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:56,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:56,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:56,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:51:56,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:51:56,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:51:56,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:51:56,508 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-02-03 22:51:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:56,529 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-02-03 22:51:56,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:51:56,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-02-03 22:51:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:56,530 INFO L225 Difference]: With dead ends: 47 [2018-02-03 22:51:56,530 INFO L226 Difference]: Without dead ends: 47 [2018-02-03 22:51:56,530 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:51:56,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-03 22:51:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-03 22:51:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-03 22:51:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-02-03 22:51:56,532 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 16 [2018-02-03 22:51:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:56,534 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-02-03 22:51:56,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:51:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-02-03 22:51:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-03 22:51:56,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:56,534 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:56,535 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:51:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash -275307336, now seen corresponding path program 1 times [2018-02-03 22:51:56,535 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:56,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:56,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:56,535 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:56,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:56,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:56,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:56,570 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:51:56,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:51:56,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:51:56,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:51:56,571 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 6 states. [2018-02-03 22:51:56,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:56,624 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-02-03 22:51:56,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:51:56,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-03 22:51:56,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:56,626 INFO L225 Difference]: With dead ends: 47 [2018-02-03 22:51:56,626 INFO L226 Difference]: Without dead ends: 47 [2018-02-03 22:51:56,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:51:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-03 22:51:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-02-03 22:51:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-03 22:51:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-02-03 22:51:56,628 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 21 [2018-02-03 22:51:56,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:56,628 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-02-03 22:51:56,628 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:51:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-02-03 22:51:56,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-03 22:51:56,629 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:56,629 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:56,629 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:51:56,629 INFO L82 PathProgramCache]: Analyzing trace with hash -275307335, now seen corresponding path program 1 times [2018-02-03 22:51:56,629 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:56,629 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:56,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:56,630 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:56,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:56,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:56,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:56,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-03 22:51:56,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 22:51:56,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 22:51:56,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:51:56,727 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-02-03 22:51:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:56,871 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-02-03 22:51:56,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 22:51:56,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-03 22:51:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:56,871 INFO L225 Difference]: With dead ends: 57 [2018-02-03 22:51:56,871 INFO L226 Difference]: Without dead ends: 57 [2018-02-03 22:51:56,872 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-02-03 22:51:56,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-03 22:51:56,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-02-03 22:51:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-03 22:51:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-02-03 22:51:56,874 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 21 [2018-02-03 22:51:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:56,874 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-02-03 22:51:56,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 22:51:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-02-03 22:51:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:51:56,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:56,874 INFO L351 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-02-03 22:51:56,874 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:51:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1706718631, now seen corresponding path program 1 times [2018-02-03 22:51:56,875 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:56,875 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:56,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:56,876 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:56,876 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:56,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:56,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:56,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-03 22:51:56,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 22:51:56,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 22:51:56,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:51:56,924 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 7 states. [2018-02-03 22:51:56,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:56,998 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-02-03 22:51:56,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 22:51:56,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-03 22:51:56,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:56,999 INFO L225 Difference]: With dead ends: 54 [2018-02-03 22:51:56,999 INFO L226 Difference]: Without dead ends: 54 [2018-02-03 22:51:57,000 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:51:57,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-03 22:51:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-02-03 22:51:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-03 22:51:57,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-02-03 22:51:57,002 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 24 [2018-02-03 22:51:57,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:57,003 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-02-03 22:51:57,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 22:51:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-02-03 22:51:57,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:51:57,003 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:57,003 INFO L351 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-02-03 22:51:57,003 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:51:57,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1706718632, now seen corresponding path program 1 times [2018-02-03 22:51:57,004 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:57,004 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:57,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:57,005 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:57,005 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:57,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:57,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:57,093 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:51:57,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-03 22:51:57,093 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 22:51:57,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 22:51:57,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:51:57,093 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 10 states. [2018-02-03 22:51:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:57,208 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-02-03 22:51:57,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:51:57,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-02-03 22:51:57,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:57,209 INFO L225 Difference]: With dead ends: 56 [2018-02-03 22:51:57,209 INFO L226 Difference]: Without dead ends: 56 [2018-02-03 22:51:57,209 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-02-03 22:51:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-03 22:51:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-02-03 22:51:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-03 22:51:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-02-03 22:51:57,212 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 24 [2018-02-03 22:51:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:57,212 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-02-03 22:51:57,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 22:51:57,213 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-02-03 22:51:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:51:57,213 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:57,213 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:57,213 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:51:57,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1706720075, now seen corresponding path program 1 times [2018-02-03 22:51:57,214 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:57,214 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:57,214 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:57,216 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:57,217 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:57,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:57,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:57,341 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:51:57,349 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:57,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:57,429 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 6 treesize of output 5 [2018-02-03 22:51:57,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:57,436 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 6 treesize of output 5 [2018-02-03 22:51:57,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:57,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:57,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-03 22:51:57,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:57,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:57,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-03 22:51:57,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:57,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:57,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:57,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:51:57,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:57,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:57,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-02-03 22:51:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:57,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:57,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2018-02-03 22:51:57,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-03 22:51:57,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-03 22:51:57,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-02-03 22:51:57,656 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 24 states. [2018-02-03 22:51:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:51:58,114 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-02-03 22:51:58,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 22:51:58,114 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-02-03 22:51:58,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:51:58,115 INFO L225 Difference]: With dead ends: 72 [2018-02-03 22:51:58,115 INFO L226 Difference]: Without dead ends: 72 [2018-02-03 22:51:58,115 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=953, Unknown=0, NotChecked=0, Total=1122 [2018-02-03 22:51:58,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-03 22:51:58,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-02-03 22:51:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-03 22:51:58,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-02-03 22:51:58,119 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 24 [2018-02-03 22:51:58,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:51:58,120 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-02-03 22:51:58,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-03 22:51:58,120 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-02-03 22:51:58,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-03 22:51:58,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:51:58,121 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:51:58,121 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:51:58,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1074905977, now seen corresponding path program 2 times [2018-02-03 22:51:58,121 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:51:58,121 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:51:58,122 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:58,122 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:51:58,123 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:51:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:51:58,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:51:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:58,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:51:58,335 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:51:58,340 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:51:58,353 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:51:58,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:51:58,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:51:58,380 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 6 treesize of output 5 [2018-02-03 22:51:58,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:58,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:58,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-02-03 22:51:58,424 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:58,425 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:58,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:51:58,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:58,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:58,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-02-03 22:51:58,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-02-03 22:51:58,459 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 14 treesize of output 13 [2018-02-03 22:51:58,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:58,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:58,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:58,468 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-02-03 22:51:58,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-02-03 22:51:58,505 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 11 treesize of output 10 [2018-02-03 22:51:58,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:58,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:51:58,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-02-03 22:51:58,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:48 [2018-02-03 22:51:58,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-02-03 22:51:58,830 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:51:58,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 37 [2018-02-03 22:51:58,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:51:58,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-03 22:51:58,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:51:58,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:58,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:51:58,877 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:66, output treesize:43 [2018-02-03 22:51:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:51:58,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:51:58,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2018-02-03 22:51:58,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-03 22:51:58,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-03 22:51:58,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2018-02-03 22:51:58,943 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 28 states. [2018-02-03 22:51:59,532 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 80 DAG size of output 77 [2018-02-03 22:52:19,744 WARN L146 SmtUtils]: Spent 8123ms on a formula simplification. DAG size of input: 94 DAG size of output 91 [2018-02-03 22:52:26,066 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 79 DAG size of output 76 [2018-02-03 22:52:39,796 WARN L146 SmtUtils]: Spent 8146ms on a formula simplification. DAG size of input: 101 DAG size of output 89 [2018-02-03 22:52:57,372 WARN L146 SmtUtils]: Spent 8194ms on a formula simplification. DAG size of input: 90 DAG size of output 79 [2018-02-03 22:52:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:52:59,616 INFO L93 Difference]: Finished difference Result 105 states and 120 transitions. [2018-02-03 22:52:59,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-03 22:52:59,616 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-02-03 22:52:59,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:52:59,617 INFO L225 Difference]: With dead ends: 105 [2018-02-03 22:52:59,617 INFO L226 Difference]: Without dead ends: 105 [2018-02-03 22:52:59,618 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 39.6s TimeCoverageRelationStatistics Valid=420, Invalid=2654, Unknown=6, NotChecked=0, Total=3080 [2018-02-03 22:52:59,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-03 22:52:59,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 61. [2018-02-03 22:52:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-03 22:52:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2018-02-03 22:52:59,622 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 27 [2018-02-03 22:52:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:52:59,622 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2018-02-03 22:52:59,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-03 22:52:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2018-02-03 22:52:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:52:59,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:52:59,623 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:52:59,623 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:52:59,623 INFO L82 PathProgramCache]: Analyzing trace with hash 94248296, now seen corresponding path program 1 times [2018-02-03 22:52:59,623 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:52:59,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:52:59,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:59,624 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:52:59,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:52:59,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:52:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:59,670 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:52:59,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:52:59,671 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:52:59,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:52:59,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:52:59,671 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 5 states. [2018-02-03 22:52:59,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:52:59,702 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-02-03 22:52:59,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:52:59,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-03 22:52:59,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:52:59,704 INFO L225 Difference]: With dead ends: 86 [2018-02-03 22:52:59,704 INFO L226 Difference]: Without dead ends: 86 [2018-02-03 22:52:59,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:52:59,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-03 22:52:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2018-02-03 22:52:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-03 22:52:59,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-02-03 22:52:59,712 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 28 [2018-02-03 22:52:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:52:59,712 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-02-03 22:52:59,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:52:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-02-03 22:52:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:52:59,713 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:52:59,713 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:52:59,713 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:52:59,713 INFO L82 PathProgramCache]: Analyzing trace with hash -723400154, now seen corresponding path program 1 times [2018-02-03 22:52:59,714 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:52:59,714 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:52:59,714 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:59,714 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:52:59,714 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:52:59,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:52:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:59,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:52:59,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:52:59,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:52:59,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:52:59,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:52:59,797 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 6 states. [2018-02-03 22:52:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:52:59,881 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2018-02-03 22:52:59,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:52:59,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-02-03 22:52:59,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:52:59,882 INFO L225 Difference]: With dead ends: 71 [2018-02-03 22:52:59,882 INFO L226 Difference]: Without dead ends: 58 [2018-02-03 22:52:59,882 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:52:59,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-03 22:52:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-02-03 22:52:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-03 22:52:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-02-03 22:52:59,885 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 28 [2018-02-03 22:52:59,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:52:59,885 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-02-03 22:52:59,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:52:59,885 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-02-03 22:52:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 22:52:59,886 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:52:59,886 INFO L351 BasicCegarLoop]: trace histogram [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-02-03 22:52:59,886 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:52:59,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1208652779, now seen corresponding path program 1 times [2018-02-03 22:52:59,886 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:52:59,887 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:52:59,887 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:59,887 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:52:59,887 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:52:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:52:59,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:52:59,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:52:59,996 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:52:59,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:52:59,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-03 22:52:59,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-03 22:52:59,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:52:59,997 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 7 states. [2018-02-03 22:53:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:00,041 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-02-03 22:53:00,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-03 22:53:00,042 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-03 22:53:00,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:00,042 INFO L225 Difference]: With dead ends: 83 [2018-02-03 22:53:00,042 INFO L226 Difference]: Without dead ends: 77 [2018-02-03 22:53:00,043 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-03 22:53:00,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-02-03 22:53:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-02-03 22:53:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-03 22:53:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-02-03 22:53:00,045 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 30 [2018-02-03 22:53:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:00,045 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-02-03 22:53:00,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-03 22:53:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-02-03 22:53:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-03 22:53:00,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:00,046 INFO L351 BasicCegarLoop]: trace histogram [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-02-03 22:53:00,047 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:53:00,047 INFO L82 PathProgramCache]: Analyzing trace with hash -989798061, now seen corresponding path program 1 times [2018-02-03 22:53:00,047 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:00,047 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:00,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:00,048 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:00,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:00,059 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:00,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:00,185 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:53:00,185 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:53:00,190 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:00,209 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:53:00,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:53:00,215 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 11 treesize of output 10 [2018-02-03 22:53:00,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:00,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:00,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:53:00,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:53:00,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-03 22:53:00,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:53:00,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:53:00,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:53:00,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:53:00,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-03 22:53:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:00,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:53:00,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 18 [2018-02-03 22:53:00,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-03 22:53:00,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-03 22:53:00,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-02-03 22:53:00,411 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand 19 states. [2018-02-03 22:53:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:01,061 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2018-02-03 22:53:01,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 22:53:01,062 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-02-03 22:53:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:01,062 INFO L225 Difference]: With dead ends: 86 [2018-02-03 22:53:01,062 INFO L226 Difference]: Without dead ends: 86 [2018-02-03 22:53:01,062 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2018-02-03 22:53:01,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-03 22:53:01,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2018-02-03 22:53:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-02-03 22:53:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-02-03 22:53:01,064 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 30 [2018-02-03 22:53:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:01,064 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-02-03 22:53:01,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-03 22:53:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-02-03 22:53:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-03 22:53:01,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:01,072 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:01,072 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:53:01,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1959345908, now seen corresponding path program 1 times [2018-02-03 22:53:01,072 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:01,072 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:01,073 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:01,073 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:01,073 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:01,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:01,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:53:01,455 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:53:01,459 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:01,475 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:53:01,478 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 6 treesize of output 5 [2018-02-03 22:53:01,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:01,485 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 6 treesize of output 5 [2018-02-03 22:53:01,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:01,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:01,493 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-02-03 22:53:01,516 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:01,517 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 12 treesize of output 15 [2018-02-03 22:53:01,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:01,527 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:01,528 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:01,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:53:01,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:01,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:01,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-02-03 22:53:01,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-02-03 22:53:01,568 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 15 treesize of output 14 [2018-02-03 22:53:01,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:01,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:01,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:53:01,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-03 22:53:01,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-02-03 22:53:01,597 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 13 treesize of output 12 [2018-02-03 22:53:01,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:01,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:01,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-03 22:53:01,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2018-02-03 22:53:02,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-02-03 22:53:02,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-03 22:53:02,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:02,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-03 22:53:02,441 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:53:02,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:53:02,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:53:02,455 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:27 [2018-02-03 22:53:02,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:02,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:53:02,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 29 [2018-02-03 22:53:02,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-03 22:53:02,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-03 22:53:02,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2018-02-03 22:53:02,628 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 30 states. [2018-02-03 22:53:03,628 WARN L146 SmtUtils]: Spent 374ms on a formula simplification. DAG size of input: 57 DAG size of output 41 [2018-02-03 22:53:03,871 WARN L146 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 77 DAG size of output 51 [2018-02-03 22:53:04,242 WARN L146 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 80 DAG size of output 51 [2018-02-03 22:53:04,510 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 84 DAG size of output 61 [2018-02-03 22:53:05,442 WARN L146 SmtUtils]: Spent 299ms on a formula simplification. DAG size of input: 78 DAG size of output 58 [2018-02-03 22:53:05,743 WARN L146 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 85 DAG size of output 60 [2018-02-03 22:53:06,215 WARN L146 SmtUtils]: Spent 241ms on a formula simplification. DAG size of input: 74 DAG size of output 54 [2018-02-03 22:53:06,579 WARN L146 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 78 DAG size of output 55 [2018-02-03 22:53:07,065 WARN L146 SmtUtils]: Spent 421ms on a formula simplification. DAG size of input: 87 DAG size of output 60 [2018-02-03 22:53:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:07,364 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2018-02-03 22:53:07,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-03 22:53:07,364 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 35 [2018-02-03 22:53:07,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:07,364 INFO L225 Difference]: With dead ends: 89 [2018-02-03 22:53:07,364 INFO L226 Difference]: Without dead ends: 56 [2018-02-03 22:53:07,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=310, Invalid=1946, Unknown=0, NotChecked=0, Total=2256 [2018-02-03 22:53:07,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-03 22:53:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-03 22:53:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-03 22:53:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-02-03 22:53:07,367 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 35 [2018-02-03 22:53:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:07,367 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-02-03 22:53:07,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-03 22:53:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-02-03 22:53:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-03 22:53:07,368 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:07,368 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-03 22:53:07,368 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:53:07,368 INFO L82 PathProgramCache]: Analyzing trace with hash -608695935, now seen corresponding path program 1 times [2018-02-03 22:53:07,368 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:07,368 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:07,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:07,369 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:07,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:07,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:07,616 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:53:07,617 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:53:07,621 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:07,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:53:07,642 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 6 treesize of output 5 [2018-02-03 22:53:07,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:07,652 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 6 treesize of output 5 [2018-02-03 22:53:07,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:07,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:07,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-03 22:53:07,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:07,684 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:07,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:53:07,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:07,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:07,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-03 22:53:07,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:07,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:07,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-02-03 22:53:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:07,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:53:07,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32 [2018-02-03 22:53:07,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-03 22:53:07,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-03 22:53:07,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2018-02-03 22:53:07,888 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 33 states. [2018-02-03 22:53:08,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:08,330 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-02-03 22:53:08,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-03 22:53:08,330 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 35 [2018-02-03 22:53:08,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:08,331 INFO L225 Difference]: With dead ends: 74 [2018-02-03 22:53:08,331 INFO L226 Difference]: Without dead ends: 73 [2018-02-03 22:53:08,332 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=1763, Unknown=0, NotChecked=0, Total=1980 [2018-02-03 22:53:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-02-03 22:53:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2018-02-03 22:53:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-03 22:53:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2018-02-03 22:53:08,333 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 35 [2018-02-03 22:53:08,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:08,333 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2018-02-03 22:53:08,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-03 22:53:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2018-02-03 22:53:08,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-03 22:53:08,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:08,333 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:08,333 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:53:08,334 INFO L82 PathProgramCache]: Analyzing trace with hash -36117874, now seen corresponding path program 1 times [2018-02-03 22:53:08,334 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:08,334 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:08,334 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:08,334 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:08,334 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:08,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:08,872 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:08,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:53:08,872 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:53:08,877 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:08,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:53:08,896 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 6 treesize of output 5 [2018-02-03 22:53:08,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:08,903 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 6 treesize of output 5 [2018-02-03 22:53:08,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:08,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:08,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-02-03 22:53:08,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:08,951 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:08,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:53:08,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:08,958 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:08,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-03 22:53:08,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:08,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:08,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-03 22:53:09,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-03 22:53:09,018 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 16 treesize of output 15 [2018-02-03 22:53:09,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:09,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:09,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:53:09,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-03 22:53:09,056 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:09,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-03 22:53:09,060 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 13 treesize of output 12 [2018-02-03 22:53:09,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:09,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:09,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:53:09,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-03 22:53:09,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:09,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-02-03 22:53:09,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-02-03 22:53:09,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:09,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:53:09,402 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:53:09,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:53:09,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-03 22:53:09,419 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:73, output treesize:128 [2018-02-03 22:53:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:09,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:53:09,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 36 [2018-02-03 22:53:09,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-02-03 22:53:09,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-02-03 22:53:09,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2018-02-03 22:53:09,548 INFO L87 Difference]: Start difference. First operand 70 states and 77 transitions. Second operand 37 states. [2018-02-03 22:53:10,066 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 118 DAG size of output 51 [2018-02-03 22:53:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:11,564 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2018-02-03 22:53:11,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-03 22:53:11,565 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 35 [2018-02-03 22:53:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:11,566 INFO L225 Difference]: With dead ends: 87 [2018-02-03 22:53:11,566 INFO L226 Difference]: Without dead ends: 85 [2018-02-03 22:53:11,567 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 815 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=368, Invalid=2938, Unknown=0, NotChecked=0, Total=3306 [2018-02-03 22:53:11,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-02-03 22:53:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2018-02-03 22:53:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-02-03 22:53:11,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-02-03 22:53:11,569 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 35 [2018-02-03 22:53:11,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:11,569 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-02-03 22:53:11,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-02-03 22:53:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-02-03 22:53:11,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-03 22:53:11,570 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:11,570 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-03 22:53:11,570 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:53:11,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1689703552, now seen corresponding path program 2 times [2018-02-03 22:53:11,571 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:11,571 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:11,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:11,571 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:11,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:11,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:11,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:53:11,804 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:53:11,809 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:53:11,824 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:53:11,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:53:11,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:53:11,828 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 6 treesize of output 5 [2018-02-03 22:53:11,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:11,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:11,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 22:53:11,832 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 6 treesize of output 5 [2018-02-03 22:53:11,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:11,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:11,836 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:11,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:53:11,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:11,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:11,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-03 22:53:11,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:53:11,871 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 13 treesize of output 12 [2018-02-03 22:53:11,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:11,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:11,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:53:11,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-03 22:53:12,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-02-03 22:53:12,081 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-02-03 22:53:12,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:12,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:12,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:53:12,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2018-02-03 22:53:12,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-02-03 22:53:12,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-02-03 22:53:12,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:53:12,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:53:12,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:53:12,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-03 22:53:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:12,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:53:12,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2018-02-03 22:53:12,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-03 22:53:12,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-03 22:53:12,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=692, Unknown=0, NotChecked=0, Total=756 [2018-02-03 22:53:12,220 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 28 states. [2018-02-03 22:53:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:13,205 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-02-03 22:53:13,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-03 22:53:13,205 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2018-02-03 22:53:13,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:13,206 INFO L225 Difference]: With dead ends: 81 [2018-02-03 22:53:13,206 INFO L226 Difference]: Without dead ends: 81 [2018-02-03 22:53:13,206 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=200, Invalid=1606, Unknown=0, NotChecked=0, Total=1806 [2018-02-03 22:53:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-03 22:53:13,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 56. [2018-02-03 22:53:13,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-03 22:53:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-02-03 22:53:13,207 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 36 [2018-02-03 22:53:13,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:13,207 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-02-03 22:53:13,207 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-03 22:53:13,208 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-02-03 22:53:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-03 22:53:13,208 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:13,208 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-03 22:53:13,208 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:53:13,208 INFO L82 PathProgramCache]: Analyzing trace with hash -601444785, now seen corresponding path program 1 times [2018-02-03 22:53:13,208 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:13,208 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:13,209 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:13,209 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:53:13,209 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:13,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:13,504 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:53:13,504 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:53:13,509 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:13,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:53:13,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:53:13,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:13,552 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 6 treesize of output 5 [2018-02-03 22:53:13,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:13,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:13,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-03 22:53:13,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:13,585 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:13,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-03 22:53:13,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:13,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:13,593 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:13,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:53:13,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:13,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:13,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-02-03 22:53:13,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-03 22:53:13,629 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 12 treesize of output 11 [2018-02-03 22:53:13,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:13,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:13,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:13,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-02-03 22:53:13,790 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:13,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-02-03 22:53:13,793 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-02-03 22:53:13,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:13,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:13,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:13,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-02-03 22:53:13,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-03 22:53:13,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-02-03 22:53:13,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:53:13,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:53:13,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-03 22:53:13,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:51 [2018-02-03 22:53:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:13,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:53:13,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2018-02-03 22:53:13,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-03 22:53:13,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-03 22:53:13,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2018-02-03 22:53:13,944 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 40 states. [2018-02-03 22:53:15,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:15,799 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2018-02-03 22:53:15,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-02-03 22:53:15,799 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 38 [2018-02-03 22:53:15,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:15,799 INFO L225 Difference]: With dead ends: 94 [2018-02-03 22:53:15,800 INFO L226 Difference]: Without dead ends: 92 [2018-02-03 22:53:15,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=446, Invalid=4246, Unknown=0, NotChecked=0, Total=4692 [2018-02-03 22:53:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-02-03 22:53:15,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-02-03 22:53:15,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-03 22:53:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-02-03 22:53:15,802 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 38 [2018-02-03 22:53:15,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:15,802 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-02-03 22:53:15,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-02-03 22:53:15,802 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-02-03 22:53:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-03 22:53:15,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:15,802 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:15,802 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:53:15,803 INFO L82 PathProgramCache]: Analyzing trace with hash -28866724, now seen corresponding path program 2 times [2018-02-03 22:53:15,803 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:15,803 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:15,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:15,803 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:15,803 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:15,813 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:16,168 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:16,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:53:16,169 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:53:16,173 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:53:16,187 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:53:16,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:53:16,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:53:16,255 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 6 treesize of output 5 [2018-02-03 22:53:16,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:16,261 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 6 treesize of output 5 [2018-02-03 22:53:16,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:16,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:16,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-02-03 22:53:16,320 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:16,321 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:16,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-03 22:53:16,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:16,332 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:16,333 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:16,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:53:16,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:16,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:16,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-03 22:53:16,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-03 22:53:16,393 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 16 treesize of output 15 [2018-02-03 22:53:16,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:16,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:16,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:53:16,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-03 22:53:16,492 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:16,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-03 22:53:16,530 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 13 treesize of output 12 [2018-02-03 22:53:16,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:16,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:16,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:53:16,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-02-03 22:53:28,043 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:28,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2018-02-03 22:53:28,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 41 [2018-02-03 22:53:28,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:53:28,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:53:28,074 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:53:28,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:53:28,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2018-02-03 22:53:28,109 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:89, output treesize:227 [2018-02-03 22:53:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:28,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:53:28,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 40 [2018-02-03 22:53:28,286 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-02-03 22:53:28,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-02-03 22:53:28,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1523, Unknown=5, NotChecked=0, Total=1640 [2018-02-03 22:53:28,287 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 41 states. [2018-02-03 22:53:31,096 WARN L146 SmtUtils]: Spent 2103ms on a formula simplification. DAG size of input: 108 DAG size of output 104 [2018-02-03 22:53:31,255 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 113 DAG size of output 106 [2018-02-03 22:53:31,576 WARN L146 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 121 DAG size of output 117 [2018-02-03 22:53:31,957 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 124 DAG size of output 120 [2018-02-03 22:53:32,272 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 133 DAG size of output 122 [2018-02-03 22:53:34,445 WARN L146 SmtUtils]: Spent 2111ms on a formula simplification. DAG size of input: 130 DAG size of output 115 [2018-02-03 22:53:34,627 WARN L146 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 127 DAG size of output 121 [2018-02-03 22:53:34,828 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 153 DAG size of output 136 [2018-02-03 22:53:35,018 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 133 DAG size of output 117 [2018-02-03 22:53:39,179 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 134 DAG size of output 120 [2018-02-03 22:53:40,073 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 139 DAG size of output 130 [2018-02-03 22:53:40,266 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 136 DAG size of output 122 [2018-02-03 22:53:40,672 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 136 DAG size of output 122 [2018-02-03 22:53:40,945 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 160 DAG size of output 137 [2018-02-03 22:53:41,116 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 116 DAG size of output 107 [2018-02-03 22:53:41,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:41,644 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-02-03 22:53:41,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-03 22:53:41,645 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 38 [2018-02-03 22:53:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:41,645 INFO L225 Difference]: With dead ends: 104 [2018-02-03 22:53:41,645 INFO L226 Difference]: Without dead ends: 101 [2018-02-03 22:53:41,646 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=548, Invalid=5147, Unknown=5, NotChecked=0, Total=5700 [2018-02-03 22:53:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-03 22:53:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2018-02-03 22:53:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-03 22:53:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-02-03 22:53:41,648 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 38 [2018-02-03 22:53:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:41,648 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-02-03 22:53:41,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-02-03 22:53:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-02-03 22:53:41,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-03 22:53:41,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:41,648 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1] [2018-02-03 22:53:41,648 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:53:41,649 INFO L82 PathProgramCache]: Analyzing trace with hash 669200065, now seen corresponding path program 2 times [2018-02-03 22:53:41,649 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:41,649 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:41,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:41,649 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:53:41,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:41,663 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:42,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:53:42,152 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:53:42,157 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:53:42,174 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:53:42,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:53:42,176 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:53:42,179 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 6 treesize of output 5 [2018-02-03 22:53:42,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:42,184 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 6 treesize of output 5 [2018-02-03 22:53:42,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:42,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:42,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-03 22:53:42,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:42,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:42,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-03 22:53:42,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:42,239 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:42,240 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:42,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:53:42,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:42,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:42,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-03 22:53:42,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:53:42,296 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 13 treesize of output 12 [2018-02-03 22:53:42,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:42,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:42,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:42,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-03 22:53:42,587 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:42,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-02-03 22:53:42,592 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-02-03 22:53:42,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:42,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:42,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:53:42,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:36 [2018-02-03 22:53:42,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-03 22:53:42,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:53:42,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:53:42,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:53:42,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-03 22:53:42,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:57, output treesize:65 [2018-02-03 22:53:43,068 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:43,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:53:43,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2018-02-03 22:53:43,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-03 22:53:43,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-03 22:53:43,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1621, Unknown=0, NotChecked=0, Total=1722 [2018-02-03 22:53:43,087 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 42 states. [2018-02-03 22:53:43,921 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 93 DAG size of output 87 [2018-02-03 22:53:44,116 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 97 DAG size of output 93 [2018-02-03 22:53:44,472 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 99 DAG size of output 95 [2018-02-03 22:53:44,789 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 90 DAG size of output 86 [2018-02-03 22:53:45,504 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 93 DAG size of output 89 [2018-02-03 22:53:45,724 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 89 DAG size of output 88 [2018-02-03 22:53:45,991 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 71 DAG size of output 71 [2018-02-03 22:53:46,531 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 70 DAG size of output 69 [2018-02-03 22:53:47,133 WARN L146 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 93 DAG size of output 92 [2018-02-03 22:53:47,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:47,397 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-02-03 22:53:47,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-03 22:53:47,397 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-02-03 22:53:47,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:47,397 INFO L225 Difference]: With dead ends: 116 [2018-02-03 22:53:47,397 INFO L226 Difference]: Without dead ends: 115 [2018-02-03 22:53:47,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=402, Invalid=4854, Unknown=0, NotChecked=0, Total=5256 [2018-02-03 22:53:47,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-02-03 22:53:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2018-02-03 22:53:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-03 22:53:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-02-03 22:53:47,400 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 41 [2018-02-03 22:53:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:47,401 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-02-03 22:53:47,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-03 22:53:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-02-03 22:53:47,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-03 22:53:47,401 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:47,401 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:47,401 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:53:47,402 INFO L82 PathProgramCache]: Analyzing trace with hash -652090471, now seen corresponding path program 1 times [2018-02-03 22:53:47,402 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:47,402 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:47,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:47,402 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:53:47,402 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:47,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:47,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:48,330 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:53:48,331 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:53:48,337 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:48,358 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:53:48,364 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 6 treesize of output 5 [2018-02-03 22:53:48,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:48,371 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 6 treesize of output 5 [2018-02-03 22:53:48,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:48,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:48,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-03 22:53:48,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:48,468 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:48,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:53:48,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:48,479 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:48,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-03 22:53:48,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:48,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:48,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-03 22:53:48,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-03 22:53:48,567 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 16 treesize of output 15 [2018-02-03 22:53:48,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:48,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:48,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:53:48,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-02-03 22:53:48,625 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:48,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-03 22:53:48,629 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 13 treesize of output 12 [2018-02-03 22:53:48,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:48,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:48,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 22:53:48,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:43 [2018-02-03 22:53:49,428 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:49,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-02-03 22:53:49,432 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:49,433 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:49,434 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:49,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 73 [2018-02-03 22:53:49,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:53:49,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-03 22:53:49,458 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:49,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:53:49,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:53:49,483 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:78, output treesize:126 [2018-02-03 22:53:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:49,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:53:49,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 48 [2018-02-03 22:53:49,943 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-02-03 22:53:49,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-02-03 22:53:49,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2223, Unknown=0, NotChecked=0, Total=2352 [2018-02-03 22:53:49,944 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 49 states. [2018-02-03 22:53:50,924 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 123 DAG size of output 122 [2018-02-03 22:53:51,170 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 129 DAG size of output 128 [2018-02-03 22:53:52,475 WARN L146 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 134 DAG size of output 132 [2018-02-03 22:53:54,818 WARN L146 SmtUtils]: Spent 134ms on a formula simplification. DAG size of input: 131 DAG size of output 130 [2018-02-03 22:53:55,446 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 134 DAG size of output 128 [2018-02-03 22:53:55,958 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 140 DAG size of output 132 [2018-02-03 22:53:56,250 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 137 DAG size of output 130 [2018-02-03 22:53:56,520 WARN L146 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 132 DAG size of output 127 [2018-02-03 22:53:56,773 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 134 DAG size of output 127 [2018-02-03 22:53:57,067 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 151 DAG size of output 135 [2018-02-03 22:53:58,276 WARN L146 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 135 DAG size of output 129 [2018-02-03 22:53:58,545 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 113 DAG size of output 112 [2018-02-03 22:53:58,830 WARN L146 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 138 DAG size of output 131 [2018-02-03 22:53:59,118 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 116 DAG size of output 114 [2018-02-03 22:54:01,857 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 126 DAG size of output 119 [2018-02-03 22:54:02,202 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 127 DAG size of output 120 [2018-02-03 22:54:02,813 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 82 DAG size of output 81 [2018-02-03 22:54:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:03,678 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-02-03 22:54:03,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-02-03 22:54:03,679 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 43 [2018-02-03 22:54:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:03,679 INFO L225 Difference]: With dead ends: 117 [2018-02-03 22:54:03,679 INFO L226 Difference]: Without dead ends: 116 [2018-02-03 22:54:03,680 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=711, Invalid=7299, Unknown=0, NotChecked=0, Total=8010 [2018-02-03 22:54:03,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-02-03 22:54:03,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 74. [2018-02-03 22:54:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-03 22:54:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-02-03 22:54:03,682 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 43 [2018-02-03 22:54:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:03,682 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-02-03 22:54:03,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-02-03 22:54:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-02-03 22:54:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-03 22:54:03,682 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:03,682 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-02-03 22:54:03,682 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:54:03,682 INFO L82 PathProgramCache]: Analyzing trace with hash -889231934, now seen corresponding path program 3 times [2018-02-03 22:54:03,683 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:03,683 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:03,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:03,683 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:03,683 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:03,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:04,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:04,101 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:54:04,108 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:54:04,150 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-03 22:54:04,151 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:54:04,154 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:04,182 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 6 treesize of output 5 [2018-02-03 22:54:04,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:04,189 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 6 treesize of output 5 [2018-02-03 22:54:04,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:04,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:04,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-02-03 22:54:04,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:04,255 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:04,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-03 22:54:04,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:04,265 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:04,266 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:04,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:54:04,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:04,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:04,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:19 [2018-02-03 22:54:04,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:54:04,346 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 13 treesize of output 12 [2018-02-03 22:54:04,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:04,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:04,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:04,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-03 22:54:04,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:04,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-02-03 22:54:04,596 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-02-03 22:54:04,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:04,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:04,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:54:04,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-02-03 22:54:04,686 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:04,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-02-03 22:54:04,690 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-02-03 22:54:04,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:04,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:04,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:54:04,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2018-02-03 22:54:04,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-03 22:54:04,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:54:04,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:04,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:04,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-02-03 22:54:04,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:45 [2018-02-03 22:54:04,898 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:04,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:04,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 41 [2018-02-03 22:54:04,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-02-03 22:54:04,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-02-03 22:54:04,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1608, Unknown=0, NotChecked=0, Total=1722 [2018-02-03 22:54:04,916 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 42 states. [2018-02-03 22:54:11,562 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 81 DAG size of output 76 [2018-02-03 22:54:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:14,260 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-02-03 22:54:14,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-02-03 22:54:14,260 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 44 [2018-02-03 22:54:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:14,260 INFO L225 Difference]: With dead ends: 134 [2018-02-03 22:54:14,261 INFO L226 Difference]: Without dead ends: 101 [2018-02-03 22:54:14,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=495, Invalid=5825, Unknown=0, NotChecked=0, Total=6320 [2018-02-03 22:54:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-02-03 22:54:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 80. [2018-02-03 22:54:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-03 22:54:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-03 22:54:14,264 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 44 [2018-02-03 22:54:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:14,264 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-03 22:54:14,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-02-03 22:54:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-03 22:54:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-03 22:54:14,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:14,265 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-02-03 22:54:14,265 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:54:14,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1391820529, now seen corresponding path program 4 times [2018-02-03 22:54:14,265 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:14,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:14,266 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:14,266 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:54:14,266 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:14,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:14,620 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-03 22:54:14,620 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:14,621 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:54:14,626 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 22:54:14,649 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 22:54:14,649 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:54:14,651 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:14,695 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 6 treesize of output 5 [2018-02-03 22:54:14,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:14,701 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 6 treesize of output 5 [2018-02-03 22:54:14,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:14,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:14,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-02-03 22:54:14,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:14,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:14,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-03 22:54:14,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:14,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:14,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:14,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:54:14,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:14,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:14,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2018-02-03 22:54:14,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-03 22:54:14,815 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 16 treesize of output 15 [2018-02-03 22:54:14,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:14,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:14,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:14,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-02-03 22:54:14,851 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:14,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-03 22:54:14,854 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 13 treesize of output 12 [2018-02-03 22:54:14,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:14,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:14,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:14,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2018-02-03 22:54:15,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:15,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-02-03 22:54:15,379 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:15,386 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 2 case distinctions, treesize of input 30 treesize of output 65 [2018-02-03 22:54:15,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:15,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:15,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-02-03 22:54:15,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:141 [2018-02-03 22:54:15,786 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:15,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2018-02-03 22:54:15,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-02-03 22:54:15,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:15,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:54:15,807 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:15,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:15,861 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:15,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2018-02-03 22:54:15,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:54:15,867 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:15,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-02-03 22:54:15,880 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:15,890 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:15,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-02-03 22:54:15,939 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:166, output treesize:183 [2018-02-03 22:54:16,552 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:16,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:16,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 47 [2018-02-03 22:54:16,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-02-03 22:54:16,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-02-03 22:54:16,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=2129, Unknown=0, NotChecked=0, Total=2256 [2018-02-03 22:54:16,570 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 48 states. [2018-02-03 22:54:17,575 WARN L146 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 115 DAG size of output 108 [2018-02-03 22:54:17,782 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 103 DAG size of output 99 [2018-02-03 22:54:17,987 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 111 DAG size of output 107 [2018-02-03 22:54:18,249 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 124 DAG size of output 116 [2018-02-03 22:54:18,500 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 117 DAG size of output 112 [2018-02-03 22:54:18,733 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 130 DAG size of output 116 [2018-02-03 22:54:18,979 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 120 DAG size of output 113 [2018-02-03 22:54:19,191 WARN L146 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 122 DAG size of output 111 [2018-02-03 22:54:19,455 WARN L146 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 135 DAG size of output 120 [2018-02-03 22:54:19,753 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 125 DAG size of output 113 [2018-02-03 22:54:20,152 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 126 DAG size of output 114 [2018-02-03 22:54:20,345 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 106 DAG size of output 101 [2018-02-03 22:54:21,148 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 92 DAG size of output 84 [2018-02-03 22:54:21,409 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 119 DAG size of output 103 [2018-02-03 22:54:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:25,956 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-02-03 22:54:25,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-02-03 22:54:25,956 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 44 [2018-02-03 22:54:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:25,956 INFO L225 Difference]: With dead ends: 130 [2018-02-03 22:54:25,956 INFO L226 Difference]: Without dead ends: 127 [2018-02-03 22:54:25,957 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=581, Invalid=6899, Unknown=2, NotChecked=0, Total=7482 [2018-02-03 22:54:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-03 22:54:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2018-02-03 22:54:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-03 22:54:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2018-02-03 22:54:25,958 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 44 [2018-02-03 22:54:25,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:25,959 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2018-02-03 22:54:25,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-02-03 22:54:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2018-02-03 22:54:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-03 22:54:25,959 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:25,959 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 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-02-03 22:54:25,959 INFO L371 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:54:25,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1312957849, now seen corresponding path program 2 times [2018-02-03 22:54:25,960 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:25,960 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:25,960 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:25,960 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:54:25,961 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:25,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:27,006 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:27,006 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:54:27,010 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:54:27,028 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:54:27,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:54:27,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:27,033 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 6 treesize of output 5 [2018-02-03 22:54:27,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:27,039 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 6 treesize of output 5 [2018-02-03 22:54:27,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:27,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:27,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-03 22:54:27,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:27,074 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:27,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-03 22:54:27,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:27,083 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:27,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:27,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:54:27,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:27,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:27,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-02-03 22:54:27,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-03 22:54:27,144 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 16 treesize of output 15 [2018-02-03 22:54:27,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:27,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:27,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:54:27,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-02-03 22:54:27,189 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:27,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-03 22:54:27,193 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 13 treesize of output 12 [2018-02-03 22:54:27,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:27,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:27,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 22:54:27,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:43 [2018-02-03 22:54:27,789 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:27,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2018-02-03 22:54:27,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:27,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:27,801 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:27,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 73 [2018-02-03 22:54:27,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:27,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-03 22:54:27,828 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:27,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:27,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:27,856 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:73, output treesize:208 [2018-02-03 22:54:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:28,346 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:28,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 50 [2018-02-03 22:54:28,346 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-02-03 22:54:28,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-02-03 22:54:28,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2419, Unknown=0, NotChecked=0, Total=2550 [2018-02-03 22:54:28,347 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand 51 states. [2018-02-03 22:54:28,824 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 108 DAG size of output 86 [2018-02-03 22:54:29,020 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 116 DAG size of output 90 [2018-02-03 22:54:29,259 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 99 DAG size of output 98 [2018-02-03 22:54:29,511 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 136 DAG size of output 135 [2018-02-03 22:54:29,772 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 141 DAG size of output 140 [2018-02-03 22:54:29,980 WARN L146 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 118 DAG size of output 117 [2018-02-03 22:54:30,246 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 144 DAG size of output 142 [2018-02-03 22:54:30,586 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 139 DAG size of output 138 [2018-02-03 22:54:30,873 WARN L146 SmtUtils]: Spent 174ms on a formula simplification. DAG size of input: 145 DAG size of output 142 [2018-02-03 22:54:31,125 WARN L146 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 142 DAG size of output 140 [2018-02-03 22:54:31,375 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 145 DAG size of output 137 [2018-02-03 22:54:31,589 WARN L146 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 125 DAG size of output 123 [2018-02-03 22:54:31,865 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 151 DAG size of output 141 [2018-02-03 22:54:32,141 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 155 DAG size of output 144 [2018-02-03 22:54:32,354 WARN L146 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 142 DAG size of output 135 [2018-02-03 22:54:32,585 WARN L146 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 145 DAG size of output 136 [2018-02-03 22:54:32,860 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 159 DAG size of output 143 [2018-02-03 22:54:33,162 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 145 DAG size of output 137 [2018-02-03 22:54:33,396 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 122 DAG size of output 120 [2018-02-03 22:54:33,661 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 148 DAG size of output 139 [2018-02-03 22:54:33,932 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 125 DAG size of output 122 [2018-02-03 22:54:34,469 WARN L146 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 136 DAG size of output 127 [2018-02-03 22:54:34,763 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 137 DAG size of output 128 [2018-02-03 22:54:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:35,880 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2018-02-03 22:54:35,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-02-03 22:54:35,880 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 46 [2018-02-03 22:54:35,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:35,881 INFO L225 Difference]: With dead ends: 130 [2018-02-03 22:54:35,881 INFO L226 Difference]: Without dead ends: 129 [2018-02-03 22:54:35,881 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1924 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=729, Invalid=8013, Unknown=0, NotChecked=0, Total=8742 [2018-02-03 22:54:35,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-03 22:54:35,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 99. [2018-02-03 22:54:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-03 22:54:35,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-02-03 22:54:35,882 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 46 [2018-02-03 22:54:35,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:35,883 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-02-03 22:54:35,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-02-03 22:54:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-02-03 22:54:35,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-03 22:54:35,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:35,883 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:35,883 INFO L371 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:54:35,884 INFO L82 PathProgramCache]: Analyzing trace with hash 98715828, now seen corresponding path program 5 times [2018-02-03 22:54:35,884 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:35,884 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:35,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:35,884 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:54:35,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:35,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:36,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:36,488 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:54:36,493 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-03 22:54:36,513 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-02-03 22:54:36,514 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:54:36,516 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:36,550 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 6 treesize of output 5 [2018-02-03 22:54:36,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:36,556 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 6 treesize of output 5 [2018-02-03 22:54:36,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:36,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:36,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-02-03 22:54:36,609 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:36,610 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:36,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-02-03 22:54:36,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:36,619 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:36,620 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:36,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:54:36,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:36,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:36,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-02-03 22:54:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:37,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:37,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23] total 49 [2018-02-03 22:54:37,158 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-02-03 22:54:37,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-02-03 22:54:37,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2294, Unknown=0, NotChecked=0, Total=2450 [2018-02-03 22:54:37,158 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 50 states. [2018-02-03 22:54:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:46,194 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-02-03 22:54:46,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-02-03 22:54:46,194 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 47 [2018-02-03 22:54:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:46,194 INFO L225 Difference]: With dead ends: 142 [2018-02-03 22:54:46,194 INFO L226 Difference]: Without dead ends: 87 [2018-02-03 22:54:46,195 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1793 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=597, Invalid=6373, Unknown=2, NotChecked=0, Total=6972 [2018-02-03 22:54:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-02-03 22:54:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-02-03 22:54:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-02-03 22:54:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2018-02-03 22:54:46,196 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 47 [2018-02-03 22:54:46,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:46,196 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2018-02-03 22:54:46,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-02-03 22:54:46,196 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2018-02-03 22:54:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-03 22:54:46,196 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:46,196 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2018-02-03 22:54:46,196 INFO L371 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:54:46,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1574633716, now seen corresponding path program 3 times [2018-02-03 22:54:46,196 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:46,196 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:46,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:46,197 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:54:46,197 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:46,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:46,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:46,954 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:54:46,960 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 22:54:46,997 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-02-03 22:54:46,997 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:54:47,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:47,015 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 6 treesize of output 5 [2018-02-03 22:54:47,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:47,021 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 6 treesize of output 5 [2018-02-03 22:54:47,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:47,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:47,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-03 22:54:47,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:47,079 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:47,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:54:47,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:47,087 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:47,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-03 22:54:47,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:47,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:47,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-03 22:54:47,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-03 22:54:47,148 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 16 treesize of output 15 [2018-02-03 22:54:47,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:47,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:47,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:47,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-02-03 22:54:47,185 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:47,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-03 22:54:47,188 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 13 treesize of output 12 [2018-02-03 22:54:47,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:47,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:47,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:47,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-02-03 22:54:47,597 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:47,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-02-03 22:54:47,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 41 [2018-02-03 22:54:47,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-02-03 22:54:47,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-03 22:54:47,622 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:47,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:47,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:47,646 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:74, output treesize:159 [2018-02-03 22:54:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:49,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:49,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 53 [2018-02-03 22:54:49,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-02-03 22:54:49,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-02-03 22:54:49,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2696, Unknown=0, NotChecked=0, Total=2862 [2018-02-03 22:54:49,789 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 54 states. [2018-02-03 22:54:50,575 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 106 DAG size of output 88 [2018-02-03 22:54:50,753 WARN L146 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 114 DAG size of output 91 [2018-02-03 22:54:50,962 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 126 DAG size of output 100 [2018-02-03 22:54:51,194 WARN L146 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 132 DAG size of output 103 [2018-02-03 22:54:51,433 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 123 DAG size of output 99 [2018-02-03 22:54:51,676 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 126 DAG size of output 102 [2018-02-03 22:54:51,874 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 120 DAG size of output 96 [2018-02-03 22:54:52,097 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 135 DAG size of output 106 [2018-02-03 22:54:52,306 WARN L146 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 102 DAG size of output 84 [2018-02-03 22:54:52,515 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 125 DAG size of output 99 [2018-02-03 22:54:55,119 WARN L146 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 104 DAG size of output 87 [2018-02-03 22:54:55,394 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 62 DAG size of output 48 [2018-02-03 22:54:55,773 WARN L146 SmtUtils]: Spent 293ms on a formula simplification. DAG size of input: 72 DAG size of output 48 [2018-02-03 22:54:56,345 WARN L146 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 64 DAG size of output 49 [2018-02-03 22:55:00,347 WARN L146 SmtUtils]: Spent 3778ms on a formula simplification. DAG size of input: 76 DAG size of output 48 [2018-02-03 22:55:00,698 WARN L146 SmtUtils]: Spent 238ms on a formula simplification. DAG size of input: 96 DAG size of output 61 [2018-02-03 22:55:05,342 WARN L146 SmtUtils]: Spent 4516ms on a formula simplification. DAG size of input: 103 DAG size of output 50 [2018-02-03 22:55:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:55:05,812 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-02-03 22:55:05,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-02-03 22:55:05,812 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 49 [2018-02-03 22:55:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:55:05,813 INFO L225 Difference]: With dead ends: 113 [2018-02-03 22:55:05,813 INFO L226 Difference]: Without dead ends: 111 [2018-02-03 22:55:05,813 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=685, Invalid=7870, Unknown=1, NotChecked=0, Total=8556 [2018-02-03 22:55:05,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-02-03 22:55:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 79. [2018-02-03 22:55:05,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-02-03 22:55:05,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2018-02-03 22:55:05,815 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 49 [2018-02-03 22:55:05,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:55:05,816 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2018-02-03 22:55:05,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-02-03 22:55:05,816 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2018-02-03 22:55:05,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-02-03 22:55:05,816 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:55:05,816 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 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-02-03 22:55:05,816 INFO L371 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncatErr7RequiresViolation, cstrncatErr5RequiresViolation, cstrncatErr0RequiresViolation, cstrncatErr3RequiresViolation, cstrncatErr1RequiresViolation, cstrncatErr2RequiresViolation, cstrncatErr6RequiresViolation, cstrncatErr4RequiresViolation]=== [2018-02-03 22:55:05,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1082930983, now seen corresponding path program 4 times [2018-02-03 22:55:05,817 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:55:05,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:55:05,817 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:05,817 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:55:05,817 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:55:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:55:05,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:55:06,274 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 75 DAG size of output 68 [2018-02-03 22:55:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:55:07,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:55:07,101 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:55:07,106 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 22:55:07,127 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 22:55:07,127 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:55:07,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:55:07,133 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 6 treesize of output 5 [2018-02-03 22:55:07,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:07,138 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 6 treesize of output 5 [2018-02-03 22:55:07,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:07,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:07,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-02-03 22:55:07,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:07,199 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:07,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:55:07,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:07,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:07,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-02-03 22:55:07,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:07,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:07,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:25 [2018-02-03 22:55:07,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-02-03 22:55:07,276 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 16 treesize of output 15 [2018-02-03 22:55:07,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:07,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:07,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:55:07,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-02-03 22:55:07,326 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:07,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-02-03 22:55:07,330 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 13 treesize of output 12 [2018-02-03 22:55:07,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:07,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:55:07,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:55:07,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:46 [2018-02-03 22:55:08,352 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:08,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-02-03 22:55:08,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-03 22:55:08,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:55:08,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:08,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:08,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:08,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:08,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:08,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:08,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:08,367 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:08,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:08,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:55:08,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 161 [2018-02-03 22:55:08,378 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:55:08,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:55:08,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:55:08,444 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:104, output treesize:176 [2018-02-03 22:55:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:55:08,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:55:08,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 55 [2018-02-03 22:55:08,903 INFO L409 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-02-03 22:55:08,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-02-03 22:55:08,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2921, Unknown=0, NotChecked=0, Total=3080 [2018-02-03 22:55:08,904 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 56 states. [2018-02-03 22:55:09,407 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 124 DAG size of output 96 [2018-02-03 22:55:09,593 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 131 DAG size of output 99 [2018-02-03 22:55:10,254 WARN L146 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 183 DAG size of output 182 [2018-02-03 22:55:10,635 WARN L146 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 191 DAG size of output 190 [2018-02-03 22:55:11,051 WARN L146 SmtUtils]: Spent 258ms on a formula simplification. DAG size of input: 196 DAG size of output 194 [2018-02-03 22:55:11,416 WARN L146 SmtUtils]: Spent 263ms on a formula simplification. DAG size of input: 195 DAG size of output 186 [2018-02-03 22:55:11,805 WARN L146 SmtUtils]: Spent 272ms on a formula simplification. DAG size of input: 201 DAG size of output 190 [2018-02-03 22:55:12,132 WARN L146 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 191 DAG size of output 182 [2018-02-03 22:55:12,497 WARN L146 SmtUtils]: Spent 246ms on a formula simplification. DAG size of input: 197 DAG size of output 186 [2018-02-03 22:55:14,065 WARN L146 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 203 DAG size of output 193 [2018-02-03 22:55:14,401 WARN L146 SmtUtils]: Spent 231ms on a formula simplification. DAG size of input: 189 DAG size of output 183 [2018-02-03 22:55:14,740 WARN L146 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 184 DAG size of output 176 [2018-02-03 22:55:15,156 WARN L146 SmtUtils]: Spent 250ms on a formula simplification. DAG size of input: 195 DAG size of output 187 [2018-02-03 22:55:19,194 WARN L146 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 208 DAG size of output 198 [2018-02-03 22:55:19,515 WARN L146 SmtUtils]: Spent 222ms on a formula simplification. DAG size of input: 187 DAG size of output 182 [2018-02-03 22:55:19,894 WARN L146 SmtUtils]: Spent 226ms on a formula simplification. DAG size of input: 189 DAG size of output 181 [2018-02-03 22:55:20,298 WARN L146 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 207 DAG size of output 192 [2018-02-03 22:55:20,770 WARN L146 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 190 DAG size of output 184 Received shutdown request... [2018-02-03 22:55:20,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-03 22:55:20,999 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-03 22:55:21,003 WARN L185 ceAbstractionStarter]: Timeout [2018-02-03 22:55:21,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:55:21 BoogieIcfgContainer [2018-02-03 22:55:21,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:55:21,004 INFO L168 Benchmark]: Toolchain (without parser) took 205782.54 ms. Allocated memory was 395.8 MB in the beginning and 516.4 MB in the end (delta: 120.6 MB). Free memory was 352.7 MB in the beginning and 396.1 MB in the end (delta: -43.4 MB). Peak memory consumption was 77.2 MB. Max. memory is 5.3 GB. [2018-02-03 22:55:21,004 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 395.8 MB. Free memory is still 359.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:55:21,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.33 ms. Allocated memory is still 395.8 MB. Free memory was 352.7 MB in the beginning and 342.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:55:21,005 INFO L168 Benchmark]: Boogie Preprocessor took 23.83 ms. Allocated memory is still 395.8 MB. Free memory was 342.1 MB in the beginning and 340.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:55:21,005 INFO L168 Benchmark]: RCFGBuilder took 183.20 ms. Allocated memory is still 395.8 MB. Free memory was 340.8 MB in the beginning and 320.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-02-03 22:55:21,005 INFO L168 Benchmark]: TraceAbstraction took 205419.30 ms. Allocated memory was 395.8 MB in the beginning and 516.4 MB in the end (delta: 120.6 MB). Free memory was 318.8 MB in the beginning and 396.1 MB in the end (delta: -77.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:55:21,006 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.22 ms. Allocated memory is still 395.8 MB. Free memory is still 359.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.33 ms. Allocated memory is still 395.8 MB. Free memory was 352.7 MB in the beginning and 342.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.83 ms. Allocated memory is still 395.8 MB. Free memory was 342.1 MB in the beginning and 340.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 183.20 ms. Allocated memory is still 395.8 MB. Free memory was 340.8 MB in the beginning and 320.2 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 205419.30 ms. Allocated memory was 395.8 MB in the beginning and 516.4 MB in the end (delta: 120.6 MB). Free memory was 318.8 MB in the beginning and 396.1 MB in the end (delta: -77.3 MB). Peak memory consumption was 43.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 32 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 157. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 32 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 157. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 32 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 157. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 32 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 157. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 32 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 157. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 32 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 157. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 32 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 157. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 32 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 157. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 32 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 157. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 32 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 157. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 32 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 157. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 32 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 157. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (79states) and interpolant automaton (currently 32 states, 56 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 157. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 13 error locations. TIMEOUT Result, 205.3s OverallTime, 30 OverallIterations, 7 TraceHistogramMax, 167.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 957 SDtfs, 3196 SDslu, 9065 SDs, 0 SdLazy, 18039 SolverSat, 1649 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 56.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1573 GetRequests, 375 SyntacticMatches, 9 SemanticMatches, 1188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18748 ImplicationChecksByTransitivity, 141.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=27, 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.0s AutomataMinimizationTime, 29 MinimizatonAttempts, 395 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 36.3s InterpolantComputationTime, 1586 NumberOfCodeBlocks, 1586 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 1539 ConstructedInterpolants, 265 QuantifiedInterpolants, 1378909 SizeOfPredicates, 310 NumberOfNonLiveVariables, 3241 ConjunctsInSsa, 1090 ConjunctsInUnsatCore, 47 InterpolantComputations, 13 PerfectInterpolantSequences, 10/698 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/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-55-21-011.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-55-21-011.csv Completed graceful shutdown