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/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:02:51,058 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:02:51,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:02:51,072 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:02:51,072 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:02:51,073 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:02:51,074 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:02:51,075 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:02:51,077 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:02:51,078 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:02:51,078 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:02:51,078 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:02:51,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:02:51,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:02:51,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:02:51,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:02:51,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:02:51,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:02:51,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:02:51,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:02:51,089 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:02:51,089 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:02:51,090 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:02:51,090 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:02:51,091 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:02:51,092 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:02:51,092 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:02:51,093 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:02:51,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:02:51,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:02:51,093 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:02:51,094 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-04 00:02:51,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:02:51,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:02:51,104 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:02:51,104 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:02:51,104 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:02:51,104 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:02:51,104 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:02:51,105 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:02:51,105 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:02:51,105 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:02:51,105 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:02:51,105 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:02:51,105 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:02:51,105 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:02:51,105 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:02:51,106 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:02:51,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:02:51,106 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:02:51,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:02:51,106 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:02:51,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:02:51,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:02:51,107 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:02:51,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:02:51,107 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:02:51,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:02:51,146 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:02:51,152 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:02:51,153 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:02:51,154 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:02:51,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i [2018-02-04 00:02:51,303 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:02:51,304 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:02:51,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:02:51,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:02:51,310 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:02:51,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:02:51" (1/1) ... [2018-02-04 00:02:51,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e3e96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:02:51, skipping insertion in model container [2018-02-04 00:02:51,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:02:51" (1/1) ... [2018-02-04 00:02:51,328 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:02:51,357 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:02:51,450 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:02:51,465 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:02:51,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:02:51 WrapperNode [2018-02-04 00:02:51,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:02:51,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:02:51,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:02:51,471 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:02:51,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:02:51" (1/1) ... [2018-02-04 00:02:51,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:02:51" (1/1) ... [2018-02-04 00:02:51,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:02:51" (1/1) ... [2018-02-04 00:02:51,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:02:51" (1/1) ... [2018-02-04 00:02:51,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:02:51" (1/1) ... [2018-02-04 00:02:51,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:02:51" (1/1) ... [2018-02-04 00:02:51,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:02:51" (1/1) ... [2018-02-04 00:02:51,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:02:51,500 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:02:51,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:02:51,500 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:02:51,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:02:51" (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-04 00:02:51,534 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:02:51,534 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:02:51,534 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-02-04 00:02:51,534 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-02-04 00:02:51,534 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-04 00:02:51,534 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:02:51,535 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 00:02:51,535 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 00:02:51,535 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 00:02:51,535 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 00:02:51,535 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:02:51,535 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:02:51,535 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:02:51,535 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 00:02:51,535 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 00:02:51,535 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:02:51,535 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-02-04 00:02:51,535 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-02-04 00:02:51,535 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-04 00:02:51,535 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:02:51,536 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:02:51,536 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:02:51,893 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:02:51,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:02:51 BoogieIcfgContainer [2018-02-04 00:02:51,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:02:51,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:02:51,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:02:51,897 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:02:51,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:02:51" (1/3) ... [2018-02-04 00:02:51,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a812714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:02:51, skipping insertion in model container [2018-02-04 00:02:51,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:02:51" (2/3) ... [2018-02-04 00:02:51,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a812714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:02:51, skipping insertion in model container [2018-02-04 00:02:51,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:02:51" (3/3) ... [2018-02-04 00:02:51,900 INFO L107 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_true-valid-memsafety.i [2018-02-04 00:02:51,908 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:02:51,915 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-02-04 00:02:51,948 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:02:51,948 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:02:51,948 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:02:51,948 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:02:51,949 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:02:51,949 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:02:51,949 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:02:51,949 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:02:51,950 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:02:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2018-02-04 00:02:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 00:02:51,971 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:51,972 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:02:51,972 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:51,976 INFO L82 PathProgramCache]: Analyzing trace with hash -548983798, now seen corresponding path program 1 times [2018-02-04 00:02:51,977 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:51,978 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:52,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:52,021 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:52,021 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:52,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:52,111 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-04 00:02:52,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:52,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:02:52,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:02:52,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:02:52,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:02:52,123 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2018-02-04 00:02:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:52,304 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-02-04 00:02:52,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:02:52,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 00:02:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:52,313 INFO L225 Difference]: With dead ends: 123 [2018-02-04 00:02:52,313 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 00:02:52,314 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-04 00:02:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 00:02:52,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-02-04 00:02:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 00:02:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-02-04 00:02:52,343 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 7 [2018-02-04 00:02:52,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:52,343 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-02-04 00:02:52,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:02:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-02-04 00:02:52,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-04 00:02:52,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:52,344 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:02:52,344 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:52,345 INFO L82 PathProgramCache]: Analyzing trace with hash -548983797, now seen corresponding path program 1 times [2018-02-04 00:02:52,345 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:52,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:52,345 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:52,346 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:52,346 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:52,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:52,392 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-04 00:02:52,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:52,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 00:02:52,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 00:02:52,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 00:02:52,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 00:02:52,394 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 3 states. [2018-02-04 00:02:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:52,450 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-02-04 00:02:52,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 00:02:52,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-04 00:02:52,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:52,452 INFO L225 Difference]: With dead ends: 118 [2018-02-04 00:02:52,452 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 00:02:52,453 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-04 00:02:52,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 00:02:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-02-04 00:02:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-02-04 00:02:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-02-04 00:02:52,460 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 7 [2018-02-04 00:02:52,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:52,461 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-02-04 00:02:52,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 00:02:52,461 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-02-04 00:02:52,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 00:02:52,461 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:52,461 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:02:52,461 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:52,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1805977305, now seen corresponding path program 1 times [2018-02-04 00:02:52,462 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:52,462 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:52,463 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:52,463 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:52,463 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:52,478 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:52,522 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-04 00:02:52,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:52,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:02:52,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:02:52,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:02:52,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:02:52,523 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 5 states. [2018-02-04 00:02:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:52,656 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-02-04 00:02:52,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:02:52,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 00:02:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:52,658 INFO L225 Difference]: With dead ends: 129 [2018-02-04 00:02:52,658 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 00:02:52,658 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-04 00:02:52,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 00:02:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2018-02-04 00:02:52,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 00:02:52,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-02-04 00:02:52,666 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 14 [2018-02-04 00:02:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:52,666 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-02-04 00:02:52,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:02:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-02-04 00:02:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 00:02:52,667 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:52,667 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:02:52,667 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:52,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1805977306, now seen corresponding path program 1 times [2018-02-04 00:02:52,667 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:52,667 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:52,668 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:52,668 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:52,668 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:52,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:52,741 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-04 00:02:52,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:52,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:02:52,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:02:52,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:02:52,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:02:52,742 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 7 states. [2018-02-04 00:02:52,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:52,940 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2018-02-04 00:02:52,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:02:52,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-04 00:02:52,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:52,941 INFO L225 Difference]: With dead ends: 127 [2018-02-04 00:02:52,941 INFO L226 Difference]: Without dead ends: 127 [2018-02-04 00:02:52,941 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:02:52,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-02-04 00:02:52,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-02-04 00:02:52,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 00:02:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-02-04 00:02:52,946 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 14 [2018-02-04 00:02:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:52,946 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-02-04 00:02:52,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:02:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-02-04 00:02:52,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 00:02:52,946 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:52,946 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:02:52,946 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:52,947 INFO L82 PathProgramCache]: Analyzing trace with hash 150721727, now seen corresponding path program 1 times [2018-02-04 00:02:52,947 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:52,947 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:52,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:52,947 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:52,947 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:52,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:52,973 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-04 00:02:52,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:52,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:02:52,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:02:52,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:02:52,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:02:52,974 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 4 states. [2018-02-04 00:02:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:53,029 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-04 00:02:53,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:02:53,030 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 00:02:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:53,030 INFO L225 Difference]: With dead ends: 121 [2018-02-04 00:02:53,030 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 00:02:53,031 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-04 00:02:53,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 00:02:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-02-04 00:02:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 00:02:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-02-04 00:02:53,035 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 15 [2018-02-04 00:02:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:53,036 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-02-04 00:02:53,036 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:02:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-02-04 00:02:53,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-04 00:02:53,036 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:53,036 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:02:53,036 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:53,036 INFO L82 PathProgramCache]: Analyzing trace with hash 150721728, now seen corresponding path program 1 times [2018-02-04 00:02:53,036 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:53,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:53,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:53,037 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:53,037 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:53,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:53,084 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-04 00:02:53,084 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:53,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:02:53,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:02:53,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:02:53,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:02:53,085 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 4 states. [2018-02-04 00:02:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:53,144 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2018-02-04 00:02:53,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:02:53,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-04 00:02:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:53,145 INFO L225 Difference]: With dead ends: 120 [2018-02-04 00:02:53,145 INFO L226 Difference]: Without dead ends: 120 [2018-02-04 00:02:53,146 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-04 00:02:53,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-04 00:02:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-02-04 00:02:53,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 00:02:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-02-04 00:02:53,150 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 15 [2018-02-04 00:02:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:53,150 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-02-04 00:02:53,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:02:53,150 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-02-04 00:02:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 00:02:53,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:53,151 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] [2018-02-04 00:02:53,151 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:53,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1247099981, now seen corresponding path program 1 times [2018-02-04 00:02:53,151 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:53,151 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:53,152 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:53,152 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:53,153 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:53,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:53,190 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-04 00:02:53,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:53,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:02:53,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:02:53,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:02:53,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:02:53,191 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 5 states. [2018-02-04 00:02:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:53,310 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-02-04 00:02:53,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:02:53,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-04 00:02:53,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:53,311 INFO L225 Difference]: With dead ends: 135 [2018-02-04 00:02:53,311 INFO L226 Difference]: Without dead ends: 135 [2018-02-04 00:02:53,312 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-04 00:02:53,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-04 00:02:53,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-02-04 00:02:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 00:02:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-02-04 00:02:53,317 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 22 [2018-02-04 00:02:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:53,318 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-02-04 00:02:53,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:02:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-02-04 00:02:53,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 00:02:53,318 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:53,318 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] [2018-02-04 00:02:53,319 INFO L371 AbstractCegarLoop]: === Iteration 8 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:53,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1247099982, now seen corresponding path program 1 times [2018-02-04 00:02:53,319 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:53,319 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:53,320 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:53,320 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:53,320 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:53,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:53,368 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-04 00:02:53,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:53,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:02:53,368 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:02:53,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:02:53,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:02:53,369 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 5 states. [2018-02-04 00:02:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:53,460 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2018-02-04 00:02:53,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:02:53,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-04 00:02:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:53,461 INFO L225 Difference]: With dead ends: 129 [2018-02-04 00:02:53,461 INFO L226 Difference]: Without dead ends: 129 [2018-02-04 00:02:53,461 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:02:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-02-04 00:02:53,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2018-02-04 00:02:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 00:02:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-04 00:02:53,465 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 22 [2018-02-04 00:02:53,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:53,466 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-04 00:02:53,466 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:02:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-04 00:02:53,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:02:53,466 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:53,466 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] [2018-02-04 00:02:53,467 INFO L371 AbstractCegarLoop]: === Iteration 9 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:53,467 INFO L82 PathProgramCache]: Analyzing trace with hash 4873111, now seen corresponding path program 1 times [2018-02-04 00:02:53,467 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:53,467 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:53,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:53,468 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:53,468 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:53,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:53,504 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-04 00:02:53,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:53,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:02:53,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:02:53,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:02:53,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:02:53,505 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 4 states. [2018-02-04 00:02:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:53,559 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-04 00:02:53,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:02:53,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-04 00:02:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:53,560 INFO L225 Difference]: With dead ends: 119 [2018-02-04 00:02:53,560 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 00:02:53,561 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-04 00:02:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 00:02:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-02-04 00:02:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 00:02:53,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-04 00:02:53,564 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 23 [2018-02-04 00:02:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:53,564 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-04 00:02:53,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:02:53,565 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-04 00:02:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 00:02:53,565 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:53,565 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] [2018-02-04 00:02:53,565 INFO L371 AbstractCegarLoop]: === Iteration 10 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:53,566 INFO L82 PathProgramCache]: Analyzing trace with hash 4873112, now seen corresponding path program 1 times [2018-02-04 00:02:53,566 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:53,566 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:53,566 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:53,566 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:53,567 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:53,575 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:53,602 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-04 00:02:53,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:53,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:02:53,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:02:53,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:02:53,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:02:53,603 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2018-02-04 00:02:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:53,655 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-02-04 00:02:53,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:02:53,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-02-04 00:02:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:53,656 INFO L225 Difference]: With dead ends: 123 [2018-02-04 00:02:53,656 INFO L226 Difference]: Without dead ends: 123 [2018-02-04 00:02:53,656 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-04 00:02:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-02-04 00:02:53,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2018-02-04 00:02:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-02-04 00:02:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-02-04 00:02:53,658 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 23 [2018-02-04 00:02:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:53,659 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-02-04 00:02:53,659 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:02:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-02-04 00:02:53,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 00:02:53,659 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:53,659 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-04 00:02:53,659 INFO L371 AbstractCegarLoop]: === Iteration 11 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:53,659 INFO L82 PathProgramCache]: Analyzing trace with hash 167210254, now seen corresponding path program 1 times [2018-02-04 00:02:53,659 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:53,659 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:53,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:53,660 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:53,660 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:53,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:53,690 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-04 00:02:53,690 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:53,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:02:53,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:02:53,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:02:53,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:02:53,691 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 4 states. [2018-02-04 00:02:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:53,777 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-02-04 00:02:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:02:53,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-02-04 00:02:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:53,778 INFO L225 Difference]: With dead ends: 128 [2018-02-04 00:02:53,779 INFO L226 Difference]: Without dead ends: 128 [2018-02-04 00:02:53,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:02:53,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-02-04 00:02:53,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-02-04 00:02:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 00:02:53,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-02-04 00:02:53,782 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 24 [2018-02-04 00:02:53,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:53,782 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-02-04 00:02:53,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:02:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-02-04 00:02:53,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 00:02:53,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:53,784 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-04 00:02:53,784 INFO L371 AbstractCegarLoop]: === Iteration 12 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:53,784 INFO L82 PathProgramCache]: Analyzing trace with hash 167210255, now seen corresponding path program 1 times [2018-02-04 00:02:53,784 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:53,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:53,785 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:53,785 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:53,785 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:53,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:53,856 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-04 00:02:53,857 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:53,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:02:53,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:02:53,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:02:53,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:02:53,858 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 7 states. [2018-02-04 00:02:54,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:54,007 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-02-04 00:02:54,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:02:54,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-02-04 00:02:54,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:54,009 INFO L225 Difference]: With dead ends: 122 [2018-02-04 00:02:54,009 INFO L226 Difference]: Without dead ends: 122 [2018-02-04 00:02:54,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:02:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-02-04 00:02:54,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-02-04 00:02:54,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-02-04 00:02:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-02-04 00:02:54,012 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 24 [2018-02-04 00:02:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:54,012 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-02-04 00:02:54,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:02:54,012 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-02-04 00:02:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 00:02:54,013 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:54,013 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-04 00:02:54,013 INFO L371 AbstractCegarLoop]: === Iteration 13 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash 151037655, now seen corresponding path program 1 times [2018-02-04 00:02:54,014 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:54,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:54,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:54,015 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:54,015 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:54,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:54,064 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-04 00:02:54,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:54,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:02:54,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:02:54,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:02:54,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:02:54,065 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 5 states. [2018-02-04 00:02:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:54,159 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-02-04 00:02:54,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:02:54,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-02-04 00:02:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:54,163 INFO L225 Difference]: With dead ends: 119 [2018-02-04 00:02:54,163 INFO L226 Difference]: Without dead ends: 119 [2018-02-04 00:02:54,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:02:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-02-04 00:02:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-02-04 00:02:54,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-02-04 00:02:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-02-04 00:02:54,166 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 24 [2018-02-04 00:02:54,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:54,167 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-02-04 00:02:54,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:02:54,167 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-02-04 00:02:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 00:02:54,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:54,168 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, 1] [2018-02-04 00:02:54,168 INFO L371 AbstractCegarLoop]: === Iteration 14 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:54,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1118005000, now seen corresponding path program 1 times [2018-02-04 00:02:54,168 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:54,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:54,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:54,169 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:54,169 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:54,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:54,229 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-04 00:02:54,230 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:54,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:02:54,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:02:54,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:02:54,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:02:54,231 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 7 states. [2018-02-04 00:02:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:54,422 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-02-04 00:02:54,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:02:54,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 00:02:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:54,423 INFO L225 Difference]: With dead ends: 131 [2018-02-04 00:02:54,424 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 00:02:54,424 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:02:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 00:02:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-04 00:02:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 00:02:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-02-04 00:02:54,426 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 29 [2018-02-04 00:02:54,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:54,427 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-02-04 00:02:54,427 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:02:54,427 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-02-04 00:02:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 00:02:54,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:54,428 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, 1] [2018-02-04 00:02:54,428 INFO L371 AbstractCegarLoop]: === Iteration 15 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:54,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1118005001, now seen corresponding path program 1 times [2018-02-04 00:02:54,428 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:54,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:54,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:54,429 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:54,429 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:54,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:54,491 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-04 00:02:54,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:54,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:02:54,492 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:02:54,492 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:02:54,492 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:02:54,492 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 7 states. [2018-02-04 00:02:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:54,674 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-02-04 00:02:54,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:02:54,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-02-04 00:02:54,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:54,675 INFO L225 Difference]: With dead ends: 131 [2018-02-04 00:02:54,675 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 00:02:54,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:02:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 00:02:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-02-04 00:02:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-02-04 00:02:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-02-04 00:02:54,678 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 29 [2018-02-04 00:02:54,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:54,678 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-02-04 00:02:54,678 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:02:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-02-04 00:02:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 00:02:54,679 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:54,679 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, 1, 1] [2018-02-04 00:02:54,679 INFO L371 AbstractCegarLoop]: === Iteration 16 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:54,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1228344885, now seen corresponding path program 1 times [2018-02-04 00:02:54,680 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:54,680 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:54,681 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:54,681 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:54,681 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:54,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:54,705 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-04 00:02:54,706 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:54,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:02:54,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:02:54,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:02:54,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:02:54,706 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 5 states. [2018-02-04 00:02:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:54,779 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-02-04 00:02:54,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:02:54,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-04 00:02:54,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:54,780 INFO L225 Difference]: With dead ends: 121 [2018-02-04 00:02:54,780 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 00:02:54,780 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-04 00:02:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 00:02:54,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-02-04 00:02:54,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 00:02:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-02-04 00:02:54,783 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 30 [2018-02-04 00:02:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:54,783 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-02-04 00:02:54,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:02:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-02-04 00:02:54,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 00:02:54,784 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:54,784 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, 1, 1] [2018-02-04 00:02:54,784 INFO L371 AbstractCegarLoop]: === Iteration 17 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:54,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1228344886, now seen corresponding path program 1 times [2018-02-04 00:02:54,785 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:54,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:54,785 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:54,786 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:54,786 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:54,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:54,865 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-04 00:02:54,865 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:54,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:02:54,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:02:54,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:02:54,866 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:02:54,866 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 6 states. [2018-02-04 00:02:55,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:55,022 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2018-02-04 00:02:55,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:02:55,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-04 00:02:55,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:55,023 INFO L225 Difference]: With dead ends: 126 [2018-02-04 00:02:55,023 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 00:02:55,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:02:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 00:02:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-02-04 00:02:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-02-04 00:02:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-02-04 00:02:55,031 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 30 [2018-02-04 00:02:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:55,031 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-02-04 00:02:55,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:02:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-02-04 00:02:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 00:02:55,032 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:55,032 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, 1, 1] [2018-02-04 00:02:55,032 INFO L371 AbstractCegarLoop]: === Iteration 18 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:55,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1343765284, now seen corresponding path program 1 times [2018-02-04 00:02:55,032 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:55,032 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:55,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:55,033 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:55,033 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:55,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:55,068 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-04 00:02:55,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:55,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:02:55,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:02:55,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:02:55,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:02:55,069 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 5 states. [2018-02-04 00:02:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:55,185 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-02-04 00:02:55,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:02:55,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-02-04 00:02:55,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:55,187 INFO L225 Difference]: With dead ends: 130 [2018-02-04 00:02:55,187 INFO L226 Difference]: Without dead ends: 130 [2018-02-04 00:02:55,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:02:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-02-04 00:02:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2018-02-04 00:02:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 00:02:55,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-02-04 00:02:55,190 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 30 [2018-02-04 00:02:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:55,192 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-02-04 00:02:55,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:02:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-02-04 00:02:55,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 00:02:55,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:55,193 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, 1, 1] [2018-02-04 00:02:55,193 INFO L371 AbstractCegarLoop]: === Iteration 19 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:55,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1343765283, now seen corresponding path program 1 times [2018-02-04 00:02:55,193 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:55,193 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:55,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:55,194 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:55,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:55,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:55,264 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-04 00:02:55,264 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:55,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:02:55,265 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:02:55,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:02:55,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:02:55,265 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 6 states. [2018-02-04 00:02:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:55,375 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-02-04 00:02:55,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:02:55,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-04 00:02:55,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:55,376 INFO L225 Difference]: With dead ends: 125 [2018-02-04 00:02:55,376 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 00:02:55,377 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:02:55,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 00:02:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-02-04 00:02:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 00:02:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-02-04 00:02:55,380 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 30 [2018-02-04 00:02:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:55,380 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-02-04 00:02:55,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:02:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-02-04 00:02:55,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 00:02:55,381 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:55,381 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, 1, 1, 1] [2018-02-04 00:02:55,381 INFO L371 AbstractCegarLoop]: === Iteration 20 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:55,381 INFO L82 PathProgramCache]: Analyzing trace with hash 660985097, now seen corresponding path program 1 times [2018-02-04 00:02:55,381 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:55,381 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:55,382 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:55,382 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:55,382 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:55,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:55,475 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-04 00:02:55,475 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:55,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:02:55,476 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:02:55,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:02:55,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:02:55,476 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 8 states. [2018-02-04 00:02:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:55,746 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-02-04 00:02:55,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:02:55,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-02-04 00:02:55,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:55,747 INFO L225 Difference]: With dead ends: 134 [2018-02-04 00:02:55,747 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 00:02:55,747 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-04 00:02:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 00:02:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2018-02-04 00:02:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 00:02:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-02-04 00:02:55,750 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 31 [2018-02-04 00:02:55,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:55,751 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-02-04 00:02:55,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:02:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-02-04 00:02:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-04 00:02:55,751 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:55,751 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, 1, 1, 1] [2018-02-04 00:02:55,751 INFO L371 AbstractCegarLoop]: === Iteration 21 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:55,752 INFO L82 PathProgramCache]: Analyzing trace with hash 660985098, now seen corresponding path program 1 times [2018-02-04 00:02:55,752 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:55,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:55,752 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:55,753 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:55,753 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:55,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:55,882 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-04 00:02:55,882 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:55,882 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 00:02:55,883 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 00:02:55,883 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 00:02:55,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:02:55,883 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 10 states. [2018-02-04 00:02:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:56,189 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-02-04 00:02:56,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:02:56,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-02-04 00:02:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:56,190 INFO L225 Difference]: With dead ends: 133 [2018-02-04 00:02:56,190 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 00:02:56,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-02-04 00:02:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 00:02:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2018-02-04 00:02:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-02-04 00:02:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-02-04 00:02:56,192 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 31 [2018-02-04 00:02:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:56,192 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-02-04 00:02:56,192 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 00:02:56,192 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-02-04 00:02:56,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 00:02:56,193 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:56,193 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] [2018-02-04 00:02:56,193 INFO L371 AbstractCegarLoop]: === Iteration 22 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:56,193 INFO L82 PathProgramCache]: Analyzing trace with hash -184722078, now seen corresponding path program 1 times [2018-02-04 00:02:56,193 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:56,193 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:56,193 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:56,193 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:56,194 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:56,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:02:56,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:02:56,270 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-04 00:02:56,275 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:56,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:02:56,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:02:56,394 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-04 00:02:56,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:56,402 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:02:56,402 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:02:56,403 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-04 00:02:56,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:56,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:02:56,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2018-02-04 00:02:56,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:02:56,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:02:56,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-02-04 00:02:56,444 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:02:56,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:02:56,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:02:56,444 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 13 states. [2018-02-04 00:02:56,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:56,699 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-02-04 00:02:56,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:02:56,700 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-02-04 00:02:56,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:56,701 INFO L225 Difference]: With dead ends: 133 [2018-02-04 00:02:56,701 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 00:02:56,701 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:02:56,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 00:02:56,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2018-02-04 00:02:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 00:02:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-02-04 00:02:56,704 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 34 [2018-02-04 00:02:56,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:56,705 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-02-04 00:02:56,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:02:56,705 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-02-04 00:02:56,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 00:02:56,705 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:56,705 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, 1, 1, 1, 1, 1] [2018-02-04 00:02:56,705 INFO L371 AbstractCegarLoop]: === Iteration 23 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:56,706 INFO L82 PathProgramCache]: Analyzing trace with hash 501156800, now seen corresponding path program 1 times [2018-02-04 00:02:56,706 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:56,706 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:56,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:56,707 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:56,707 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:56,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:56,758 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-04 00:02:56,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:56,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 00:02:56,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:02:56,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:02:56,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:02:56,760 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 7 states. [2018-02-04 00:02:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:56,920 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2018-02-04 00:02:56,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:02:56,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-02-04 00:02:56,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:56,921 INFO L225 Difference]: With dead ends: 134 [2018-02-04 00:02:56,921 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 00:02:56,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:02:56,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 00:02:56,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 118. [2018-02-04 00:02:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-02-04 00:02:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2018-02-04 00:02:56,925 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 33 [2018-02-04 00:02:56,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:56,925 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2018-02-04 00:02:56,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:02:56,925 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2018-02-04 00:02:56,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 00:02:56,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:56,926 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, 1, 1, 1, 1, 1] [2018-02-04 00:02:56,926 INFO L371 AbstractCegarLoop]: === Iteration 24 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:56,926 INFO L82 PathProgramCache]: Analyzing trace with hash 501156801, now seen corresponding path program 1 times [2018-02-04 00:02:56,926 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:56,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:56,928 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:56,928 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:56,928 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:56,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:57,031 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-04 00:02:57,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:57,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 00:02:57,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 00:02:57,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 00:02:57,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 00:02:57,033 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand 9 states. [2018-02-04 00:02:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:57,300 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2018-02-04 00:02:57,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:02:57,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-04 00:02:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:57,300 INFO L225 Difference]: With dead ends: 159 [2018-02-04 00:02:57,300 INFO L226 Difference]: Without dead ends: 159 [2018-02-04 00:02:57,301 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-02-04 00:02:57,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-02-04 00:02:57,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 132. [2018-02-04 00:02:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 00:02:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-02-04 00:02:57,303 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 33 [2018-02-04 00:02:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:57,304 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-02-04 00:02:57,304 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 00:02:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-02-04 00:02:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 00:02:57,304 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:57,304 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, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:02:57,304 INFO L371 AbstractCegarLoop]: === Iteration 25 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:57,304 INFO L82 PathProgramCache]: Analyzing trace with hash 574362333, now seen corresponding path program 1 times [2018-02-04 00:02:57,304 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:57,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:57,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:57,305 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:57,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:57,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:57,348 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-04 00:02:57,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:57,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 00:02:57,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:02:57,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:02:57,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:02:57,349 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 8 states. [2018-02-04 00:02:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:57,473 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2018-02-04 00:02:57,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 00:02:57,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-02-04 00:02:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:57,474 INFO L225 Difference]: With dead ends: 157 [2018-02-04 00:02:57,474 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 00:02:57,474 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:02:57,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 00:02:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 132. [2018-02-04 00:02:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 00:02:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-02-04 00:02:57,477 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 35 [2018-02-04 00:02:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:57,477 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-02-04 00:02:57,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:02:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-02-04 00:02:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 00:02:57,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:57,478 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:02:57,478 INFO L371 AbstractCegarLoop]: === Iteration 26 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:57,478 INFO L82 PathProgramCache]: Analyzing trace with hash 655964540, now seen corresponding path program 1 times [2018-02-04 00:02:57,478 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:57,478 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:57,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:57,479 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:57,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:57,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:57,515 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-04 00:02:57,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:57,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:02:57,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:02:57,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:02:57,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:02:57,516 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 5 states. [2018-02-04 00:02:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:57,611 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-02-04 00:02:57,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:02:57,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-02-04 00:02:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:57,613 INFO L225 Difference]: With dead ends: 131 [2018-02-04 00:02:57,613 INFO L226 Difference]: Without dead ends: 131 [2018-02-04 00:02:57,613 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:02:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-02-04 00:02:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-02-04 00:02:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-02-04 00:02:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-02-04 00:02:57,616 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 36 [2018-02-04 00:02:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:57,616 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-02-04 00:02:57,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:02:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-02-04 00:02:57,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 00:02:57,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:57,617 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:02:57,617 INFO L371 AbstractCegarLoop]: === Iteration 27 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:57,617 INFO L82 PathProgramCache]: Analyzing trace with hash 655964541, now seen corresponding path program 1 times [2018-02-04 00:02:57,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:57,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:57,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:57,618 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:57,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:57,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:57,755 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-04 00:02:57,755 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:57,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 00:02:57,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 00:02:57,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 00:02:57,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:02:57,756 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 10 states. [2018-02-04 00:02:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:58,069 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2018-02-04 00:02:58,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:02:58,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-02-04 00:02:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:58,069 INFO L225 Difference]: With dead ends: 153 [2018-02-04 00:02:58,069 INFO L226 Difference]: Without dead ends: 153 [2018-02-04 00:02:58,070 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:02:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-02-04 00:02:58,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2018-02-04 00:02:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-02-04 00:02:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-02-04 00:02:58,072 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 36 [2018-02-04 00:02:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:58,072 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-02-04 00:02:58,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 00:02:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-02-04 00:02:58,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 00:02:58,072 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:58,072 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:02:58,072 INFO L371 AbstractCegarLoop]: === Iteration 28 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:58,072 INFO L82 PathProgramCache]: Analyzing trace with hash -747720392, now seen corresponding path program 1 times [2018-02-04 00:02:58,072 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:58,072 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:58,073 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:58,073 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:58,073 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:58,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:02:58,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:02:58,125 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-04 00:02:58,152 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:58,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:02:58,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-04 00:02:58,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:02:58,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:02:58,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:02:58,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 17 treesize of output 21 [2018-02-04 00:02:58,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-04 00:02:58,212 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 13 treesize of output 10 [2018-02-04 00:02:58,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-02-04 00:02:58,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,221 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-04 00:02:58,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-02-04 00:02:58,254 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-02-04 00:02:58,257 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 32 treesize of output 1 [2018-02-04 00:02:58,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:27 [2018-02-04 00:02:58,267 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 31 treesize of output 25 [2018-02-04 00:02:58,269 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-02-04 00:02:58,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,276 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-04 00:02:58,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:15 [2018-02-04 00:02:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 00:02:58,326 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:02:58,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-02-04 00:02:58,327 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 00:02:58,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 00:02:58,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:02:58,327 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 13 states. [2018-02-04 00:02:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:58,513 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2018-02-04 00:02:58,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:02:58,514 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-04 00:02:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:58,514 INFO L225 Difference]: With dead ends: 133 [2018-02-04 00:02:58,514 INFO L226 Difference]: Without dead ends: 133 [2018-02-04 00:02:58,515 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:02:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-02-04 00:02:58,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-02-04 00:02:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-02-04 00:02:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 141 transitions. [2018-02-04 00:02:58,517 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 141 transitions. Word has length 37 [2018-02-04 00:02:58,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:58,517 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 141 transitions. [2018-02-04 00:02:58,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 00:02:58,518 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 141 transitions. [2018-02-04 00:02:58,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 00:02:58,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:58,518 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:02:58,518 INFO L371 AbstractCegarLoop]: === Iteration 29 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:58,518 INFO L82 PathProgramCache]: Analyzing trace with hash -747720391, now seen corresponding path program 1 times [2018-02-04 00:02:58,520 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:58,520 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:58,520 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:58,520 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:58,520 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:58,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:02:58,644 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:02:58,644 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-04 00:02:58,651 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:58,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:02:58,679 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-04 00:02:58,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 00:02:58,685 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-04 00:02:58,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:02:58,690 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:02:58,691 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-04 00:02:58,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 00:02:58,702 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 13 treesize of output 10 [2018-02-04 00:02:58,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-02-04 00:02:58,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,712 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 13 treesize of output 10 [2018-02-04 00:02:58,713 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 10 treesize of output 9 [2018-02-04 00:02:58,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,720 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-02-04 00:02:58,774 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-02-04 00:02:58,777 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 32 treesize of output 1 [2018-02-04 00:02:58,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,793 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 51 treesize of output 52 [2018-02-04 00:02:58,795 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 32 treesize of output 1 [2018-02-04 00:02:58,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,798 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,805 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:34 [2018-02-04 00:02:58,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-02-04 00:02:58,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2018-02-04 00:02:58,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 15 [2018-02-04 00:02:58,860 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 15 treesize of output 3 [2018-02-04 00:02:58,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:02:58,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:12 [2018-02-04 00:02:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:02:58,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:02:58,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2018-02-04 00:02:58,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 00:02:58,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 00:02:58,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-02-04 00:02:58,900 INFO L87 Difference]: Start difference. First operand 133 states and 141 transitions. Second operand 15 states. [2018-02-04 00:02:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:02:59,252 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-02-04 00:02:59,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 00:02:59,253 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-02-04 00:02:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:02:59,253 INFO L225 Difference]: With dead ends: 143 [2018-02-04 00:02:59,253 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 00:02:59,254 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2018-02-04 00:02:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 00:02:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-02-04 00:02:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-02-04 00:02:59,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2018-02-04 00:02:59,257 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 37 [2018-02-04 00:02:59,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:02:59,257 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2018-02-04 00:02:59,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 00:02:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2018-02-04 00:02:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 00:02:59,257 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:02:59,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:02:59,258 INFO L371 AbstractCegarLoop]: === Iteration 30 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:02:59,258 INFO L82 PathProgramCache]: Analyzing trace with hash 484884458, now seen corresponding path program 1 times [2018-02-04 00:02:59,258 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:02:59,258 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:02:59,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:59,259 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:02:59,259 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:02:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:02:59,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:02:59,499 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-04 00:02:59,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:02:59,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 00:02:59,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 00:02:59,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 00:02:59,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:02:59,500 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand 17 states. [2018-02-04 00:03:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:00,188 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2018-02-04 00:03:00,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 00:03:00,188 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-02-04 00:03:00,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:00,189 INFO L225 Difference]: With dead ends: 178 [2018-02-04 00:03:00,189 INFO L226 Difference]: Without dead ends: 178 [2018-02-04 00:03:00,190 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 00:03:00,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-04 00:03:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 160. [2018-02-04 00:03:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-02-04 00:03:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2018-02-04 00:03:00,193 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 40 [2018-02-04 00:03:00,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:00,193 INFO L432 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2018-02-04 00:03:00,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 00:03:00,193 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2018-02-04 00:03:00,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 00:03:00,194 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:00,194 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:00,194 INFO L371 AbstractCegarLoop]: === Iteration 31 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:00,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1287024166, now seen corresponding path program 1 times [2018-02-04 00:03:00,195 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:00,195 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:00,195 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:00,195 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:00,196 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:00,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:00,339 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-04 00:03:00,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:00,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 00:03:00,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 00:03:00,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 00:03:00,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:03:00,341 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand 12 states. [2018-02-04 00:03:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:00,719 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2018-02-04 00:03:00,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 00:03:00,719 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-02-04 00:03:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:00,720 INFO L225 Difference]: With dead ends: 195 [2018-02-04 00:03:00,720 INFO L226 Difference]: Without dead ends: 195 [2018-02-04 00:03:00,720 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:03:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-02-04 00:03:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 169. [2018-02-04 00:03:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-04 00:03:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 182 transitions. [2018-02-04 00:03:00,723 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 182 transitions. Word has length 40 [2018-02-04 00:03:00,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:00,723 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 182 transitions. [2018-02-04 00:03:00,723 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 00:03:00,723 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 182 transitions. [2018-02-04 00:03:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 00:03:00,724 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:00,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:00,724 INFO L371 AbstractCegarLoop]: === Iteration 32 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:00,724 INFO L82 PathProgramCache]: Analyzing trace with hash -907645030, now seen corresponding path program 1 times [2018-02-04 00:03:00,724 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:00,724 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:00,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:00,725 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:00,725 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:00,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:00,779 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-04 00:03:00,779 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:00,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:03:00,780 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:03:00,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:03:00,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:03:00,780 INFO L87 Difference]: Start difference. First operand 169 states and 182 transitions. Second operand 8 states. [2018-02-04 00:03:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:00,875 INFO L93 Difference]: Finished difference Result 185 states and 199 transitions. [2018-02-04 00:03:00,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 00:03:00,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-02-04 00:03:00,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:00,877 INFO L225 Difference]: With dead ends: 185 [2018-02-04 00:03:00,877 INFO L226 Difference]: Without dead ends: 185 [2018-02-04 00:03:00,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 00:03:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-02-04 00:03:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 178. [2018-02-04 00:03:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-04 00:03:00,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 196 transitions. [2018-02-04 00:03:00,882 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 196 transitions. Word has length 44 [2018-02-04 00:03:00,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:00,882 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 196 transitions. [2018-02-04 00:03:00,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:03:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 196 transitions. [2018-02-04 00:03:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 00:03:00,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:00,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:00,883 INFO L371 AbstractCegarLoop]: === Iteration 33 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:00,883 INFO L82 PathProgramCache]: Analyzing trace with hash -907645029, now seen corresponding path program 1 times [2018-02-04 00:03:00,883 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:00,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:00,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:00,884 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:00,884 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:00,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:00,920 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-04 00:03:00,921 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:00,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 00:03:00,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 00:03:00,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 00:03:00,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 00:03:00,922 INFO L87 Difference]: Start difference. First operand 178 states and 196 transitions. Second operand 6 states. [2018-02-04 00:03:01,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:01,040 INFO L93 Difference]: Finished difference Result 184 states and 202 transitions. [2018-02-04 00:03:01,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 00:03:01,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-02-04 00:03:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:01,041 INFO L225 Difference]: With dead ends: 184 [2018-02-04 00:03:01,041 INFO L226 Difference]: Without dead ends: 184 [2018-02-04 00:03:01,042 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-04 00:03:01,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-04 00:03:01,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-02-04 00:03:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-04 00:03:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 199 transitions. [2018-02-04 00:03:01,045 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 199 transitions. Word has length 44 [2018-02-04 00:03:01,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:01,045 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 199 transitions. [2018-02-04 00:03:01,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 00:03:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 199 transitions. [2018-02-04 00:03:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-02-04 00:03:01,046 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:01,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:01,046 INFO L371 AbstractCegarLoop]: === Iteration 34 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:01,046 INFO L82 PathProgramCache]: Analyzing trace with hash 563904760, now seen corresponding path program 1 times [2018-02-04 00:03:01,046 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:01,047 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:01,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:01,048 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:01,048 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:01,058 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:01,159 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-04 00:03:01,159 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:01,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 00:03:01,160 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 00:03:01,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 00:03:01,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:03:01,160 INFO L87 Difference]: Start difference. First operand 180 states and 199 transitions. Second operand 10 states. [2018-02-04 00:03:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:01,428 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2018-02-04 00:03:01,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 00:03:01,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-02-04 00:03:01,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:01,429 INFO L225 Difference]: With dead ends: 186 [2018-02-04 00:03:01,429 INFO L226 Difference]: Without dead ends: 186 [2018-02-04 00:03:01,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:03:01,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-04 00:03:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2018-02-04 00:03:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-04 00:03:01,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 187 transitions. [2018-02-04 00:03:01,432 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 187 transitions. Word has length 43 [2018-02-04 00:03:01,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:01,432 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 187 transitions. [2018-02-04 00:03:01,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 00:03:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 187 transitions. [2018-02-04 00:03:01,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 00:03:01,433 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:01,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:01,433 INFO L371 AbstractCegarLoop]: === Iteration 35 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:01,433 INFO L82 PathProgramCache]: Analyzing trace with hash -368510437, now seen corresponding path program 1 times [2018-02-04 00:03:01,433 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:01,433 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:01,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:01,434 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:01,434 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:01,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:01,551 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-04 00:03:01,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:01,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 00:03:01,552 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 00:03:01,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 00:03:01,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:03:01,552 INFO L87 Difference]: Start difference. First operand 170 states and 187 transitions. Second operand 12 states. [2018-02-04 00:03:01,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:01,730 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2018-02-04 00:03:01,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:03:01,730 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-02-04 00:03:01,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:01,731 INFO L225 Difference]: With dead ends: 204 [2018-02-04 00:03:01,731 INFO L226 Difference]: Without dead ends: 204 [2018-02-04 00:03:01,731 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-02-04 00:03:01,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-04 00:03:01,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2018-02-04 00:03:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-04 00:03:01,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 220 transitions. [2018-02-04 00:03:01,734 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 220 transitions. Word has length 46 [2018-02-04 00:03:01,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:01,734 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 220 transitions. [2018-02-04 00:03:01,734 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 00:03:01,734 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 220 transitions. [2018-02-04 00:03:01,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 00:03:01,734 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:01,735 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:01,735 INFO L371 AbstractCegarLoop]: === Iteration 36 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:01,735 INFO L82 PathProgramCache]: Analyzing trace with hash 221499877, now seen corresponding path program 1 times [2018-02-04 00:03:01,735 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:01,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:01,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:01,735 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:01,735 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:01,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:01,953 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-04 00:03:01,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:01,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-04 00:03:01,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-04 00:03:01,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-04 00:03:01,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-04 00:03:01,954 INFO L87 Difference]: Start difference. First operand 196 states and 220 transitions. Second operand 18 states. [2018-02-04 00:03:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:02,669 INFO L93 Difference]: Finished difference Result 222 states and 249 transitions. [2018-02-04 00:03:02,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 00:03:02,669 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-02-04 00:03:02,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:02,670 INFO L225 Difference]: With dead ends: 222 [2018-02-04 00:03:02,670 INFO L226 Difference]: Without dead ends: 222 [2018-02-04 00:03:02,671 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2018-02-04 00:03:02,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-04 00:03:02,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 201. [2018-02-04 00:03:02,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-02-04 00:03:02,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 227 transitions. [2018-02-04 00:03:02,675 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 227 transitions. Word has length 47 [2018-02-04 00:03:02,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:02,676 INFO L432 AbstractCegarLoop]: Abstraction has 201 states and 227 transitions. [2018-02-04 00:03:02,676 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-04 00:03:02,676 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 227 transitions. [2018-02-04 00:03:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 00:03:02,676 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:02,677 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:02,677 INFO L371 AbstractCegarLoop]: === Iteration 37 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:02,677 INFO L82 PathProgramCache]: Analyzing trace with hash 221499878, now seen corresponding path program 1 times [2018-02-04 00:03:02,677 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:02,677 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:02,678 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:02,678 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:02,678 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:02,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:02,955 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-04 00:03:02,955 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:02,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 00:03:02,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:03:02,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:03:02,956 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:03:02,956 INFO L87 Difference]: Start difference. First operand 201 states and 227 transitions. Second operand 19 states. [2018-02-04 00:03:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:03,673 INFO L93 Difference]: Finished difference Result 239 states and 269 transitions. [2018-02-04 00:03:03,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 00:03:03,673 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-02-04 00:03:03,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:03,674 INFO L225 Difference]: With dead ends: 239 [2018-02-04 00:03:03,674 INFO L226 Difference]: Without dead ends: 239 [2018-02-04 00:03:03,674 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 00:03:03,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-04 00:03:03,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 218. [2018-02-04 00:03:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-04 00:03:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 249 transitions. [2018-02-04 00:03:03,679 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 249 transitions. Word has length 47 [2018-02-04 00:03:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:03,680 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 249 transitions. [2018-02-04 00:03:03,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:03:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 249 transitions. [2018-02-04 00:03:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 00:03:03,680 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:03,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:03,681 INFO L371 AbstractCegarLoop]: === Iteration 38 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:03,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1633162428, now seen corresponding path program 1 times [2018-02-04 00:03:03,681 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:03,681 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:03,682 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:03,682 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:03,682 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:03,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:04,097 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-04 00:03:04,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:04,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-04 00:03:04,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 00:03:04,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 00:03:04,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:03:04,098 INFO L87 Difference]: Start difference. First operand 218 states and 249 transitions. Second operand 23 states. [2018-02-04 00:03:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:05,019 INFO L93 Difference]: Finished difference Result 274 states and 311 transitions. [2018-02-04 00:03:05,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-04 00:03:05,019 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-02-04 00:03:05,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:05,020 INFO L225 Difference]: With dead ends: 274 [2018-02-04 00:03:05,020 INFO L226 Difference]: Without dead ends: 274 [2018-02-04 00:03:05,021 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=213, Invalid=2043, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 00:03:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-04 00:03:05,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 242. [2018-02-04 00:03:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 00:03:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 280 transitions. [2018-02-04 00:03:05,026 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 280 transitions. Word has length 50 [2018-02-04 00:03:05,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:05,026 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 280 transitions. [2018-02-04 00:03:05,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 00:03:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 280 transitions. [2018-02-04 00:03:05,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-02-04 00:03:05,027 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:05,027 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:05,027 INFO L371 AbstractCegarLoop]: === Iteration 39 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:05,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1633162429, now seen corresponding path program 1 times [2018-02-04 00:03:05,027 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:05,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:05,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:05,028 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:05,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:05,039 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:05,448 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-04 00:03:05,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:05,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-04 00:03:05,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 00:03:05,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 00:03:05,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-04 00:03:05,449 INFO L87 Difference]: Start difference. First operand 242 states and 280 transitions. Second operand 23 states. [2018-02-04 00:03:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:06,382 INFO L93 Difference]: Finished difference Result 273 states and 309 transitions. [2018-02-04 00:03:06,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-04 00:03:06,382 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-02-04 00:03:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:06,383 INFO L225 Difference]: With dead ends: 273 [2018-02-04 00:03:06,383 INFO L226 Difference]: Without dead ends: 273 [2018-02-04 00:03:06,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 00:03:06,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-04 00:03:06,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 242. [2018-02-04 00:03:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-04 00:03:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 278 transitions. [2018-02-04 00:03:06,387 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 278 transitions. Word has length 50 [2018-02-04 00:03:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:06,388 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 278 transitions. [2018-02-04 00:03:06,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 00:03:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 278 transitions. [2018-02-04 00:03:06,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-02-04 00:03:06,388 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:06,389 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:06,389 INFO L371 AbstractCegarLoop]: === Iteration 40 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:06,389 INFO L82 PathProgramCache]: Analyzing trace with hash -420728712, now seen corresponding path program 1 times [2018-02-04 00:03:06,389 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:06,389 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:06,390 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:06,390 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:06,390 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:06,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:03:06,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:03:06,892 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-04 00:03:06,897 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:06,917 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:03:06,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:03:06,938 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-04 00:03:06,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:06,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:06,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:03:06,947 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-04 00:03:06,947 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:06,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:06,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:06,952 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-02-04 00:03:07,228 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-02-04 00:03:07,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:07,230 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 00:03:07,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-02-04 00:03:07,234 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,239 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,248 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 26 treesize of output 19 [2018-02-04 00:03:07,250 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:07,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 00:03:07,252 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,266 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2018-02-04 00:03:07,279 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-02-04 00:03:07,281 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 18 treesize of output 19 [2018-02-04 00:03:07,282 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,285 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,296 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:03:07,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 37 treesize of output 34 [2018-02-04 00:03:07,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 23 treesize of output 19 [2018-02-04 00:03:07,299 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,304 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,311 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,339 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-02-04 00:03:07,341 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:07,342 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-02-04 00:03:07,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-02-04 00:03:07,346 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,351 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,358 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 26 treesize of output 19 [2018-02-04 00:03:07,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:07,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 19 treesize of output 19 [2018-02-04 00:03:07,361 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,365 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,368 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2018-02-04 00:03:07,374 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-02-04 00:03:07,377 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 18 treesize of output 19 [2018-02-04 00:03:07,377 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,380 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,388 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:07,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2018-02-04 00:03:07,391 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 29 treesize of output 27 [2018-02-04 00:03:07,391 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,396 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,400 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-04 00:03:07,415 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 5 variables, input treesize:104, output treesize:177 [2018-02-04 00:03:07,686 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 95 treesize of output 94 [2018-02-04 00:03:07,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:07,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:188, output treesize:87 [2018-02-04 00:03:07,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:07,747 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:07,748 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 15 treesize of output 8 [2018-02-04 00:03:07,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,760 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:07,760 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:03:07,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:07,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 89 [2018-02-04 00:03:07,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 78 treesize of output 68 [2018-02-04 00:03:07,767 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,772 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,781 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:03:07,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 61 treesize of output 69 [2018-02-04 00:03:07,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 74 [2018-02-04 00:03:07,784 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,789 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:07,796 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:108, output treesize:68 [2018-02-04 00:03:07,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-02-04 00:03:07,833 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 0 case distinctions, treesize of input 21 treesize of output 17 [2018-02-04 00:03:07,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,839 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:03:07,839 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 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-04 00:03:07,839 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-02-04 00:03:07,851 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 0 case distinctions, treesize of input 19 treesize of output 15 [2018-02-04 00:03:07,852 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,856 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:03:07,856 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 0 case distinctions, treesize of input 15 treesize of output 9 [2018-02-04 00:03:07,856 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,858 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:07,861 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:79, output treesize:9 [2018-02-04 00:03:07,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:03:07,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:03:07,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2018-02-04 00:03:07,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 00:03:07,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 00:03:07,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1085, Unknown=32, NotChecked=0, Total=1260 [2018-02-04 00:03:07,908 INFO L87 Difference]: Start difference. First operand 242 states and 278 transitions. Second operand 36 states. [2018-02-04 00:03:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:08,841 INFO L93 Difference]: Finished difference Result 262 states and 300 transitions. [2018-02-04 00:03:08,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 00:03:08,842 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2018-02-04 00:03:08,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:08,843 INFO L225 Difference]: With dead ends: 262 [2018-02-04 00:03:08,843 INFO L226 Difference]: Without dead ends: 262 [2018-02-04 00:03:08,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=288, Invalid=2228, Unknown=34, NotChecked=0, Total=2550 [2018-02-04 00:03:08,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-02-04 00:03:08,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 250. [2018-02-04 00:03:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-02-04 00:03:08,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 286 transitions. [2018-02-04 00:03:08,846 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 286 transitions. Word has length 51 [2018-02-04 00:03:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:08,846 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 286 transitions. [2018-02-04 00:03:08,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 00:03:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 286 transitions. [2018-02-04 00:03:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-04 00:03:08,847 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:08,847 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, 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-04 00:03:08,847 INFO L371 AbstractCegarLoop]: === Iteration 41 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:08,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1806033505, now seen corresponding path program 1 times [2018-02-04 00:03:08,847 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:08,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:08,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:08,848 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:08,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:08,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:09,381 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-04 00:03:09,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:09,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-04 00:03:09,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 00:03:09,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 00:03:09,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-02-04 00:03:09,382 INFO L87 Difference]: Start difference. First operand 250 states and 286 transitions. Second operand 27 states. [2018-02-04 00:03:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:10,580 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-02-04 00:03:10,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-02-04 00:03:10,581 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-02-04 00:03:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:10,581 INFO L225 Difference]: With dead ends: 280 [2018-02-04 00:03:10,581 INFO L226 Difference]: Without dead ends: 280 [2018-02-04 00:03:10,582 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=300, Invalid=3006, Unknown=0, NotChecked=0, Total=3306 [2018-02-04 00:03:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-02-04 00:03:10,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 248. [2018-02-04 00:03:10,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-02-04 00:03:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 282 transitions. [2018-02-04 00:03:10,585 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 282 transitions. Word has length 52 [2018-02-04 00:03:10,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:10,585 INFO L432 AbstractCegarLoop]: Abstraction has 248 states and 282 transitions. [2018-02-04 00:03:10,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 00:03:10,585 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 282 transitions. [2018-02-04 00:03:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 00:03:10,586 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:10,586 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:10,586 INFO L371 AbstractCegarLoop]: === Iteration 42 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:10,586 INFO L82 PathProgramCache]: Analyzing trace with hash -594351723, now seen corresponding path program 1 times [2018-02-04 00:03:10,586 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:10,586 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:10,587 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:10,587 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:10,587 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:10,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:03:10,829 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:03:10,829 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-04 00:03:10,834 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:10,858 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:03:10,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:03:10,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-04 00:03:10,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:10,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:10,917 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-04 00:03:10,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:28 [2018-02-04 00:03:10,958 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 15 treesize of output 8 [2018-02-04 00:03:10,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:10,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:10,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:20 [2018-02-04 00:03:11,010 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 41 treesize of output 33 [2018-02-04 00:03:11,011 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-02-04 00:03:11,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:11,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:11,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:11,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2018-02-04 00:03:11,061 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~mem25.base| Int) (|main_~#list~0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_~#list~0.base| 1))) (and (= |c_#valid| (store (store .cse0 |main_#t~mem25.base| 0) |main_~#list~0.base| 0)) (= 0 (select |c_old(#valid)| |main_~#list~0.base|)) (not (= 0 |main_#t~mem25.base|)) (= 0 (select .cse0 |main_#t~mem25.base|))))) is different from true [2018-02-04 00:03:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:03:11,086 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:03:11,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-02-04 00:03:11,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 00:03:11,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 00:03:11,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=365, Unknown=3, NotChecked=38, Total=462 [2018-02-04 00:03:11,086 INFO L87 Difference]: Start difference. First operand 248 states and 282 transitions. Second operand 22 states. [2018-02-04 00:03:25,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:25,706 INFO L93 Difference]: Finished difference Result 259 states and 294 transitions. [2018-02-04 00:03:25,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 00:03:25,707 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2018-02-04 00:03:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:25,707 INFO L225 Difference]: With dead ends: 259 [2018-02-04 00:03:25,707 INFO L226 Difference]: Without dead ends: 234 [2018-02-04 00:03:25,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=124, Invalid=804, Unknown=6, NotChecked=58, Total=992 [2018-02-04 00:03:25,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-02-04 00:03:25,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 227. [2018-02-04 00:03:25,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-02-04 00:03:25,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 260 transitions. [2018-02-04 00:03:25,710 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 260 transitions. Word has length 53 [2018-02-04 00:03:25,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:25,710 INFO L432 AbstractCegarLoop]: Abstraction has 227 states and 260 transitions. [2018-02-04 00:03:25,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 00:03:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 260 transitions. [2018-02-04 00:03:25,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-04 00:03:25,711 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:25,711 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, 1, 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-04 00:03:25,711 INFO L371 AbstractCegarLoop]: === Iteration 43 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:25,711 INFO L82 PathProgramCache]: Analyzing trace with hash 419691716, now seen corresponding path program 1 times [2018-02-04 00:03:25,711 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:25,711 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:25,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:25,712 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:25,712 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:25,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:26,045 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-04 00:03:26,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:26,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-04 00:03:26,046 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 00:03:26,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 00:03:26,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-02-04 00:03:26,046 INFO L87 Difference]: Start difference. First operand 227 states and 260 transitions. Second operand 20 states. [2018-02-04 00:03:26,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:26,634 INFO L93 Difference]: Finished difference Result 258 states and 298 transitions. [2018-02-04 00:03:26,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 00:03:26,635 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 53 [2018-02-04 00:03:26,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:26,636 INFO L225 Difference]: With dead ends: 258 [2018-02-04 00:03:26,636 INFO L226 Difference]: Without dead ends: 258 [2018-02-04 00:03:26,637 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2018-02-04 00:03:26,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-04 00:03:26,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 243. [2018-02-04 00:03:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-04 00:03:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 281 transitions. [2018-02-04 00:03:26,641 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 281 transitions. Word has length 53 [2018-02-04 00:03:26,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:26,641 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 281 transitions. [2018-02-04 00:03:26,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 00:03:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 281 transitions. [2018-02-04 00:03:26,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-04 00:03:26,642 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:26,642 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, 1, 1, 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-04 00:03:26,642 INFO L371 AbstractCegarLoop]: === Iteration 44 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:26,642 INFO L82 PathProgramCache]: Analyzing trace with hash 125541378, now seen corresponding path program 1 times [2018-02-04 00:03:26,642 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:26,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:26,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:26,645 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:26,645 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:26,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:26,960 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-04 00:03:26,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:26,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-04 00:03:26,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-04 00:03:26,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-04 00:03:26,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-02-04 00:03:26,961 INFO L87 Difference]: Start difference. First operand 243 states and 281 transitions. Second operand 19 states. [2018-02-04 00:03:27,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:27,346 INFO L93 Difference]: Finished difference Result 257 states and 296 transitions. [2018-02-04 00:03:27,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 00:03:27,346 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-02-04 00:03:27,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:27,347 INFO L225 Difference]: With dead ends: 257 [2018-02-04 00:03:27,347 INFO L226 Difference]: Without dead ends: 257 [2018-02-04 00:03:27,347 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2018-02-04 00:03:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-04 00:03:27,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 235. [2018-02-04 00:03:27,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-02-04 00:03:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 273 transitions. [2018-02-04 00:03:27,349 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 273 transitions. Word has length 54 [2018-02-04 00:03:27,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:27,350 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 273 transitions. [2018-02-04 00:03:27,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-04 00:03:27,350 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 273 transitions. [2018-02-04 00:03:27,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 00:03:27,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:27,350 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:27,350 INFO L371 AbstractCegarLoop]: === Iteration 45 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:27,351 INFO L82 PathProgramCache]: Analyzing trace with hash 866020445, now seen corresponding path program 1 times [2018-02-04 00:03:27,351 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:27,351 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:27,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:27,351 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:27,351 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:27,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:03:27,581 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:03:27,582 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-04 00:03:27,590 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:27,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:03:27,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:03:27,749 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-04 00:03:27,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:27,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:27,757 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-04 00:03:27,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-02-04 00:03:27,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-02-04 00:03:27,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 27 [2018-02-04 00:03:27,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 00:03:27,831 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 18 treesize of output 17 [2018-02-04 00:03:27,832 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:27,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 00:03:27,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:03:27,866 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-04 00:03:27,866 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:27,868 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:27,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 00:03:27,885 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:37, output treesize:53 [2018-02-04 00:03:27,919 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:27,920 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:27,920 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 35 treesize of output 29 [2018-02-04 00:03:27,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:27,932 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-04 00:03:27,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:69, output treesize:29 [2018-02-04 00:03:27,955 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 25 treesize of output 21 [2018-02-04 00:03:27,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-02-04 00:03:27,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:27,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:27,962 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-04 00:03:27,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2018-02-04 00:03:28,001 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-02-04 00:03:28,002 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 6 treesize of output 4 [2018-02-04 00:03:28,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:28,004 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 13 treesize of output 5 [2018-02-04 00:03:28,004 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:28,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:28,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:28,006 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:33, output treesize:5 [2018-02-04 00:03:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:03:28,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:03:28,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-02-04 00:03:28,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-04 00:03:28,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-04 00:03:28,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-02-04 00:03:28,037 INFO L87 Difference]: Start difference. First operand 235 states and 273 transitions. Second operand 28 states. [2018-02-04 00:03:28,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:28,742 INFO L93 Difference]: Finished difference Result 270 states and 309 transitions. [2018-02-04 00:03:28,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 00:03:28,742 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 67 [2018-02-04 00:03:28,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:28,743 INFO L225 Difference]: With dead ends: 270 [2018-02-04 00:03:28,743 INFO L226 Difference]: Without dead ends: 270 [2018-02-04 00:03:28,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=235, Invalid=2021, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 00:03:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-02-04 00:03:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 239. [2018-02-04 00:03:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-04 00:03:28,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 276 transitions. [2018-02-04 00:03:28,746 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 276 transitions. Word has length 67 [2018-02-04 00:03:28,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:28,746 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 276 transitions. [2018-02-04 00:03:28,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-04 00:03:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 276 transitions. [2018-02-04 00:03:28,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-04 00:03:28,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:28,746 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:28,746 INFO L371 AbstractCegarLoop]: === Iteration 46 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:28,747 INFO L82 PathProgramCache]: Analyzing trace with hash 866020446, now seen corresponding path program 1 times [2018-02-04 00:03:28,747 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:28,747 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:28,747 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:28,747 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:28,747 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:28,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:03:29,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:03:29,015 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-04 00:03:29,020 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:29,044 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:03:29,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:03:29,195 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-04 00:03:29,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:29,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:29,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:03:29,205 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-04 00:03:29,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:29,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:29,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:29,211 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-02-04 00:03:29,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-02-04 00:03:29,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 27 [2018-02-04 00:03:29,256 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 00:03:29,270 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 18 treesize of output 17 [2018-02-04 00:03:29,270 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:29,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-04 00:03:29,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-02-04 00:03:29,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-02-04 00:03:29,306 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 00:03:29,324 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-04 00:03:29,324 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:29,335 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:03:29,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-02-04 00:03:29,355 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:44, output treesize:129 [2018-02-04 00:03:29,405 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:29,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:29,406 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 50 treesize of output 44 [2018-02-04 00:03:29,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:29,417 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-04 00:03:29,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:84, output treesize:44 [2018-02-04 00:03:29,470 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2018-02-04 00:03:29,472 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 33 treesize of output 27 [2018-02-04 00:03:29,472 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:29,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2018-02-04 00:03:29,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:29,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:29,487 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 23 treesize of output 19 [2018-02-04 00:03:29,490 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 15 treesize of output 3 [2018-02-04 00:03:29,490 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:29,492 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:29,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:29,495 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:71, output treesize:9 [2018-02-04 00:03:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:03:29,573 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:03:29,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 35 [2018-02-04 00:03:29,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-04 00:03:29,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-04 00:03:29,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1166, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 00:03:29,574 INFO L87 Difference]: Start difference. First operand 239 states and 276 transitions. Second operand 36 states. [2018-02-04 00:03:31,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:31,159 INFO L93 Difference]: Finished difference Result 305 states and 344 transitions. [2018-02-04 00:03:31,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-04 00:03:31,159 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-02-04 00:03:31,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:31,160 INFO L225 Difference]: With dead ends: 305 [2018-02-04 00:03:31,160 INFO L226 Difference]: Without dead ends: 305 [2018-02-04 00:03:31,161 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=405, Invalid=4707, Unknown=0, NotChecked=0, Total=5112 [2018-02-04 00:03:31,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-02-04 00:03:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 247. [2018-02-04 00:03:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-02-04 00:03:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 282 transitions. [2018-02-04 00:03:31,164 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 282 transitions. Word has length 67 [2018-02-04 00:03:31,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:31,164 INFO L432 AbstractCegarLoop]: Abstraction has 247 states and 282 transitions. [2018-02-04 00:03:31,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-04 00:03:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 282 transitions. [2018-02-04 00:03:31,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-04 00:03:31,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:31,165 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:31,165 INFO L371 AbstractCegarLoop]: === Iteration 47 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:31,165 INFO L82 PathProgramCache]: Analyzing trace with hash -688882574, now seen corresponding path program 1 times [2018-02-04 00:03:31,165 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:31,165 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:31,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:31,166 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:31,166 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:31,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 00:03:31,360 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:03:31,360 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-04 00:03:31,366 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:31,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:03:31,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:03:31,463 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-04 00:03:31,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:31,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:31,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:03:31,471 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-04 00:03:31,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:31,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:31,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:31,477 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-02-04 00:03:31,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-02-04 00:03:31,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-02-04 00:03:31,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 00:03:31,548 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-04 00:03:31,548 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:31,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:03:31,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-02-04 00:03:31,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2018-02-04 00:03:31,583 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-04 00:03:31,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 16 treesize of output 15 [2018-02-04 00:03:31,597 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:31,605 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:03:31,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-04 00:03:31,620 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:42, output treesize:115 [2018-02-04 00:03:31,660 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 00:03:31,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:31,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:31,668 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:31,669 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 15 treesize of output 8 [2018-02-04 00:03:31,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:31,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:31,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:42 [2018-02-04 00:03:31,740 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2018-02-04 00:03:31,742 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 33 treesize of output 27 [2018-02-04 00:03:31,742 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:31,748 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 19 treesize of output 3 [2018-02-04 00:03:31,748 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:31,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:31,757 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 23 treesize of output 19 [2018-02-04 00:03:31,758 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 15 treesize of output 3 [2018-02-04 00:03:31,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:31,760 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:31,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:31,763 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:69, output treesize:7 [2018-02-04 00:03:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:03:31,800 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:03:31,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 27 [2018-02-04 00:03:31,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 00:03:31,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 00:03:31,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=624, Unknown=2, NotChecked=0, Total=702 [2018-02-04 00:03:31,801 INFO L87 Difference]: Start difference. First operand 247 states and 282 transitions. Second operand 27 states. [2018-02-04 00:03:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:32,440 INFO L93 Difference]: Finished difference Result 273 states and 308 transitions. [2018-02-04 00:03:32,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 00:03:32,441 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2018-02-04 00:03:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:32,441 INFO L225 Difference]: With dead ends: 273 [2018-02-04 00:03:32,441 INFO L226 Difference]: Without dead ends: 273 [2018-02-04 00:03:32,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=2000, Unknown=2, NotChecked=0, Total=2256 [2018-02-04 00:03:32,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-04 00:03:32,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 251. [2018-02-04 00:03:32,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-04 00:03:32,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 284 transitions. [2018-02-04 00:03:32,445 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 284 transitions. Word has length 60 [2018-02-04 00:03:32,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:32,445 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 284 transitions. [2018-02-04 00:03:32,445 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 00:03:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 284 transitions. [2018-02-04 00:03:32,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-04 00:03:32,445 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:32,445 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:32,445 INFO L371 AbstractCegarLoop]: === Iteration 48 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:32,445 INFO L82 PathProgramCache]: Analyzing trace with hash 804681722, now seen corresponding path program 1 times [2018-02-04 00:03:32,446 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:32,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:32,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:32,446 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:32,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:32,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 00:03:32,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:03:32,471 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-04 00:03:32,476 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:32,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:03:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-04 00:03:32,527 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:03:32,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-02-04 00:03:32,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 00:03:32,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 00:03:32,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:03:32,527 INFO L87 Difference]: Start difference. First operand 251 states and 284 transitions. Second operand 7 states. [2018-02-04 00:03:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:32,551 INFO L93 Difference]: Finished difference Result 263 states and 296 transitions. [2018-02-04 00:03:32,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 00:03:32,551 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-02-04 00:03:32,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:32,552 INFO L225 Difference]: With dead ends: 263 [2018-02-04 00:03:32,552 INFO L226 Difference]: Without dead ends: 263 [2018-02-04 00:03:32,552 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-02-04 00:03:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-02-04 00:03:32,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 258. [2018-02-04 00:03:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-02-04 00:03:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 291 transitions. [2018-02-04 00:03:32,554 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 291 transitions. Word has length 74 [2018-02-04 00:03:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:32,555 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 291 transitions. [2018-02-04 00:03:32,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 00:03:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 291 transitions. [2018-02-04 00:03:32,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-02-04 00:03:32,555 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:32,555 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, 1, 1, 1, 1, 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-04 00:03:32,555 INFO L371 AbstractCegarLoop]: === Iteration 49 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:32,555 INFO L82 PathProgramCache]: Analyzing trace with hash -2023698147, now seen corresponding path program 1 times [2018-02-04 00:03:32,555 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:32,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:32,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:32,556 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:32,556 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:32,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:33,167 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-04 00:03:33,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:33,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-02-04 00:03:33,167 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-04 00:03:33,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-04 00:03:33,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2018-02-04 00:03:33,168 INFO L87 Difference]: Start difference. First operand 258 states and 291 transitions. Second operand 29 states. [2018-02-04 00:03:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:34,158 INFO L93 Difference]: Finished difference Result 282 states and 318 transitions. [2018-02-04 00:03:34,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-04 00:03:34,158 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-02-04 00:03:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:34,159 INFO L225 Difference]: With dead ends: 282 [2018-02-04 00:03:34,159 INFO L226 Difference]: Without dead ends: 282 [2018-02-04 00:03:34,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=236, Invalid=2116, Unknown=0, NotChecked=0, Total=2352 [2018-02-04 00:03:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-02-04 00:03:34,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 262. [2018-02-04 00:03:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-02-04 00:03:34,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 295 transitions. [2018-02-04 00:03:34,162 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 295 transitions. Word has length 56 [2018-02-04 00:03:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:34,162 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 295 transitions. [2018-02-04 00:03:34,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-04 00:03:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 295 transitions. [2018-02-04 00:03:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-02-04 00:03:34,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:34,163 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, 1, 1, 1, 1, 1, 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-04 00:03:34,163 INFO L371 AbstractCegarLoop]: === Iteration 50 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:34,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1689866953, now seen corresponding path program 1 times [2018-02-04 00:03:34,163 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:34,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:34,164 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:34,164 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:34,164 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:34,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:34,760 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-04 00:03:34,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:34,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-04 00:03:34,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 00:03:34,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 00:03:34,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2018-02-04 00:03:34,761 INFO L87 Difference]: Start difference. First operand 262 states and 295 transitions. Second operand 27 states. [2018-02-04 00:03:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:35,869 INFO L93 Difference]: Finished difference Result 290 states and 325 transitions. [2018-02-04 00:03:35,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-04 00:03:35,869 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 57 [2018-02-04 00:03:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:35,870 INFO L225 Difference]: With dead ends: 290 [2018-02-04 00:03:35,870 INFO L226 Difference]: Without dead ends: 290 [2018-02-04 00:03:35,871 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=264, Invalid=2388, Unknown=0, NotChecked=0, Total=2652 [2018-02-04 00:03:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-02-04 00:03:35,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 252. [2018-02-04 00:03:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-02-04 00:03:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 285 transitions. [2018-02-04 00:03:35,874 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 285 transitions. Word has length 57 [2018-02-04 00:03:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:35,874 INFO L432 AbstractCegarLoop]: Abstraction has 252 states and 285 transitions. [2018-02-04 00:03:35,874 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 00:03:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 285 transitions. [2018-02-04 00:03:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-04 00:03:35,874 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:35,874 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:35,874 INFO L371 AbstractCegarLoop]: === Iteration 51 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash 195535773, now seen corresponding path program 1 times [2018-02-04 00:03:35,875 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:35,875 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:35,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:35,875 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:35,875 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:35,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:03:36,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:03:36,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-04 00:03:36,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 00:03:36,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 00:03:36,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-02-04 00:03:36,215 INFO L87 Difference]: Start difference. First operand 252 states and 285 transitions. Second operand 21 states. [2018-02-04 00:03:36,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:36,773 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2018-02-04 00:03:36,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-04 00:03:36,773 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-02-04 00:03:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:36,774 INFO L225 Difference]: With dead ends: 283 [2018-02-04 00:03:36,774 INFO L226 Difference]: Without dead ends: 274 [2018-02-04 00:03:36,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2018-02-04 00:03:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-02-04 00:03:36,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 257. [2018-02-04 00:03:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-02-04 00:03:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 288 transitions. [2018-02-04 00:03:36,777 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 288 transitions. Word has length 58 [2018-02-04 00:03:36,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:36,777 INFO L432 AbstractCegarLoop]: Abstraction has 257 states and 288 transitions. [2018-02-04 00:03:36,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 00:03:36,777 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 288 transitions. [2018-02-04 00:03:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-04 00:03:36,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:36,777 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:36,777 INFO L371 AbstractCegarLoop]: === Iteration 52 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:36,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1320961102, now seen corresponding path program 1 times [2018-02-04 00:03:36,778 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:36,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:36,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:36,778 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:36,778 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:36,784 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 00:03:36,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:03:36,878 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-04 00:03:36,883 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:36,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:03:36,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:03:36,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-04 00:03:36,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:36,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:36,953 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-04 00:03:36,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-02-04 00:03:36,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:36,964 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:36,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-02-04 00:03:36,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:36,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:36,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-02-04 00:03:36,991 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 5 treesize of output 1 [2018-02-04 00:03:36,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:36,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:36,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:20 [2018-02-04 00:03:37,040 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 24 treesize of output 18 [2018-02-04 00:03:37,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 9 [2018-02-04 00:03:37,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:37,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:37,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:37,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-02-04 00:03:37,062 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:37,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-04 00:03:37,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:37,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:37,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:15 [2018-02-04 00:03:37,089 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:03:37,107 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 00:03:37,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 23 [2018-02-04 00:03:37,107 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 00:03:37,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 00:03:37,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-02-04 00:03:37,107 INFO L87 Difference]: Start difference. First operand 257 states and 288 transitions. Second operand 24 states. [2018-02-04 00:03:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:03:37,582 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2018-02-04 00:03:37,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 00:03:37,614 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 73 [2018-02-04 00:03:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:03:37,615 INFO L225 Difference]: With dead ends: 289 [2018-02-04 00:03:37,615 INFO L226 Difference]: Without dead ends: 280 [2018-02-04 00:03:37,616 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=1209, Unknown=0, NotChecked=0, Total=1406 [2018-02-04 00:03:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-02-04 00:03:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 208. [2018-02-04 00:03:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-02-04 00:03:37,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 229 transitions. [2018-02-04 00:03:37,618 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 229 transitions. Word has length 73 [2018-02-04 00:03:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:03:37,619 INFO L432 AbstractCegarLoop]: Abstraction has 208 states and 229 transitions. [2018-02-04 00:03:37,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 00:03:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 229 transitions. [2018-02-04 00:03:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-02-04 00:03:37,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:03:37,619 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:03:37,619 INFO L371 AbstractCegarLoop]: === Iteration 53 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-02-04 00:03:37,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1492741583, now seen corresponding path program 1 times [2018-02-04 00:03:37,619 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:03:37,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:03:37,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:37,620 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:37,620 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:03:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:37,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:03:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:03:38,191 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 00:03:38,191 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-04 00:03:38,197 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:03:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:03:38,225 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 00:03:38,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:03:38,252 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-04 00:03:38,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:38,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:38,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-02-04 00:03:38,258 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-04 00:03:38,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:38,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:38,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:38,262 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-02-04 00:03:38,394 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (create_data_~data~0.offset Int)) (let ((.cse0 (+ create_data_~data~0.offset 4))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| create_data_~data~0.base (store (store (select |c_old(#memory_$Pointer$.base)| create_data_~data~0.base) .cse0 0) create_data_~data~0.offset (select (select |c_#memory_$Pointer$.base| create_data_~data~0.base) create_data_~data~0.offset)))) (= (store |c_old(#memory_$Pointer$.offset)| create_data_~data~0.base (store (store (select |c_old(#memory_$Pointer$.offset)| create_data_~data~0.base) .cse0 0) create_data_~data~0.offset (select (select |c_#memory_$Pointer$.offset| create_data_~data~0.base) create_data_~data~0.offset))) |c_#memory_$Pointer$.offset|) (= 0 (select |c_old(#valid)| create_data_~data~0.base))))) is different from true [2018-02-04 00:03:38,400 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:38,401 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:38,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 00:03:38,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:38,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:38,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:120, output treesize:114 [2018-02-04 00:03:42,508 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:42,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:42,557 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:42,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:42,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-02-04 00:03:42,600 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:136, output treesize:204 [2018-02-04 00:03:44,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 112 [2018-02-04 00:03:45,834 WARN L143 SmtUtils]: Spent 871ms on a formula simplification that was a NOOP. DAG size: 98 [2018-02-04 00:03:45,840 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:45,840 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 76 treesize of output 83 [2018-02-04 00:03:45,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:45,841 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 00:03:45,841 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:46,230 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 77 treesize of output 76 [2018-02-04 00:03:46,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:46,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 66 [2018-02-04 00:03:46,514 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-02-04 00:03:46,518 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:46,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 00:03:46,520 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:46,526 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:46,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-02-04 00:03:46,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-02-04 00:03:46,557 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:46,586 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 42 treesize of output 39 [2018-02-04 00:03:46,589 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:46,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 00:03:46,592 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:46,604 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:46,611 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:46,620 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:46,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 76 [2018-02-04 00:03:46,862 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 69 [2018-02-04 00:03:46,869 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:46,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 00:03:46,874 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:46,902 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:47,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 58 treesize of output 62 [2018-02-04 00:03:47,130 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:47,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 53 [2018-02-04 00:03:47,141 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-02-04 00:03:47,195 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:03:47,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 73 [2018-02-04 00:03:47,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-02-04 00:03:47,532 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:47,621 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 60 treesize of output 61 [2018-02-04 00:03:47,621 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:47,749 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:03:47,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 56 [2018-02-04 00:03:47,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2018-02-04 00:03:47,769 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:47,782 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:47,849 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:03:47,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 63 [2018-02-04 00:03:47,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 58 treesize of output 54 [2018-02-04 00:03:47,865 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:47,900 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:03:47,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 42 [2018-02-04 00:03:47,966 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:47,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 00:03:47,968 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:47,985 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:48,026 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:03:48,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 66 [2018-02-04 00:03:48,306 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 59 treesize of output 60 [2018-02-04 00:03:48,307 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:48,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 48 treesize of output 61 [2018-02-04 00:03:48,427 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:48,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 72 [2018-02-04 00:03:48,442 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 4 xjuncts. [2018-02-04 00:03:48,523 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:03:48,723 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 00:03:48,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 54 [2018-02-04 00:03:48,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 36 treesize of output 43 [2018-02-04 00:03:48,748 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:48,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 53 [2018-02-04 00:03:48,757 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-02-04 00:03:48,791 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:03:48,827 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:03:48,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 81 [2018-02-04 00:03:49,002 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 00:03:49,002 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:49,129 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 57 treesize of output 60 [2018-02-04 00:03:49,129 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:49,177 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:49,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-02-04 00:03:49,179 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:49,253 INFO L267 ElimStorePlain]: Start of recursive call 34: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:03:49,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 85 [2018-02-04 00:03:49,290 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:49,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 76 [2018-02-04 00:03:49,293 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:49,409 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 65 treesize of output 68 [2018-02-04 00:03:49,409 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:49,514 INFO L267 ElimStorePlain]: Start of recursive call 38: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:03:49,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 47 [2018-02-04 00:03:49,525 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:49,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2018-02-04 00:03:49,527 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:49,541 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:49,730 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-02-04 00:03:49,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, 2 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-04 00:03:49,858 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 14 treesize of output 15 [2018-02-04 00:03:49,859 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:49,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 69 [2018-02-04 00:03:49,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-02-04 00:03:49,910 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:50,016 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:50,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2018-02-04 00:03:50,027 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 2 xjuncts. [2018-02-04 00:03:50,187 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 39 treesize of output 38 [2018-02-04 00:03:50,188 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:50,242 INFO L267 ElimStorePlain]: Start of recursive call 45: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:03:50,290 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:03:50,355 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-04 00:03:50,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-02-04 00:03:50,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 112 [2018-02-04 00:03:51,442 WARN L143 SmtUtils]: Spent 793ms on a formula simplification that was a NOOP. DAG size: 98 [2018-02-04 00:03:51,443 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-04 00:03:51,443 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:51,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:51,446 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 76 treesize of output 83 [2018-02-04 00:03:51,446 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:51,604 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 77 treesize of output 76 [2018-02-04 00:03:51,604 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:51,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 66 [2018-02-04 00:03:51,747 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-02-04 00:03:51,749 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:51,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 00:03:51,751 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:51,755 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:51,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2018-02-04 00:03:51,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2018-02-04 00:03:51,773 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:51,797 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 42 treesize of output 39 [2018-02-04 00:03:51,800 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:51,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-02-04 00:03:51,802 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:51,809 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:51,814 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:51,820 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:51,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 77 [2018-02-04 00:03:51,911 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 72 [2018-02-04 00:03:51,914 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:51,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-04 00:03:51,915 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-02-04 00:03:51,929 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 00:03:52,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:52,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 59 treesize of output 73 [2018-02-04 00:03:52,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:52,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 37 [2018-02-04 00:03:52,040 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-02-04 00:03:52,063 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 00:03:52,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 67 [2018-02-04 00:03:52,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 52 treesize of output 65 [2018-02-04 00:03:52,219 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:52,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 72 [2018-02-04 00:03:52,230 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 4 xjuncts. [2018-02-04 00:03:52,265 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-04 00:03:52,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:52,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 69 [2018-02-04 00:03:52,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 00:03:52,372 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_36 term size 40 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-04 00:03:52,376 INFO L168 Benchmark]: Toolchain (without parser) took 61072.66 ms. Allocated memory was 399.0 MB in the beginning and 1.1 GB in the end (delta: 679.5 MB). Free memory was 355.7 MB in the beginning and 984.4 MB in the end (delta: -628.7 MB). Peak memory consumption was 637.8 MB. Max. memory is 5.3 GB. [2018-02-04 00:03:52,377 INFO L168 Benchmark]: CDTParser took 1.00 ms. Allocated memory is still 399.0 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:03:52,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.07 ms. Allocated memory is still 399.0 MB. Free memory was 355.7 MB in the beginning and 345.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 00:03:52,377 INFO L168 Benchmark]: Boogie Preprocessor took 28.49 ms. Allocated memory is still 399.0 MB. Free memory was 345.1 MB in the beginning and 343.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:03:52,378 INFO L168 Benchmark]: RCFGBuilder took 394.43 ms. Allocated memory is still 399.0 MB. Free memory was 342.5 MB in the beginning and 309.1 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:03:52,378 INFO L168 Benchmark]: TraceAbstraction took 60480.60 ms. Allocated memory was 399.0 MB in the beginning and 1.1 GB in the end (delta: 679.5 MB). Free memory was 309.1 MB in the beginning and 984.4 MB in the end (delta: -675.2 MB). Peak memory consumption was 591.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:03:52,379 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00 ms. Allocated memory is still 399.0 MB. Free memory is still 362.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.07 ms. Allocated memory is still 399.0 MB. Free memory was 355.7 MB in the beginning and 345.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 28.49 ms. Allocated memory is still 399.0 MB. Free memory was 345.1 MB in the beginning and 343.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 394.43 ms. Allocated memory is still 399.0 MB. Free memory was 342.5 MB in the beginning and 309.1 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60480.60 ms. Allocated memory was 399.0 MB in the beginning and 1.1 GB in the end (delta: 679.5 MB). Free memory was 309.1 MB in the beginning and 984.4 MB in the end (delta: -675.2 MB). Peak memory consumption was 591.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_36 term size 40 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_36 term size 40: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/optional_data_creation_test04_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-03-52-385.csv Received shutdown request...