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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:07:40,088 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:07:40,089 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:07:40,103 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:07:40,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:07:40,104 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:07:40,105 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:07:40,107 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:07:40,108 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:07:40,109 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:07:40,110 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:07:40,110 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:07:40,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:07:40,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:07:40,113 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:07:40,115 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:07:40,117 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:07:40,119 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:07:40,120 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:07:40,121 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:07:40,122 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:07:40,123 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:07:40,123 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:07:40,124 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:07:40,125 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:07:40,126 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:07:40,126 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:07:40,126 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:07:40,127 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:07:40,127 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:07:40,127 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:07:40,127 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 09:07:40,136 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:07:40,136 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:07:40,137 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:07:40,137 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:07:40,137 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:07:40,137 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:07:40,137 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:07:40,137 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:07:40,138 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:07:40,138 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:07:40,138 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:07:40,138 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:07:40,138 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:07:40,138 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:07:40,138 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:07:40,138 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:07:40,138 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:07:40,138 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:07:40,139 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:07:40,139 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:07:40,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:07:40,139 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:07:40,139 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:07:40,139 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:07:40,139 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:07:40,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:07:40,174 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:07:40,177 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:07:40,178 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:07:40,178 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:07:40,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test02_false-valid-memtrack.i [2018-02-02 09:07:40,323 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:07:40,324 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:07:40,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:07:40,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:07:40,328 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:07:40,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:07:40" (1/1) ... [2018-02-02 09:07:40,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6525d2fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:40, skipping insertion in model container [2018-02-02 09:07:40,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:07:40" (1/1) ... [2018-02-02 09:07:40,342 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:07:40,370 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:07:40,488 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:07:40,509 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:07:40,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:40 WrapperNode [2018-02-02 09:07:40,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:07:40,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:07:40,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:07:40,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:07:40,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:40" (1/1) ... [2018-02-02 09:07:40,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:40" (1/1) ... [2018-02-02 09:07:40,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:40" (1/1) ... [2018-02-02 09:07:40,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:40" (1/1) ... [2018-02-02 09:07:40,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:40" (1/1) ... [2018-02-02 09:07:40,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:40" (1/1) ... [2018-02-02 09:07:40,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:40" (1/1) ... [2018-02-02 09:07:40,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:07:40,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:07:40,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:07:40,548 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:07:40,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:40" (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-02 09:07:40,584 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:07:40,584 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:07:40,584 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-02-02 09:07:40,584 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-02-02 09:07:40,584 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 09:07:40,585 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:07:40,585 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:07:40,585 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:07:40,585 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:07:40,585 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:07:40,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:07:40,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:07:40,585 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:07:40,585 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 09:07:40,586 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:07:40,586 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:07:40,586 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-02-02 09:07:40,586 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-02-02 09:07:40,586 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 09:07:40,586 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:07:40,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:07:40,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:07:41,068 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:07:41,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:07:41 BoogieIcfgContainer [2018-02-02 09:07:41,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:07:41,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:07:41,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:07:41,071 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:07:41,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:07:40" (1/3) ... [2018-02-02 09:07:41,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58771637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:07:41, skipping insertion in model container [2018-02-02 09:07:41,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:07:40" (2/3) ... [2018-02-02 09:07:41,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58771637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:07:41, skipping insertion in model container [2018-02-02 09:07:41,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:07:41" (3/3) ... [2018-02-02 09:07:41,074 INFO L107 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02_false-valid-memtrack.i [2018-02-02 09:07:41,080 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:07:41,086 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-02-02 09:07:41,110 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:07:41,110 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:07:41,110 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:07:41,111 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:07:41,111 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:07:41,111 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:07:41,111 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:07:41,111 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:07:41,111 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:07:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-02-02 09:07:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 09:07:41,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:41,132 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:41,132 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:41,136 INFO L82 PathProgramCache]: Analyzing trace with hash 573466511, now seen corresponding path program 1 times [2018-02-02 09:07:41,137 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:41,137 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:41,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:41,169 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:41,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:41,200 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:41,236 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-02 09:07:41,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:41,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:07:41,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:07:41,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:07:41,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:07:41,313 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 3 states. [2018-02-02 09:07:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:41,483 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-02-02 09:07:41,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:07:41,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 09:07:41,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:41,491 INFO L225 Difference]: With dead ends: 210 [2018-02-02 09:07:41,491 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 09:07:41,492 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-02 09:07:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 09:07:41,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-02-02 09:07:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-02-02 09:07:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 219 transitions. [2018-02-02 09:07:41,526 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 219 transitions. Word has length 7 [2018-02-02 09:07:41,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:41,527 INFO L432 AbstractCegarLoop]: Abstraction has 207 states and 219 transitions. [2018-02-02 09:07:41,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:07:41,527 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 219 transitions. [2018-02-02 09:07:41,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-02-02 09:07:41,528 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:41,528 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:41,528 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:41,528 INFO L82 PathProgramCache]: Analyzing trace with hash 573466512, now seen corresponding path program 1 times [2018-02-02 09:07:41,528 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:41,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:41,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:41,529 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:41,529 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:41,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:41,572 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-02 09:07:41,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:41,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 09:07:41,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:07:41,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:07:41,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:07:41,575 INFO L87 Difference]: Start difference. First operand 207 states and 219 transitions. Second operand 3 states. [2018-02-02 09:07:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:41,695 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2018-02-02 09:07:41,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:07:41,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-02-02 09:07:41,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:41,699 INFO L225 Difference]: With dead ends: 208 [2018-02-02 09:07:41,700 INFO L226 Difference]: Without dead ends: 208 [2018-02-02 09:07:41,700 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-02 09:07:41,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-02 09:07:41,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2018-02-02 09:07:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 09:07:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 218 transitions. [2018-02-02 09:07:41,714 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 218 transitions. Word has length 7 [2018-02-02 09:07:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:41,715 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 218 transitions. [2018-02-02 09:07:41,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:07:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 218 transitions. [2018-02-02 09:07:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:07:41,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:41,716 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:41,716 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:41,716 INFO L82 PathProgramCache]: Analyzing trace with hash -975144455, now seen corresponding path program 1 times [2018-02-02 09:07:41,716 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:41,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:41,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:41,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:41,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:41,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:41,783 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-02 09:07:41,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:41,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:07:41,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:07:41,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:07:41,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:41,784 INFO L87 Difference]: Start difference. First operand 206 states and 218 transitions. Second operand 5 states. [2018-02-02 09:07:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:41,962 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2018-02-02 09:07:41,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:07:41,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 09:07:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:41,964 INFO L225 Difference]: With dead ends: 204 [2018-02-02 09:07:41,964 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 09:07:41,964 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-02 09:07:41,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 09:07:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-02-02 09:07:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 09:07:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 216 transitions. [2018-02-02 09:07:41,971 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 216 transitions. Word has length 14 [2018-02-02 09:07:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:41,971 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 216 transitions. [2018-02-02 09:07:41,971 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:07:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 216 transitions. [2018-02-02 09:07:41,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 09:07:41,972 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:41,972 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:41,972 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:41,972 INFO L82 PathProgramCache]: Analyzing trace with hash -975144454, now seen corresponding path program 1 times [2018-02-02 09:07:41,972 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:41,973 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:41,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:41,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:41,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:41,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:42,081 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-02 09:07:42,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:42,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:07:42,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:07:42,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:07:42,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:07:42,083 INFO L87 Difference]: Start difference. First operand 204 states and 216 transitions. Second operand 7 states. [2018-02-02 09:07:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:42,422 INFO L93 Difference]: Finished difference Result 224 states and 240 transitions. [2018-02-02 09:07:42,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:07:42,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-02 09:07:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:42,424 INFO L225 Difference]: With dead ends: 224 [2018-02-02 09:07:42,424 INFO L226 Difference]: Without dead ends: 224 [2018-02-02 09:07:42,424 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-02 09:07:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-02 09:07:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 213. [2018-02-02 09:07:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-02 09:07:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 228 transitions. [2018-02-02 09:07:42,434 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 228 transitions. Word has length 14 [2018-02-02 09:07:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:42,439 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 228 transitions. [2018-02-02 09:07:42,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:07:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 228 transitions. [2018-02-02 09:07:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 09:07:42,440 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:42,440 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:42,440 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash -164706800, now seen corresponding path program 1 times [2018-02-02 09:07:42,441 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:42,441 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:42,441 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:42,442 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:42,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:42,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:42,482 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-02 09:07:42,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:42,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:07:42,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:07:42,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:07:42,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:07:42,483 INFO L87 Difference]: Start difference. First operand 213 states and 228 transitions. Second operand 4 states. [2018-02-02 09:07:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:42,636 INFO L93 Difference]: Finished difference Result 211 states and 225 transitions. [2018-02-02 09:07:42,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:07:42,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 09:07:42,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:42,638 INFO L225 Difference]: With dead ends: 211 [2018-02-02 09:07:42,638 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 09:07:42,638 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-02 09:07:42,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 09:07:42,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-02-02 09:07:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 09:07:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 225 transitions. [2018-02-02 09:07:42,643 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 225 transitions. Word has length 15 [2018-02-02 09:07:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:42,643 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 225 transitions. [2018-02-02 09:07:42,644 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:07:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 225 transitions. [2018-02-02 09:07:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 09:07:42,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:42,644 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:42,644 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:42,644 INFO L82 PathProgramCache]: Analyzing trace with hash -164706799, now seen corresponding path program 1 times [2018-02-02 09:07:42,644 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:42,644 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:42,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:42,645 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:42,645 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:42,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:42,686 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-02 09:07:42,686 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:42,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:07:42,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:07:42,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:07:42,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:07:42,687 INFO L87 Difference]: Start difference. First operand 211 states and 225 transitions. Second operand 4 states. [2018-02-02 09:07:42,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:42,801 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2018-02-02 09:07:42,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:07:42,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-02-02 09:07:42,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:42,803 INFO L225 Difference]: With dead ends: 209 [2018-02-02 09:07:42,803 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 09:07:42,803 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-02 09:07:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 09:07:42,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-02-02 09:07:42,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 09:07:42,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 222 transitions. [2018-02-02 09:07:42,807 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 222 transitions. Word has length 15 [2018-02-02 09:07:42,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:42,807 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 222 transitions. [2018-02-02 09:07:42,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:07:42,807 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 222 transitions. [2018-02-02 09:07:42,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 09:07:42,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:42,808 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] [2018-02-02 09:07:42,808 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:42,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1093160757, now seen corresponding path program 1 times [2018-02-02 09:07:42,808 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:42,808 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:42,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:42,809 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:42,809 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:42,820 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:43,076 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-02 09:07:43,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:43,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 09:07:43,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:07:43,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:07:43,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:07:43,077 INFO L87 Difference]: Start difference. First operand 209 states and 222 transitions. Second operand 13 states. [2018-02-02 09:07:43,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:43,897 INFO L93 Difference]: Finished difference Result 211 states and 225 transitions. [2018-02-02 09:07:43,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:07:43,898 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-02-02 09:07:43,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:43,899 INFO L225 Difference]: With dead ends: 211 [2018-02-02 09:07:43,899 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 09:07:43,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:07:43,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 09:07:43,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2018-02-02 09:07:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 09:07:43,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2018-02-02 09:07:43,905 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 20 [2018-02-02 09:07:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:43,907 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2018-02-02 09:07:43,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:07:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2018-02-02 09:07:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 09:07:43,908 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:43,908 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-02 09:07:43,908 INFO L371 AbstractCegarLoop]: === Iteration 8 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:43,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1733477554, now seen corresponding path program 1 times [2018-02-02 09:07:43,909 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:43,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:43,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:43,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:43,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:43,918 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:43,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-02 09:07:43,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:43,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:07:43,954 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:07:43,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:07:43,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:07:43,955 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand 4 states. [2018-02-02 09:07:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:43,977 INFO L93 Difference]: Finished difference Result 298 states and 315 transitions. [2018-02-02 09:07:43,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:07:43,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-02-02 09:07:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:43,979 INFO L225 Difference]: With dead ends: 298 [2018-02-02 09:07:43,979 INFO L226 Difference]: Without dead ends: 298 [2018-02-02 09:07:43,979 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-02-02 09:07:43,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 262. [2018-02-02 09:07:43,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-02-02 09:07:43,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 315 transitions. [2018-02-02 09:07:43,985 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 315 transitions. Word has length 22 [2018-02-02 09:07:43,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:43,985 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 315 transitions. [2018-02-02 09:07:43,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:07:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 315 transitions. [2018-02-02 09:07:43,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:07:43,986 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:43,986 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] [2018-02-02 09:07:43,986 INFO L371 AbstractCegarLoop]: === Iteration 9 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:43,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1293570492, now seen corresponding path program 1 times [2018-02-02 09:07:43,987 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:43,987 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:43,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:43,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:43,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:43,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:44,024 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-02 09:07:44,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:44,025 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:07:44,025 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:07:44,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:07:44,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:07:44,026 INFO L87 Difference]: Start difference. First operand 262 states and 315 transitions. Second operand 4 states. [2018-02-02 09:07:44,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:44,157 INFO L93 Difference]: Finished difference Result 275 states and 321 transitions. [2018-02-02 09:07:44,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:07:44,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-02-02 09:07:44,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:44,159 INFO L225 Difference]: With dead ends: 275 [2018-02-02 09:07:44,159 INFO L226 Difference]: Without dead ends: 275 [2018-02-02 09:07:44,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:44,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-02 09:07:44,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 264. [2018-02-02 09:07:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-02-02 09:07:44,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 313 transitions. [2018-02-02 09:07:44,165 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 313 transitions. Word has length 26 [2018-02-02 09:07:44,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:44,166 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 313 transitions. [2018-02-02 09:07:44,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:07:44,166 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 313 transitions. [2018-02-02 09:07:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 09:07:44,167 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:44,167 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] [2018-02-02 09:07:44,167 INFO L371 AbstractCegarLoop]: === Iteration 10 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:44,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1293570493, now seen corresponding path program 1 times [2018-02-02 09:07:44,167 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:44,167 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:44,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:44,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:44,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:44,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:44,219 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-02 09:07:44,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:44,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:07:44,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:07:44,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:07:44,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:44,220 INFO L87 Difference]: Start difference. First operand 264 states and 313 transitions. Second operand 5 states. [2018-02-02 09:07:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:44,476 INFO L93 Difference]: Finished difference Result 287 states and 329 transitions. [2018-02-02 09:07:44,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:07:44,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-02-02 09:07:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:44,478 INFO L225 Difference]: With dead ends: 287 [2018-02-02 09:07:44,479 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 09:07:44,479 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-02 09:07:44,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 09:07:44,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 265. [2018-02-02 09:07:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-02-02 09:07:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 307 transitions. [2018-02-02 09:07:44,485 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 307 transitions. Word has length 26 [2018-02-02 09:07:44,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:44,486 INFO L432 AbstractCegarLoop]: Abstraction has 265 states and 307 transitions. [2018-02-02 09:07:44,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:07:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 307 transitions. [2018-02-02 09:07:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:07:44,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:44,487 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] [2018-02-02 09:07:44,487 INFO L371 AbstractCegarLoop]: === Iteration 11 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash 987277154, now seen corresponding path program 1 times [2018-02-02 09:07:44,487 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:44,487 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:44,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:44,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:44,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:44,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:44,526 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-02 09:07:44,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:44,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:07:44,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:07:44,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:07:44,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:44,527 INFO L87 Difference]: Start difference. First operand 265 states and 307 transitions. Second operand 5 states. [2018-02-02 09:07:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:44,722 INFO L93 Difference]: Finished difference Result 334 states and 389 transitions. [2018-02-02 09:07:44,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:07:44,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-02-02 09:07:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:44,725 INFO L225 Difference]: With dead ends: 334 [2018-02-02 09:07:44,725 INFO L226 Difference]: Without dead ends: 334 [2018-02-02 09:07:44,725 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-02 09:07:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-02-02 09:07:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 275. [2018-02-02 09:07:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 09:07:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 321 transitions. [2018-02-02 09:07:44,731 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 321 transitions. Word has length 32 [2018-02-02 09:07:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:44,731 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 321 transitions. [2018-02-02 09:07:44,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:07:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 321 transitions. [2018-02-02 09:07:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 09:07:44,732 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:44,732 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] [2018-02-02 09:07:44,732 INFO L371 AbstractCegarLoop]: === Iteration 12 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:44,732 INFO L82 PathProgramCache]: Analyzing trace with hash 987277155, now seen corresponding path program 1 times [2018-02-02 09:07:44,732 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:44,732 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:44,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:44,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:44,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:44,742 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:44,805 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-02 09:07:44,806 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:44,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:07:44,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:07:44,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:07:44,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:07:44,806 INFO L87 Difference]: Start difference. First operand 275 states and 321 transitions. Second operand 6 states. [2018-02-02 09:07:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:44,988 INFO L93 Difference]: Finished difference Result 283 states and 325 transitions. [2018-02-02 09:07:44,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:07:44,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-02-02 09:07:44,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:44,993 INFO L225 Difference]: With dead ends: 283 [2018-02-02 09:07:44,993 INFO L226 Difference]: Without dead ends: 283 [2018-02-02 09:07:44,993 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-02 09:07:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-02 09:07:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 275. [2018-02-02 09:07:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-02-02 09:07:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 317 transitions. [2018-02-02 09:07:44,999 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 317 transitions. Word has length 32 [2018-02-02 09:07:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:44,999 INFO L432 AbstractCegarLoop]: Abstraction has 275 states and 317 transitions. [2018-02-02 09:07:44,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:07:44,999 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 317 transitions. [2018-02-02 09:07:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:07:45,000 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:45,000 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] [2018-02-02 09:07:45,000 INFO L371 AbstractCegarLoop]: === Iteration 13 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:45,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1656548387, now seen corresponding path program 1 times [2018-02-02 09:07:45,000 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:45,000 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:45,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:45,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:45,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:45,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:45,091 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-02 09:07:45,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:45,091 INFO L209 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-02 09:07:45,101 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:45,145 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:45,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-02 09:07:45,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:45,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:45,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:07:45,207 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:45,208 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:45,211 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-02 09:07:45,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:45,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:45,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-02-02 09:07:45,235 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-02 09:07:45,237 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-02 09:07:45,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:45,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:45,245 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-02 09:07:45,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-02-02 09:07:45,278 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-02 09:07:45,280 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-02 09:07:45,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:45,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:45,293 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-02 09:07:45,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:27 [2018-02-02 09:07:45,297 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-02 09:07:45,299 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-02 09:07:45,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:45,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:45,305 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-02 09:07:45,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:15 [2018-02-02 09:07:45,326 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-02 09:07:45,355 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:45,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-02-02 09:07:45,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:07:45,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:07:45,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:07:45,356 INFO L87 Difference]: Start difference. First operand 275 states and 317 transitions. Second operand 13 states. [2018-02-02 09:07:45,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:45,730 INFO L93 Difference]: Finished difference Result 296 states and 337 transitions. [2018-02-02 09:07:45,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:07:45,730 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-02-02 09:07:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:45,731 INFO L225 Difference]: With dead ends: 296 [2018-02-02 09:07:45,731 INFO L226 Difference]: Without dead ends: 296 [2018-02-02 09:07:45,732 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 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-02 09:07:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-02-02 09:07:45,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 274. [2018-02-02 09:07:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-02-02 09:07:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 315 transitions. [2018-02-02 09:07:45,738 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 315 transitions. Word has length 39 [2018-02-02 09:07:45,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:45,738 INFO L432 AbstractCegarLoop]: Abstraction has 274 states and 315 transitions. [2018-02-02 09:07:45,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:07:45,738 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 315 transitions. [2018-02-02 09:07:45,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-02 09:07:45,739 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:45,739 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] [2018-02-02 09:07:45,739 INFO L371 AbstractCegarLoop]: === Iteration 14 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:45,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1656548386, now seen corresponding path program 1 times [2018-02-02 09:07:45,740 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:45,740 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:45,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:45,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:45,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:45,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:45,955 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-02 09:07:45,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:45,956 INFO L209 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-02 09:07:45,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:46,000 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:46,007 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-02 09:07:46,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:07:46,022 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-02 09:07:46,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,028 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:46,029 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:46,030 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-02 09:07:46,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-02 09:07:46,043 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-02 09:07:46,046 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-02 09:07:46,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,055 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-02 09:07:46,057 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-02 09:07:46,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,063 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-02 09:07:46,063 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-02-02 09:07:46,116 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-02 09:07:46,119 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-02 09:07:46,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,136 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-02 09:07:46,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 1 [2018-02-02 09:07:46,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,148 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-02 09:07:46,149 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:119, output treesize:37 [2018-02-02 09:07:46,179 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-02 09:07:46,180 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-02 09:07:46,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,188 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-02 09:07:46,190 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-02 09:07:46,190 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:46,196 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-02 09:07:46,197 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:15 [2018-02-02 09:07:46,212 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-02 09:07:46,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:46,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-02-02 09:07:46,229 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:07:46,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:07:46,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:07:46,230 INFO L87 Difference]: Start difference. First operand 274 states and 315 transitions. Second operand 16 states. [2018-02-02 09:07:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:46,934 INFO L93 Difference]: Finished difference Result 287 states and 325 transitions. [2018-02-02 09:07:47,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:07:47,263 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-02-02 09:07:47,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:47,265 INFO L225 Difference]: With dead ends: 287 [2018-02-02 09:07:47,265 INFO L226 Difference]: Without dead ends: 287 [2018-02-02 09:07:47,265 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:07:47,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-02-02 09:07:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 267. [2018-02-02 09:07:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-02-02 09:07:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 307 transitions. [2018-02-02 09:07:47,270 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 307 transitions. Word has length 39 [2018-02-02 09:07:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:47,270 INFO L432 AbstractCegarLoop]: Abstraction has 267 states and 307 transitions. [2018-02-02 09:07:47,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:07:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 307 transitions. [2018-02-02 09:07:47,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:07:47,279 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:47,279 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:47,279 INFO L371 AbstractCegarLoop]: === Iteration 15 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:47,279 INFO L82 PathProgramCache]: Analyzing trace with hash -454195015, now seen corresponding path program 1 times [2018-02-02 09:07:47,279 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:47,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:47,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:47,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:47,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:47,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:07:47,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:47,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:07:47,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:07:47,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:07:47,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:07:47,334 INFO L87 Difference]: Start difference. First operand 267 states and 307 transitions. Second operand 4 states. [2018-02-02 09:07:47,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:47,452 INFO L93 Difference]: Finished difference Result 269 states and 301 transitions. [2018-02-02 09:07:47,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:07:47,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-02-02 09:07:47,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:47,455 INFO L225 Difference]: With dead ends: 269 [2018-02-02 09:07:47,455 INFO L226 Difference]: Without dead ends: 269 [2018-02-02 09:07:47,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:47,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-02-02 09:07:47,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 263. [2018-02-02 09:07:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-02-02 09:07:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 295 transitions. [2018-02-02 09:07:47,459 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 295 transitions. Word has length 52 [2018-02-02 09:07:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:47,459 INFO L432 AbstractCegarLoop]: Abstraction has 263 states and 295 transitions. [2018-02-02 09:07:47,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:07:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 295 transitions. [2018-02-02 09:07:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-02-02 09:07:47,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:47,460 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:47,460 INFO L371 AbstractCegarLoop]: === Iteration 16 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:47,460 INFO L82 PathProgramCache]: Analyzing trace with hash -454195014, now seen corresponding path program 1 times [2018-02-02 09:07:47,460 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:47,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:47,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:47,461 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:47,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:47,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 09:07:47,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:47,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:07:47,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:07:47,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:07:47,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:07:47,509 INFO L87 Difference]: Start difference. First operand 263 states and 295 transitions. Second operand 4 states. [2018-02-02 09:07:47,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:47,644 INFO L93 Difference]: Finished difference Result 265 states and 289 transitions. [2018-02-02 09:07:47,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:07:47,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-02-02 09:07:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:47,646 INFO L225 Difference]: With dead ends: 265 [2018-02-02 09:07:47,646 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 09:07:47,646 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 09:07:47,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2018-02-02 09:07:47,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-02 09:07:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 283 transitions. [2018-02-02 09:07:47,652 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 283 transitions. Word has length 52 [2018-02-02 09:07:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:47,652 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 283 transitions. [2018-02-02 09:07:47,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:07:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 283 transitions. [2018-02-02 09:07:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-02-02 09:07:47,653 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:47,653 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:47,653 INFO L371 AbstractCegarLoop]: === Iteration 17 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:47,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1196031142, now seen corresponding path program 1 times [2018-02-02 09:07:47,653 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:47,653 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:47,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:47,654 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:47,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:47,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:47,695 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:47,695 INFO L209 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-02 09:07:47,703 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:47,733 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:47,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:47,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-02-02 09:07:47,774 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:07:47,774 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:07:47,774 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:47,775 INFO L87 Difference]: Start difference. First operand 259 states and 283 transitions. Second operand 5 states. [2018-02-02 09:07:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:47,788 INFO L93 Difference]: Finished difference Result 283 states and 307 transitions. [2018-02-02 09:07:47,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:07:47,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-02-02 09:07:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:47,790 INFO L225 Difference]: With dead ends: 283 [2018-02-02 09:07:47,790 INFO L226 Difference]: Without dead ends: 283 [2018-02-02 09:07:47,790 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:47,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-02-02 09:07:47,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 273. [2018-02-02 09:07:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-02-02 09:07:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 297 transitions. [2018-02-02 09:07:47,794 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 297 transitions. Word has length 53 [2018-02-02 09:07:47,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:47,794 INFO L432 AbstractCegarLoop]: Abstraction has 273 states and 297 transitions. [2018-02-02 09:07:47,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:07:47,795 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 297 transitions. [2018-02-02 09:07:47,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 09:07:47,795 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:47,795 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:07:47,795 INFO L371 AbstractCegarLoop]: === Iteration 18 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:47,796 INFO L82 PathProgramCache]: Analyzing trace with hash -376979009, now seen corresponding path program 2 times [2018-02-02 09:07:47,796 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:47,796 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:47,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:47,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:47,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:47,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:07:47,845 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:47,845 INFO L209 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-02 09:07:47,850 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 09:07:47,868 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 09:07:47,871 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 09:07:47,875 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:47,899 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store |c_old(#valid)| |create_data_#t~malloc3.base| 1)))) is different from true [2018-02-02 09:07:47,903 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base| 1)))) is different from true [2018-02-02 09:07:47,940 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:47,941 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:47,942 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-02-02 09:07:47,947 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 23 treesize of output 20 [2018-02-02 09:07:47,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:47,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:47,957 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-02 09:07:47,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-02-02 09:07:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-02-02 09:07:47,997 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:07:47,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2018-02-02 09:07:47,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:07:47,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:07:47,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=55, Unknown=2, NotChecked=30, Total=110 [2018-02-02 09:07:47,997 INFO L87 Difference]: Start difference. First operand 273 states and 297 transitions. Second operand 11 states. [2018-02-02 09:07:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:48,366 INFO L93 Difference]: Finished difference Result 337 states and 370 transitions. [2018-02-02 09:07:48,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:07:48,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2018-02-02 09:07:48,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:48,368 INFO L225 Difference]: With dead ends: 337 [2018-02-02 09:07:48,368 INFO L226 Difference]: Without dead ends: 337 [2018-02-02 09:07:48,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=8, NotChecked=42, Total=182 [2018-02-02 09:07:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-02-02 09:07:48,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 305. [2018-02-02 09:07:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-02-02 09:07:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 335 transitions. [2018-02-02 09:07:48,371 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 335 transitions. Word has length 60 [2018-02-02 09:07:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:48,371 INFO L432 AbstractCegarLoop]: Abstraction has 305 states and 335 transitions. [2018-02-02 09:07:48,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:07:48,372 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 335 transitions. [2018-02-02 09:07:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 09:07:48,372 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:48,372 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:48,372 INFO L371 AbstractCegarLoop]: === Iteration 19 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:48,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1991964603, now seen corresponding path program 1 times [2018-02-02 09:07:48,372 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:48,372 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:48,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:48,373 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 09:07:48,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:48,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:48,608 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:48,608 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:07:48,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 09:07:48,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 09:07:48,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:07:48,609 INFO L87 Difference]: Start difference. First operand 305 states and 335 transitions. Second operand 11 states. [2018-02-02 09:07:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:49,346 INFO L93 Difference]: Finished difference Result 328 states and 357 transitions. [2018-02-02 09:07:49,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:07:49,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-02-02 09:07:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:49,349 INFO L225 Difference]: With dead ends: 328 [2018-02-02 09:07:49,349 INFO L226 Difference]: Without dead ends: 328 [2018-02-02 09:07:49,349 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:07:49,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-02-02 09:07:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 317. [2018-02-02 09:07:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-02-02 09:07:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 349 transitions. [2018-02-02 09:07:49,356 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 349 transitions. Word has length 67 [2018-02-02 09:07:49,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:49,357 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 349 transitions. [2018-02-02 09:07:49,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 09:07:49,357 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 349 transitions. [2018-02-02 09:07:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 09:07:49,357 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:49,357 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:49,358 INFO L371 AbstractCegarLoop]: === Iteration 20 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:49,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1031805431, now seen corresponding path program 1 times [2018-02-02 09:07:49,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:49,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:49,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:49,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:49,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:49,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:49,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:49,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:07:49,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:07:49,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:07:49,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:07:49,397 INFO L87 Difference]: Start difference. First operand 317 states and 349 transitions. Second operand 4 states. [2018-02-02 09:07:49,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:49,412 INFO L93 Difference]: Finished difference Result 325 states and 355 transitions. [2018-02-02 09:07:49,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:07:49,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-02-02 09:07:49,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:49,414 INFO L225 Difference]: With dead ends: 325 [2018-02-02 09:07:49,414 INFO L226 Difference]: Without dead ends: 325 [2018-02-02 09:07:49,414 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:49,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-02-02 09:07:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2018-02-02 09:07:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-02 09:07:49,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 353 transitions. [2018-02-02 09:07:49,419 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 353 transitions. Word has length 69 [2018-02-02 09:07:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:49,419 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 353 transitions. [2018-02-02 09:07:49,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:07:49,419 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 353 transitions. [2018-02-02 09:07:49,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 09:07:49,420 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:49,420 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:49,420 INFO L371 AbstractCegarLoop]: === Iteration 21 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:49,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1277423575, now seen corresponding path program 1 times [2018-02-02 09:07:49,420 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:49,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:49,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:49,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:49,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:49,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:49,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:49,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:07:49,654 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:07:49,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:07:49,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:07:49,655 INFO L87 Difference]: Start difference. First operand 323 states and 353 transitions. Second operand 8 states. [2018-02-02 09:07:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:50,115 INFO L93 Difference]: Finished difference Result 330 states and 356 transitions. [2018-02-02 09:07:50,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:07:50,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-02-02 09:07:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:50,117 INFO L225 Difference]: With dead ends: 330 [2018-02-02 09:07:50,117 INFO L226 Difference]: Without dead ends: 330 [2018-02-02 09:07:50,117 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:07:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-02-02 09:07:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 326. [2018-02-02 09:07:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-02-02 09:07:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 356 transitions. [2018-02-02 09:07:50,121 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 356 transitions. Word has length 69 [2018-02-02 09:07:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:50,121 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 356 transitions. [2018-02-02 09:07:50,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:07:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 356 transitions. [2018-02-02 09:07:50,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 09:07:50,121 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:50,121 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:50,121 INFO L371 AbstractCegarLoop]: === Iteration 22 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:50,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1277423574, now seen corresponding path program 1 times [2018-02-02 09:07:50,122 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:50,122 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:50,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:50,122 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:50,122 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:50,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:50,353 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:50,353 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 09:07:50,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 09:07:50,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 09:07:50,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:07:50,354 INFO L87 Difference]: Start difference. First operand 326 states and 356 transitions. Second operand 12 states. [2018-02-02 09:07:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:50,896 INFO L93 Difference]: Finished difference Result 327 states and 353 transitions. [2018-02-02 09:07:50,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 09:07:50,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 69 [2018-02-02 09:07:50,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:50,898 INFO L225 Difference]: With dead ends: 327 [2018-02-02 09:07:50,898 INFO L226 Difference]: Without dead ends: 327 [2018-02-02 09:07:50,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-02-02 09:07:50,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-02-02 09:07:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-02-02 09:07:50,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-02 09:07:50,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 353 transitions. [2018-02-02 09:07:50,904 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 353 transitions. Word has length 69 [2018-02-02 09:07:50,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:50,904 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 353 transitions. [2018-02-02 09:07:50,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 09:07:50,904 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 353 transitions. [2018-02-02 09:07:50,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 09:07:50,905 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:50,905 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:50,905 INFO L371 AbstractCegarLoop]: === Iteration 23 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:50,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2058926999, now seen corresponding path program 1 times [2018-02-02 09:07:50,905 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:50,906 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:50,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:50,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:50,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:50,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:50,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:50,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:07:50,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:07:50,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:07:50,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:07:50,979 INFO L87 Difference]: Start difference. First operand 325 states and 353 transitions. Second operand 6 states. [2018-02-02 09:07:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:51,094 INFO L93 Difference]: Finished difference Result 373 states and 406 transitions. [2018-02-02 09:07:51,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 09:07:51,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-02-02 09:07:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:51,096 INFO L225 Difference]: With dead ends: 373 [2018-02-02 09:07:51,096 INFO L226 Difference]: Without dead ends: 373 [2018-02-02 09:07:51,096 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:07:51,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-02-02 09:07:51,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 336. [2018-02-02 09:07:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-02-02 09:07:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 365 transitions. [2018-02-02 09:07:51,102 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 365 transitions. Word has length 69 [2018-02-02 09:07:51,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:51,102 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 365 transitions. [2018-02-02 09:07:51,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:07:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 365 transitions. [2018-02-02 09:07:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 09:07:51,103 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:51,103 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:51,103 INFO L371 AbstractCegarLoop]: === Iteration 24 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:51,103 INFO L82 PathProgramCache]: Analyzing trace with hash 958159508, now seen corresponding path program 1 times [2018-02-02 09:07:51,103 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:51,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:51,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:51,104 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:51,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:51,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:51,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:51,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:07:51,303 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:07:51,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:07:51,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:07:51,303 INFO L87 Difference]: Start difference. First operand 336 states and 365 transitions. Second operand 9 states. [2018-02-02 09:07:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:52,119 INFO L93 Difference]: Finished difference Result 338 states and 366 transitions. [2018-02-02 09:07:52,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:07:52,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2018-02-02 09:07:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:52,121 INFO L225 Difference]: With dead ends: 338 [2018-02-02 09:07:52,121 INFO L226 Difference]: Without dead ends: 338 [2018-02-02 09:07:52,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:07:52,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-02 09:07:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 324. [2018-02-02 09:07:52,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-02-02 09:07:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 350 transitions. [2018-02-02 09:07:52,125 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 350 transitions. Word has length 71 [2018-02-02 09:07:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:52,126 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 350 transitions. [2018-02-02 09:07:52,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:07:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 350 transitions. [2018-02-02 09:07:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 09:07:52,126 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:52,126 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:52,126 INFO L371 AbstractCegarLoop]: === Iteration 25 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:52,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1979750098, now seen corresponding path program 1 times [2018-02-02 09:07:52,126 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:52,127 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:52,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:52,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:52,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:52,135 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:52,165 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:52,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:07:52,165 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:07:52,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:07:52,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:52,166 INFO L87 Difference]: Start difference. First operand 324 states and 350 transitions. Second operand 5 states. [2018-02-02 09:07:52,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:52,307 INFO L93 Difference]: Finished difference Result 323 states and 349 transitions. [2018-02-02 09:07:52,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:07:52,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2018-02-02 09:07:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:52,309 INFO L225 Difference]: With dead ends: 323 [2018-02-02 09:07:52,309 INFO L226 Difference]: Without dead ends: 323 [2018-02-02 09:07:52,309 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-02 09:07:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-02-02 09:07:52,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-02-02 09:07:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-02-02 09:07:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 349 transitions. [2018-02-02 09:07:52,314 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 349 transitions. Word has length 72 [2018-02-02 09:07:52,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:52,314 INFO L432 AbstractCegarLoop]: Abstraction has 323 states and 349 transitions. [2018-02-02 09:07:52,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:07:52,316 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 349 transitions. [2018-02-02 09:07:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 09:07:52,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:52,317 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:52,317 INFO L371 AbstractCegarLoop]: === Iteration 26 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:52,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1979750099, now seen corresponding path program 1 times [2018-02-02 09:07:52,317 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:52,317 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:52,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:52,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:52,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:52,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:52,455 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:52,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:52,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:07:52,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 09:07:52,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 09:07:52,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 09:07:52,456 INFO L87 Difference]: Start difference. First operand 323 states and 349 transitions. Second operand 6 states. [2018-02-02 09:07:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:52,608 INFO L93 Difference]: Finished difference Result 318 states and 344 transitions. [2018-02-02 09:07:52,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:07:52,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-02-02 09:07:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:52,609 INFO L225 Difference]: With dead ends: 318 [2018-02-02 09:07:52,609 INFO L226 Difference]: Without dead ends: 318 [2018-02-02 09:07:52,610 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-02 09:07:52,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-02-02 09:07:52,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-02-02 09:07:52,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-02-02 09:07:52,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 344 transitions. [2018-02-02 09:07:52,612 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 344 transitions. Word has length 72 [2018-02-02 09:07:52,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:52,612 INFO L432 AbstractCegarLoop]: Abstraction has 318 states and 344 transitions. [2018-02-02 09:07:52,613 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 09:07:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 344 transitions. [2018-02-02 09:07:52,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 09:07:52,613 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:52,613 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:52,613 INFO L371 AbstractCegarLoop]: === Iteration 27 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:52,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1242711023, now seen corresponding path program 1 times [2018-02-02 09:07:52,614 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:52,614 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:52,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:52,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:52,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:52,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:52,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:52,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:07:52,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:07:52,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:07:52,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:07:52,816 INFO L87 Difference]: Start difference. First operand 318 states and 344 transitions. Second operand 9 states. [2018-02-02 09:07:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:53,071 INFO L93 Difference]: Finished difference Result 342 states and 370 transitions. [2018-02-02 09:07:53,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:07:53,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2018-02-02 09:07:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:53,072 INFO L225 Difference]: With dead ends: 342 [2018-02-02 09:07:53,072 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 09:07:53,073 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:07:53,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 09:07:53,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 317. [2018-02-02 09:07:53,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-02-02 09:07:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 343 transitions. [2018-02-02 09:07:53,078 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 343 transitions. Word has length 73 [2018-02-02 09:07:53,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:53,078 INFO L432 AbstractCegarLoop]: Abstraction has 317 states and 343 transitions. [2018-02-02 09:07:53,078 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:07:53,078 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 343 transitions. [2018-02-02 09:07:53,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 09:07:53,079 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:53,080 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:53,091 INFO L371 AbstractCegarLoop]: === Iteration 28 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:53,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1242711022, now seen corresponding path program 1 times [2018-02-02 09:07:53,091 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:53,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:53,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:53,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:53,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:53,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:53,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:53,180 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:07:53,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:07:53,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:07:53,181 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:07:53,181 INFO L87 Difference]: Start difference. First operand 317 states and 343 transitions. Second operand 7 states. [2018-02-02 09:07:53,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:53,508 INFO L93 Difference]: Finished difference Result 331 states and 359 transitions. [2018-02-02 09:07:53,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:07:53,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-02-02 09:07:53,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:53,512 INFO L225 Difference]: With dead ends: 331 [2018-02-02 09:07:53,512 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 09:07:53,512 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-02 09:07:53,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 09:07:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 316. [2018-02-02 09:07:53,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-02 09:07:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 342 transitions. [2018-02-02 09:07:53,517 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 342 transitions. Word has length 73 [2018-02-02 09:07:53,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:53,517 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 342 transitions. [2018-02-02 09:07:53,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:07:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 342 transitions. [2018-02-02 09:07:53,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 09:07:53,518 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:53,518 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:53,518 INFO L371 AbstractCegarLoop]: === Iteration 29 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:53,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1366281868, now seen corresponding path program 1 times [2018-02-02 09:07:53,518 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:53,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:53,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:53,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:53,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:53,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:53,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:53,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:07:53,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:07:53,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:07:53,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:07:53,578 INFO L87 Difference]: Start difference. First operand 316 states and 342 transitions. Second operand 5 states. [2018-02-02 09:07:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:53,731 INFO L93 Difference]: Finished difference Result 331 states and 359 transitions. [2018-02-02 09:07:53,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:07:53,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-02-02 09:07:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:53,732 INFO L225 Difference]: With dead ends: 331 [2018-02-02 09:07:53,732 INFO L226 Difference]: Without dead ends: 331 [2018-02-02 09:07:53,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:07:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-02-02 09:07:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 315. [2018-02-02 09:07:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-02-02 09:07:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 341 transitions. [2018-02-02 09:07:53,737 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 341 transitions. Word has length 77 [2018-02-02 09:07:53,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:53,738 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 341 transitions. [2018-02-02 09:07:53,738 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:07:53,738 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 341 transitions. [2018-02-02 09:07:53,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-02-02 09:07:53,738 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:53,739 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:53,739 INFO L371 AbstractCegarLoop]: === Iteration 30 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:53,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1366281867, now seen corresponding path program 1 times [2018-02-02 09:07:53,739 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:53,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:53,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:53,740 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:53,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:53,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:54,193 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:54,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-02-02 09:07:54,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 09:07:54,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 09:07:54,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-02-02 09:07:54,194 INFO L87 Difference]: Start difference. First operand 315 states and 341 transitions. Second operand 15 states. [2018-02-02 09:07:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:55,073 INFO L93 Difference]: Finished difference Result 367 states and 402 transitions. [2018-02-02 09:07:55,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 09:07:55,073 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 77 [2018-02-02 09:07:55,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:55,074 INFO L225 Difference]: With dead ends: 367 [2018-02-02 09:07:55,074 INFO L226 Difference]: Without dead ends: 367 [2018-02-02 09:07:55,075 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2018-02-02 09:07:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-02-02 09:07:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 324. [2018-02-02 09:07:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-02-02 09:07:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 353 transitions. [2018-02-02 09:07:55,080 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 353 transitions. Word has length 77 [2018-02-02 09:07:55,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:55,080 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 353 transitions. [2018-02-02 09:07:55,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 09:07:55,080 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 353 transitions. [2018-02-02 09:07:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 09:07:55,081 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:55,081 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:55,081 INFO L371 AbstractCegarLoop]: === Iteration 31 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:55,081 INFO L82 PathProgramCache]: Analyzing trace with hash 594935193, now seen corresponding path program 1 times [2018-02-02 09:07:55,081 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:55,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:55,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:55,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:55,082 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:55,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:55,294 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:55,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-02-02 09:07:55,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:07:55,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:07:55,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:07:55,294 INFO L87 Difference]: Start difference. First operand 324 states and 353 transitions. Second operand 16 states. [2018-02-02 09:07:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:56,082 INFO L93 Difference]: Finished difference Result 366 states and 404 transitions. [2018-02-02 09:07:56,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:07:56,083 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 78 [2018-02-02 09:07:56,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:56,084 INFO L225 Difference]: With dead ends: 366 [2018-02-02 09:07:56,084 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 09:07:56,084 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2018-02-02 09:07:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 09:07:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 327. [2018-02-02 09:07:56,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 09:07:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 359 transitions. [2018-02-02 09:07:56,087 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 359 transitions. Word has length 78 [2018-02-02 09:07:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:56,087 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 359 transitions. [2018-02-02 09:07:56,087 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:07:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 359 transitions. [2018-02-02 09:07:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-02-02 09:07:56,088 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:56,088 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:56,088 INFO L371 AbstractCegarLoop]: === Iteration 32 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:56,088 INFO L82 PathProgramCache]: Analyzing trace with hash 594935194, now seen corresponding path program 1 times [2018-02-02 09:07:56,088 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:56,088 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:56,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:56,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:56,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:56,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:56,360 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:07:56,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 09:07:56,361 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:07:56,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:07:56,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:07:56,361 INFO L87 Difference]: Start difference. First operand 327 states and 359 transitions. Second operand 18 states. [2018-02-02 09:07:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:57,204 INFO L93 Difference]: Finished difference Result 371 states and 408 transitions. [2018-02-02 09:07:57,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:07:57,205 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-02-02 09:07:57,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:57,206 INFO L225 Difference]: With dead ends: 371 [2018-02-02 09:07:57,206 INFO L226 Difference]: Without dead ends: 371 [2018-02-02 09:07:57,206 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:07:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-02-02 09:07:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 327. [2018-02-02 09:07:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 09:07:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 358 transitions. [2018-02-02 09:07:57,210 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 358 transitions. Word has length 78 [2018-02-02 09:07:57,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:57,211 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 358 transitions. [2018-02-02 09:07:57,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:07:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 358 transitions. [2018-02-02 09:07:57,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 09:07:57,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:57,212 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:57,212 INFO L371 AbstractCegarLoop]: === Iteration 33 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:57,212 INFO L82 PathProgramCache]: Analyzing trace with hash 970917957, now seen corresponding path program 1 times [2018-02-02 09:07:57,212 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:57,212 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:57,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:57,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:57,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:57,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:57,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:57,875 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:57,875 INFO L209 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-02 09:07:57,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:57,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:07:57,990 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 13 treesize of output 10 [2018-02-02 09:07:57,998 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-02 09:07:57,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:58,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:58,005 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-02 09:07:58,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2018-02-02 09:07:58,037 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 30 treesize of output 26 [2018-02-02 09:07:58,039 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-02-02 09:07:58,040 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-02 09:07:58,044 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-02 09:07:58,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:07:58,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:23 [2018-02-02 09:07:58,060 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_12 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= (store .cse0 v_arrayElimCell_12 1) |c_#valid|) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 v_arrayElimCell_12) 0)))) is different from true [2018-02-02 09:07:58,098 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_12 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 v_arrayElimCell_12 1))) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 v_arrayElimCell_12) 0) (= 0 (select .cse1 |c_create_data_#t~malloc24.base|)) (= |c_#valid| (store .cse1 |c_create_data_#t~malloc24.base| 1)))))) is different from true [2018-02-02 09:07:58,102 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (|create_data_#t~malloc24.base| Int) (v_arrayElimCell_12 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (let ((.cse1 (store .cse0 v_arrayElimCell_12 1))) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 v_arrayElimCell_12) 0) (= 0 (select .cse1 |create_data_#t~malloc24.base|)) (= |c_#valid| (store .cse1 |create_data_#t~malloc24.base| 1)))))) is different from true [2018-02-02 09:07:58,128 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:58,129 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:58,131 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:58,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 51 [2018-02-02 09:07:58,149 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:58,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:58,150 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:58,151 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:07:58,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 59 [2018-02-02 09:07:58,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 51 [2018-02-02 09:07:58,155 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:07:58,164 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:58,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:07:58,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 09:07:58,179 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:42, output treesize:45 [2018-02-02 09:07:58,208 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 11 not checked. [2018-02-02 09:07:58,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:07:58,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-02-02 09:07:58,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:07:58,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:07:58,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=231, Unknown=3, NotChecked=102, Total=420 [2018-02-02 09:07:58,227 INFO L87 Difference]: Start difference. First operand 327 states and 358 transitions. Second operand 21 states. [2018-02-02 09:07:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:07:59,475 INFO L93 Difference]: Finished difference Result 365 states and 399 transitions. [2018-02-02 09:07:59,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:07:59,476 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-02-02 09:07:59,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:07:59,477 INFO L225 Difference]: With dead ends: 365 [2018-02-02 09:07:59,477 INFO L226 Difference]: Without dead ends: 365 [2018-02-02 09:07:59,477 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=181, Invalid=578, Unknown=9, NotChecked=162, Total=930 [2018-02-02 09:07:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-02 09:07:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 347. [2018-02-02 09:07:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-02-02 09:07:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 382 transitions. [2018-02-02 09:07:59,481 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 382 transitions. Word has length 82 [2018-02-02 09:07:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:07:59,481 INFO L432 AbstractCegarLoop]: Abstraction has 347 states and 382 transitions. [2018-02-02 09:07:59,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:07:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 382 transitions. [2018-02-02 09:07:59,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 09:07:59,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:07:59,482 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:07:59,482 INFO L371 AbstractCegarLoop]: === Iteration 34 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:07:59,482 INFO L82 PathProgramCache]: Analyzing trace with hash 970917958, now seen corresponding path program 1 times [2018-02-02 09:07:59,482 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:07:59,482 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:07:59,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:59,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:59,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:07:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:59,508 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:07:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:07:59,936 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:07:59,936 INFO L209 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-02 09:07:59,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:07:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:07:59,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:08:00,060 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 13 treesize of output 10 [2018-02-02 09:08:00,062 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-02 09:08:00,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:00,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:00,069 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-02 09:08:00,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:50 [2018-02-02 09:08:00,093 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 45 treesize of output 39 [2018-02-02 09:08:00,095 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-02-02 09:08:00,096 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-02 09:08:00,099 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-02 09:08:00,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:08:00,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:32 [2018-02-02 09:08:00,160 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_15 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_15 80) |c_create_data_#t~malloc24.base| 16) |c_#length|) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 v_arrayElimCell_15) 0) (= (select (store .cse0 v_arrayElimCell_15 1) |c_create_data_#t~malloc24.base|) 0)))) is different from true [2018-02-02 09:08:00,164 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_15 Int) (|create_data_#t~malloc24.base| Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_15 80) |create_data_#t~malloc24.base| 16) |c_#length|) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select .cse0 v_arrayElimCell_15) 0) (= (select (store .cse0 v_arrayElimCell_15 1) |create_data_#t~malloc24.base|) 0)))) is different from true [2018-02-02 09:08:00,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,221 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-02-02 09:08:00,225 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,226 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-02-02 09:08:00,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,230 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,231 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 53 [2018-02-02 09:08:00,234 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:00,243 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:00,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:00,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,260 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 27 treesize of output 42 [2018-02-02 09:08:00,278 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,280 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,280 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,281 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,282 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:00,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-02-02 09:08:00,283 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:00,290 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:00,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 09:08:00,302 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2018-02-02 09:08:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 3 not checked. [2018-02-02 09:08:00,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:08:00,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2018-02-02 09:08:00,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 09:08:00,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 09:08:00,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=346, Unknown=4, NotChecked=78, Total=506 [2018-02-02 09:08:00,400 INFO L87 Difference]: Start difference. First operand 347 states and 382 transitions. Second operand 23 states. [2018-02-02 09:08:02,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:02,275 INFO L93 Difference]: Finished difference Result 363 states and 397 transitions. [2018-02-02 09:08:02,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 09:08:02,275 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 82 [2018-02-02 09:08:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:02,276 INFO L225 Difference]: With dead ends: 363 [2018-02-02 09:08:02,279 INFO L226 Difference]: Without dead ends: 363 [2018-02-02 09:08:02,279 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=154, Invalid=779, Unknown=5, NotChecked=118, Total=1056 [2018-02-02 09:08:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-02-02 09:08:02,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 347. [2018-02-02 09:08:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-02-02 09:08:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 380 transitions. [2018-02-02 09:08:02,286 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 380 transitions. Word has length 82 [2018-02-02 09:08:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:02,286 INFO L432 AbstractCegarLoop]: Abstraction has 347 states and 380 transitions. [2018-02-02 09:08:02,286 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 09:08:02,286 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 380 transitions. [2018-02-02 09:08:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 09:08:02,287 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:02,287 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:02,287 INFO L371 AbstractCegarLoop]: === Iteration 35 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:02,287 INFO L82 PathProgramCache]: Analyzing trace with hash 971805609, now seen corresponding path program 1 times [2018-02-02 09:08:02,287 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:02,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:02,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:02,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:02,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:02,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:02,379 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:08:02,379 INFO L209 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-02 09:08:02,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:02,433 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:08:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 09:08:02,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:02,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:02,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-02 09:08:02,463 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:02,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:08:02,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-02-02 09:08:02,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:08:02,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:08:02,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:08:02,494 INFO L87 Difference]: Start difference. First operand 347 states and 380 transitions. Second operand 9 states. [2018-02-02 09:08:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:02,696 INFO L93 Difference]: Finished difference Result 348 states and 380 transitions. [2018-02-02 09:08:02,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:08:02,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2018-02-02 09:08:02,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:02,697 INFO L225 Difference]: With dead ends: 348 [2018-02-02 09:08:02,697 INFO L226 Difference]: Without dead ends: 348 [2018-02-02 09:08:02,697 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:08:02,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-02-02 09:08:02,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2018-02-02 09:08:02,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-02-02 09:08:02,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 378 transitions. [2018-02-02 09:08:02,701 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 378 transitions. Word has length 82 [2018-02-02 09:08:02,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:02,702 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 378 transitions. [2018-02-02 09:08:02,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:08:02,702 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 378 transitions. [2018-02-02 09:08:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 09:08:02,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:02,702 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:02,703 INFO L371 AbstractCegarLoop]: === Iteration 36 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash 971805610, now seen corresponding path program 1 times [2018-02-02 09:08:02,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:02,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:02,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:02,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:02,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:02,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:02,778 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:02,778 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:08:02,779 INFO L209 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-02 09:08:02,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:02,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:08:02,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 09:08:02,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:02,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:02,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 09:08:02,856 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 19 treesize of output 14 [2018-02-02 09:08:02,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:02,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:02,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:17 [2018-02-02 09:08:02,877 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:02,899 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:08:02,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 9 [2018-02-02 09:08:02,899 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:08:02,899 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:08:02,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:08:02,900 INFO L87 Difference]: Start difference. First operand 346 states and 378 transitions. Second operand 10 states. [2018-02-02 09:08:03,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:03,150 INFO L93 Difference]: Finished difference Result 342 states and 370 transitions. [2018-02-02 09:08:03,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:08:03,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 82 [2018-02-02 09:08:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:03,151 INFO L225 Difference]: With dead ends: 342 [2018-02-02 09:08:03,151 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 09:08:03,151 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-02-02 09:08:03,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 09:08:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2018-02-02 09:08:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-02-02 09:08:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 370 transitions. [2018-02-02 09:08:03,153 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 370 transitions. Word has length 82 [2018-02-02 09:08:03,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:03,154 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 370 transitions. [2018-02-02 09:08:03,154 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:08:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 370 transitions. [2018-02-02 09:08:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 09:08:03,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:03,154 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:03,154 INFO L371 AbstractCegarLoop]: === Iteration 37 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:03,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1963665844, now seen corresponding path program 1 times [2018-02-02 09:08:03,154 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:03,154 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:03,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:03,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:03,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:03,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:03,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:03,224 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:08:03,224 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:08:03,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:08:03,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:08:03,224 INFO L87 Difference]: Start difference. First operand 342 states and 370 transitions. Second operand 3 states. [2018-02-02 09:08:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:03,272 INFO L93 Difference]: Finished difference Result 343 states and 371 transitions. [2018-02-02 09:08:03,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:08:03,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-02-02 09:08:03,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:03,274 INFO L225 Difference]: With dead ends: 343 [2018-02-02 09:08:03,274 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 09:08:03,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:08:03,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 09:08:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-02-02 09:08:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-02 09:08:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 371 transitions. [2018-02-02 09:08:03,279 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 371 transitions. Word has length 84 [2018-02-02 09:08:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:03,279 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 371 transitions. [2018-02-02 09:08:03,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:08:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 371 transitions. [2018-02-02 09:08:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 09:08:03,280 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:03,280 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:03,280 INFO L371 AbstractCegarLoop]: === Iteration 38 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:03,281 INFO L82 PathProgramCache]: Analyzing trace with hash -137622663, now seen corresponding path program 1 times [2018-02-02 09:08:03,281 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:03,281 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:03,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:03,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:03,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:03,293 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:03,382 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:03,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 09:08:03,383 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:08:03,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:08:03,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:08:03,383 INFO L87 Difference]: Start difference. First operand 343 states and 371 transitions. Second operand 5 states. [2018-02-02 09:08:03,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:03,436 INFO L93 Difference]: Finished difference Result 403 states and 441 transitions. [2018-02-02 09:08:03,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:08:03,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-02-02 09:08:03,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:03,438 INFO L225 Difference]: With dead ends: 403 [2018-02-02 09:08:03,438 INFO L226 Difference]: Without dead ends: 403 [2018-02-02 09:08:03,438 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-02 09:08:03,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-02-02 09:08:03,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 346. [2018-02-02 09:08:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-02-02 09:08:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 374 transitions. [2018-02-02 09:08:03,443 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 374 transitions. Word has length 85 [2018-02-02 09:08:03,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:03,443 INFO L432 AbstractCegarLoop]: Abstraction has 346 states and 374 transitions. [2018-02-02 09:08:03,443 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:08:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 374 transitions. [2018-02-02 09:08:03,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 09:08:03,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:03,444 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:03,444 INFO L371 AbstractCegarLoop]: === Iteration 39 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:03,444 INFO L82 PathProgramCache]: Analyzing trace with hash -188658482, now seen corresponding path program 1 times [2018-02-02 09:08:03,444 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:03,444 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:03,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:03,445 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:03,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:03,456 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:03,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:03,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:08:03,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:08:03,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:08:03,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:08:03,486 INFO L87 Difference]: Start difference. First operand 346 states and 374 transitions. Second operand 5 states. [2018-02-02 09:08:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:03,627 INFO L93 Difference]: Finished difference Result 360 states and 390 transitions. [2018-02-02 09:08:03,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:08:03,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-02-02 09:08:03,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:03,636 INFO L225 Difference]: With dead ends: 360 [2018-02-02 09:08:03,637 INFO L226 Difference]: Without dead ends: 360 [2018-02-02 09:08:03,637 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-02 09:08:03,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-02-02 09:08:03,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 351. [2018-02-02 09:08:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-02 09:08:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 381 transitions. [2018-02-02 09:08:03,642 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 381 transitions. Word has length 84 [2018-02-02 09:08:03,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:03,645 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 381 transitions. [2018-02-02 09:08:03,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:08:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 381 transitions. [2018-02-02 09:08:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 09:08:03,646 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:03,646 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:03,646 INFO L371 AbstractCegarLoop]: === Iteration 40 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash -188658481, now seen corresponding path program 1 times [2018-02-02 09:08:03,646 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:03,647 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:03,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:03,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:03,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:03,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:04,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:04,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 09:08:04,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:08:04,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:08:04,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:08:04,065 INFO L87 Difference]: Start difference. First operand 351 states and 381 transitions. Second operand 17 states. [2018-02-02 09:08:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:04,815 INFO L93 Difference]: Finished difference Result 392 states and 427 transitions. [2018-02-02 09:08:04,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 09:08:04,816 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-02-02 09:08:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:04,817 INFO L225 Difference]: With dead ends: 392 [2018-02-02 09:08:04,817 INFO L226 Difference]: Without dead ends: 392 [2018-02-02 09:08:04,817 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 09:08:04,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-02-02 09:08:04,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 351. [2018-02-02 09:08:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-02-02 09:08:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 380 transitions. [2018-02-02 09:08:04,820 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 380 transitions. Word has length 84 [2018-02-02 09:08:04,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:04,820 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 380 transitions. [2018-02-02 09:08:04,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:08:04,820 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 380 transitions. [2018-02-02 09:08:04,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 09:08:04,821 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:04,821 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:04,821 INFO L371 AbstractCegarLoop]: === Iteration 41 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:04,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1044261364, now seen corresponding path program 1 times [2018-02-02 09:08:04,822 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:04,822 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:04,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:04,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:04,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:04,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:05,449 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:08:05,449 INFO L209 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-02 09:08:05,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:05,478 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:08:05,507 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 13 treesize of output 10 [2018-02-02 09:08:05,508 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-02 09:08:05,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:05,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:05,514 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-02 09:08:05,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:30 [2018-02-02 09:08:05,529 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 30 treesize of output 26 [2018-02-02 09:08:05,531 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-02-02 09:08:05,531 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-02 09:08:05,550 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-02 09:08:05,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:08:05,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-02-02 09:08:05,555 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_18 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= |c_#valid| (store .cse0 v_arrayElimCell_18 1)) (= 0 (select .cse0 v_arrayElimCell_18))))) is different from true [2018-02-02 09:08:05,576 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_18 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= 0 (select .cse0 v_arrayElimCell_18)) (= (store (store .cse0 v_arrayElimCell_18 1) |c_create_data_#t~malloc24.base| 1) |c_#valid|)))) is different from true [2018-02-02 09:08:05,580 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_18 Int)) (let ((.cse0 (store |c_old(#valid)| create_data_~data~0.base 1))) (and (= 0 (select .cse0 v_arrayElimCell_18)) (= |c_#valid| (store (store .cse0 v_arrayElimCell_18 1) c_create_data_~nextData~0.base 1))))) is different from true [2018-02-02 09:08:05,643 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:05,644 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:05,645 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-02-02 09:08:05,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-02-02 09:08:05,653 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 0 case distinctions, treesize of input 22 treesize of output 29 [2018-02-02 09:08:05,654 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:05,660 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:05,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:05,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 09:08:05,671 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:31, output treesize:29 [2018-02-02 09:08:05,703 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 11 not checked. [2018-02-02 09:08:05,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:08:05,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-02-02 09:08:05,734 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:08:05,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:08:05,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=223, Unknown=8, NotChecked=102, Total=420 [2018-02-02 09:08:05,734 INFO L87 Difference]: Start difference. First operand 351 states and 380 transitions. Second operand 21 states. [2018-02-02 09:08:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:06,755 INFO L93 Difference]: Finished difference Result 366 states and 396 transitions. [2018-02-02 09:08:06,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 09:08:06,755 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 84 [2018-02-02 09:08:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:06,756 INFO L225 Difference]: With dead ends: 366 [2018-02-02 09:08:06,756 INFO L226 Difference]: Without dead ends: 366 [2018-02-02 09:08:06,756 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=432, Unknown=26, NotChecked=144, Total=756 [2018-02-02 09:08:06,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-02-02 09:08:06,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 354. [2018-02-02 09:08:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-02 09:08:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 384 transitions. [2018-02-02 09:08:06,760 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 384 transitions. Word has length 84 [2018-02-02 09:08:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:06,760 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 384 transitions. [2018-02-02 09:08:06,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:08:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 384 transitions. [2018-02-02 09:08:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 09:08:06,760 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:06,761 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:06,761 INFO L371 AbstractCegarLoop]: === Iteration 42 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:06,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1044261365, now seen corresponding path program 1 times [2018-02-02 09:08:06,761 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:06,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:06,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:06,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:06,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:06,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:07,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:08:07,143 INFO L209 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-02 09:08:07,148 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:07,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:08:07,262 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 13 treesize of output 10 [2018-02-02 09:08:07,264 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-02 09:08:07,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:07,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:07,270 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-02 09:08:07,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-02-02 09:08:07,289 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 30 treesize of output 26 [2018-02-02 09:08:07,290 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-02-02 09:08:07,290 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-02 09:08:07,292 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-02 09:08:07,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:08:07,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:23 [2018-02-02 09:08:07,297 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_21 Int)) (and (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_21 80) |c_#length|) (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_21) 0))) is different from true [2018-02-02 09:08:07,311 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_21 Int)) (and (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_21 80) |c_create_data_#t~malloc24.base| 16)) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_21) 0))) is different from true [2018-02-02 09:08:07,314 WARN L1033 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base Int) (v_arrayElimCell_21 Int)) (and (= (store (store (store |c_old(#length)| create_data_~data~0.base 16) v_arrayElimCell_21 80) c_create_data_~nextData~0.base 16) |c_#length|) (= 0 (select |c_old(#valid)| create_data_~data~0.base)) (= (select (store |c_old(#valid)| create_data_~data~0.base 1) v_arrayElimCell_21) 0))) is different from true [2018-02-02 09:08:07,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:07,366 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-02-02 09:08:07,368 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:07,369 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:07,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 42 [2018-02-02 09:08:07,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 30 treesize of output 46 [2018-02-02 09:08:07,388 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-02 09:08:07,413 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:08:07,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:08:07,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:07,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:07,439 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:07,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 09:08:07,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:07,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-02-02 09:08:07,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:72 [2018-02-02 09:08:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 11 not checked. [2018-02-02 09:08:07,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:08:07,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2018-02-02 09:08:07,543 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 09:08:07,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 09:08:07,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=427, Unknown=6, NotChecked=132, Total=650 [2018-02-02 09:08:07,543 INFO L87 Difference]: Start difference. First operand 354 states and 384 transitions. Second operand 26 states. [2018-02-02 09:08:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:09,392 INFO L93 Difference]: Finished difference Result 365 states and 395 transitions. [2018-02-02 09:08:09,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:08:09,392 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-02-02 09:08:09,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:09,393 INFO L225 Difference]: With dead ends: 365 [2018-02-02 09:08:09,393 INFO L226 Difference]: Without dead ends: 365 [2018-02-02 09:08:09,393 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 78 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=231, Invalid=1250, Unknown=13, NotChecked=228, Total=1722 [2018-02-02 09:08:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-02-02 09:08:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 354. [2018-02-02 09:08:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-02-02 09:08:09,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 383 transitions. [2018-02-02 09:08:09,396 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 383 transitions. Word has length 84 [2018-02-02 09:08:09,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:09,396 INFO L432 AbstractCegarLoop]: Abstraction has 354 states and 383 transitions. [2018-02-02 09:08:09,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 09:08:09,396 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 383 transitions. [2018-02-02 09:08:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 09:08:09,396 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:09,397 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:09,397 INFO L371 AbstractCegarLoop]: === Iteration 43 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:09,397 INFO L82 PathProgramCache]: Analyzing trace with hash -779423693, now seen corresponding path program 1 times [2018-02-02 09:08:09,397 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:09,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:09,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:09,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:09,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:09,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:09,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:08:09,507 INFO L209 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-02 09:08:09,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:09,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:08:09,575 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:09,576 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 17 [2018-02-02 09:08:09,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:09,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:09,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:09,584 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-02 09:08:09,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:09,589 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-02 09:08:09,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-02-02 09:08:09,606 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:09,624 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:08:09,624 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2018-02-02 09:08:09,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 09:08:09,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 09:08:09,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:08:09,624 INFO L87 Difference]: Start difference. First operand 354 states and 383 transitions. Second operand 16 states. [2018-02-02 09:08:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:10,004 INFO L93 Difference]: Finished difference Result 361 states and 388 transitions. [2018-02-02 09:08:10,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 09:08:10,004 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2018-02-02 09:08:10,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:10,005 INFO L225 Difference]: With dead ends: 361 [2018-02-02 09:08:10,005 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 09:08:10,005 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:08:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 09:08:10,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 350. [2018-02-02 09:08:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-02-02 09:08:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 377 transitions. [2018-02-02 09:08:10,008 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 377 transitions. Word has length 89 [2018-02-02 09:08:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:10,008 INFO L432 AbstractCegarLoop]: Abstraction has 350 states and 377 transitions. [2018-02-02 09:08:10,008 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 09:08:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 377 transitions. [2018-02-02 09:08:10,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 09:08:10,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:10,009 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:10,009 INFO L371 AbstractCegarLoop]: === Iteration 44 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:10,009 INFO L82 PathProgramCache]: Analyzing trace with hash 899016917, now seen corresponding path program 1 times [2018-02-02 09:08:10,009 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:10,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:10,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:10,010 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:10,010 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:10,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:10,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:10,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 09:08:10,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:08:10,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:08:10,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:08:10,586 INFO L87 Difference]: Start difference. First operand 350 states and 377 transitions. Second operand 18 states. [2018-02-02 09:08:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:11,634 INFO L93 Difference]: Finished difference Result 399 states and 434 transitions. [2018-02-02 09:08:11,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:08:11,634 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 88 [2018-02-02 09:08:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:11,635 INFO L225 Difference]: With dead ends: 399 [2018-02-02 09:08:11,636 INFO L226 Difference]: Without dead ends: 399 [2018-02-02 09:08:11,636 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:08:11,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-02-02 09:08:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 364. [2018-02-02 09:08:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-02-02 09:08:11,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 396 transitions. [2018-02-02 09:08:11,640 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 396 transitions. Word has length 88 [2018-02-02 09:08:11,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:11,640 INFO L432 AbstractCegarLoop]: Abstraction has 364 states and 396 transitions. [2018-02-02 09:08:11,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:08:11,641 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 396 transitions. [2018-02-02 09:08:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-02-02 09:08:11,641 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:11,641 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:11,641 INFO L371 AbstractCegarLoop]: === Iteration 45 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:11,642 INFO L82 PathProgramCache]: Analyzing trace with hash 665848497, now seen corresponding path program 1 times [2018-02-02 09:08:11,642 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:11,642 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:11,642 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:11,643 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:11,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:11,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:11,731 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:11,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:08:11,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:08:11,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:08:11,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:08:11,732 INFO L87 Difference]: Start difference. First operand 364 states and 396 transitions. Second operand 8 states. [2018-02-02 09:08:11,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:11,941 INFO L93 Difference]: Finished difference Result 380 states and 410 transitions. [2018-02-02 09:08:11,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:08:11,941 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2018-02-02 09:08:11,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:11,942 INFO L225 Difference]: With dead ends: 380 [2018-02-02 09:08:11,942 INFO L226 Difference]: Without dead ends: 380 [2018-02-02 09:08:11,942 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-02 09:08:11,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-02-02 09:08:11,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 364. [2018-02-02 09:08:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-02-02 09:08:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 394 transitions. [2018-02-02 09:08:11,946 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 394 transitions. Word has length 90 [2018-02-02 09:08:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:11,946 INFO L432 AbstractCegarLoop]: Abstraction has 364 states and 394 transitions. [2018-02-02 09:08:11,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:08:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 394 transitions. [2018-02-02 09:08:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 09:08:11,947 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:11,947 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:11,947 INFO L371 AbstractCegarLoop]: === Iteration 46 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:11,948 INFO L82 PathProgramCache]: Analyzing trace with hash -802931546, now seen corresponding path program 1 times [2018-02-02 09:08:11,948 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:11,948 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:11,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:11,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:11,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:11,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:12,006 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:12,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:08:12,006 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:08:12,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:08:12,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:08:12,007 INFO L87 Difference]: Start difference. First operand 364 states and 394 transitions. Second operand 5 states. [2018-02-02 09:08:12,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:12,145 INFO L93 Difference]: Finished difference Result 370 states and 400 transitions. [2018-02-02 09:08:12,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 09:08:12,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-02-02 09:08:12,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:12,147 INFO L225 Difference]: With dead ends: 370 [2018-02-02 09:08:12,147 INFO L226 Difference]: Without dead ends: 370 [2018-02-02 09:08:12,147 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-02 09:08:12,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-02-02 09:08:12,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2018-02-02 09:08:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-02-02 09:08:12,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 398 transitions. [2018-02-02 09:08:12,149 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 398 transitions. Word has length 91 [2018-02-02 09:08:12,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:12,150 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 398 transitions. [2018-02-02 09:08:12,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:08:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 398 transitions. [2018-02-02 09:08:12,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-02-02 09:08:12,151 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:12,151 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:12,151 INFO L371 AbstractCegarLoop]: === Iteration 47 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:12,151 INFO L82 PathProgramCache]: Analyzing trace with hash -802931545, now seen corresponding path program 1 times [2018-02-02 09:08:12,151 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:12,151 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:12,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:12,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:12,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:12,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:12,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:12,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-02-02 09:08:12,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 09:08:12,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 09:08:12,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-02-02 09:08:12,598 INFO L87 Difference]: Start difference. First operand 367 states and 398 transitions. Second operand 19 states. [2018-02-02 09:08:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:13,614 INFO L93 Difference]: Finished difference Result 397 states and 431 transitions. [2018-02-02 09:08:13,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 09:08:13,614 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2018-02-02 09:08:13,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:13,615 INFO L225 Difference]: With dead ends: 397 [2018-02-02 09:08:13,615 INFO L226 Difference]: Without dead ends: 397 [2018-02-02 09:08:13,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2018-02-02 09:08:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-02 09:08:13,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 370. [2018-02-02 09:08:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-02-02 09:08:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 401 transitions. [2018-02-02 09:08:13,618 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 401 transitions. Word has length 91 [2018-02-02 09:08:13,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:13,619 INFO L432 AbstractCegarLoop]: Abstraction has 370 states and 401 transitions. [2018-02-02 09:08:13,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 09:08:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 401 transitions. [2018-02-02 09:08:13,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-02-02 09:08:13,619 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:13,619 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:13,619 INFO L371 AbstractCegarLoop]: === Iteration 48 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:13,620 INFO L82 PathProgramCache]: Analyzing trace with hash -133345216, now seen corresponding path program 1 times [2018-02-02 09:08:13,620 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:13,620 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:13,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:13,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:13,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:13,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-02-02 09:08:13,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:13,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 09:08:13,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 09:08:13,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 09:08:13,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 09:08:13,675 INFO L87 Difference]: Start difference. First operand 370 states and 401 transitions. Second operand 5 states. [2018-02-02 09:08:13,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:13,798 INFO L93 Difference]: Finished difference Result 381 states and 411 transitions. [2018-02-02 09:08:13,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 09:08:13,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2018-02-02 09:08:13,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:13,799 INFO L225 Difference]: With dead ends: 381 [2018-02-02 09:08:13,799 INFO L226 Difference]: Without dead ends: 381 [2018-02-02 09:08:13,800 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:08:13,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-02-02 09:08:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 369. [2018-02-02 09:08:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-02-02 09:08:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 400 transitions. [2018-02-02 09:08:13,802 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 400 transitions. Word has length 92 [2018-02-02 09:08:13,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:13,802 INFO L432 AbstractCegarLoop]: Abstraction has 369 states and 400 transitions. [2018-02-02 09:08:13,802 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 09:08:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 400 transitions. [2018-02-02 09:08:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 09:08:13,803 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:13,803 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:13,803 INFO L371 AbstractCegarLoop]: === Iteration 49 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:13,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1460551193, now seen corresponding path program 1 times [2018-02-02 09:08:13,803 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:13,803 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:13,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:13,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:13,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:13,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:13,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:13,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 09:08:13,859 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 09:08:13,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 09:08:13,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 09:08:13,860 INFO L87 Difference]: Start difference. First operand 369 states and 400 transitions. Second operand 9 states. [2018-02-02 09:08:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:14,129 INFO L93 Difference]: Finished difference Result 398 states and 435 transitions. [2018-02-02 09:08:14,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:08:14,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-02-02 09:08:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:14,130 INFO L225 Difference]: With dead ends: 398 [2018-02-02 09:08:14,130 INFO L226 Difference]: Without dead ends: 398 [2018-02-02 09:08:14,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-02-02 09:08:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-02-02 09:08:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 390. [2018-02-02 09:08:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-02-02 09:08:14,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 427 transitions. [2018-02-02 09:08:14,133 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 427 transitions. Word has length 94 [2018-02-02 09:08:14,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:14,133 INFO L432 AbstractCegarLoop]: Abstraction has 390 states and 427 transitions. [2018-02-02 09:08:14,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 09:08:14,133 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 427 transitions. [2018-02-02 09:08:14,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 09:08:14,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:14,134 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:14,134 INFO L371 AbstractCegarLoop]: === Iteration 50 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:14,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1460551192, now seen corresponding path program 1 times [2018-02-02 09:08:14,134 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:14,134 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:14,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:14,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:14,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:14,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:14,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:14,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-02-02 09:08:14,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 09:08:14,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 09:08:14,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:08:14,421 INFO L87 Difference]: Start difference. First operand 390 states and 427 transitions. Second operand 22 states. [2018-02-02 09:08:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:15,316 INFO L93 Difference]: Finished difference Result 433 states and 475 transitions. [2018-02-02 09:08:15,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 09:08:15,316 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 94 [2018-02-02 09:08:15,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:15,317 INFO L225 Difference]: With dead ends: 433 [2018-02-02 09:08:15,317 INFO L226 Difference]: Without dead ends: 433 [2018-02-02 09:08:15,317 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=1703, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 09:08:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-02-02 09:08:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 411. [2018-02-02 09:08:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-02-02 09:08:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 453 transitions. [2018-02-02 09:08:15,321 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 453 transitions. Word has length 94 [2018-02-02 09:08:15,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:15,321 INFO L432 AbstractCegarLoop]: Abstraction has 411 states and 453 transitions. [2018-02-02 09:08:15,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 09:08:15,321 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 453 transitions. [2018-02-02 09:08:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 09:08:15,321 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:15,321 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:15,321 INFO L371 AbstractCegarLoop]: === Iteration 51 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:15,322 INFO L82 PathProgramCache]: Analyzing trace with hash 161265710, now seen corresponding path program 1 times [2018-02-02 09:08:15,322 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:15,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:15,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:15,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:15,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:15,336 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:15,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:15,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 09:08:15,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 09:08:15,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 09:08:15,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-02-02 09:08:15,557 INFO L87 Difference]: Start difference. First operand 411 states and 453 transitions. Second operand 17 states. [2018-02-02 09:08:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:16,347 INFO L93 Difference]: Finished difference Result 464 states and 518 transitions. [2018-02-02 09:08:16,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 09:08:16,347 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-02-02 09:08:16,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:16,349 INFO L225 Difference]: With dead ends: 464 [2018-02-02 09:08:16,349 INFO L226 Difference]: Without dead ends: 464 [2018-02-02 09:08:16,350 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=983, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 09:08:16,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-02-02 09:08:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 422. [2018-02-02 09:08:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-02 09:08:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 468 transitions. [2018-02-02 09:08:16,357 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 468 transitions. Word has length 93 [2018-02-02 09:08:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:16,357 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 468 transitions. [2018-02-02 09:08:16,357 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 09:08:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 468 transitions. [2018-02-02 09:08:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 09:08:16,358 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:16,358 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:16,358 INFO L371 AbstractCegarLoop]: === Iteration 52 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash 161265711, now seen corresponding path program 1 times [2018-02-02 09:08:16,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:16,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:16,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:16,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:16,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:16,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:16,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:08:16,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-02-02 09:08:16,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-02-02 09:08:16,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-02-02 09:08:16,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-02-02 09:08:16,693 INFO L87 Difference]: Start difference. First operand 422 states and 468 transitions. Second operand 18 states. [2018-02-02 09:08:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:17,662 INFO L93 Difference]: Finished difference Result 469 states and 523 transitions. [2018-02-02 09:08:17,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 09:08:17,663 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-02-02 09:08:17,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:17,664 INFO L225 Difference]: With dead ends: 469 [2018-02-02 09:08:17,664 INFO L226 Difference]: Without dead ends: 469 [2018-02-02 09:08:17,664 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2018-02-02 09:08:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-02-02 09:08:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 422. [2018-02-02 09:08:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-02-02 09:08:17,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 467 transitions. [2018-02-02 09:08:17,668 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 467 transitions. Word has length 93 [2018-02-02 09:08:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:17,668 INFO L432 AbstractCegarLoop]: Abstraction has 422 states and 467 transitions. [2018-02-02 09:08:17,668 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-02-02 09:08:17,668 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 467 transitions. [2018-02-02 09:08:17,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 09:08:17,669 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:17,669 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:08:17,669 INFO L371 AbstractCegarLoop]: === Iteration 53 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:17,670 INFO L82 PathProgramCache]: Analyzing trace with hash -912992188, now seen corresponding path program 1 times [2018-02-02 09:08:17,670 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:17,670 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:17,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:17,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:17,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:17,681 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:17,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:08:17,823 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:08:17,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:17,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:08:17,927 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 16 treesize of output 15 [2018-02-02 09:08:17,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:17,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:17,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-02-02 09:08:17,976 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 27 treesize of output 37 [2018-02-02 09:08:17,978 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 28 treesize of output 27 [2018-02-02 09:08:17,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:17,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:17,993 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-02 09:08:17,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-02 09:08:18,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-02-02 09:08:18,023 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 24 treesize of output 5 [2018-02-02 09:08:18,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:18,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:18,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:08:18,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-02-02 09:08:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:18,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:08:18,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2018-02-02 09:08:18,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 09:08:18,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 09:08:18,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-02-02 09:08:18,059 INFO L87 Difference]: Start difference. First operand 422 states and 467 transitions. Second operand 21 states. [2018-02-02 09:08:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:18,732 INFO L93 Difference]: Finished difference Result 425 states and 472 transitions. [2018-02-02 09:08:18,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 09:08:18,732 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 95 [2018-02-02 09:08:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:18,733 INFO L225 Difference]: With dead ends: 425 [2018-02-02 09:08:18,733 INFO L226 Difference]: Without dead ends: 425 [2018-02-02 09:08:18,733 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2018-02-02 09:08:18,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-02-02 09:08:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 421. [2018-02-02 09:08:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-02-02 09:08:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 466 transitions. [2018-02-02 09:08:18,738 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 466 transitions. Word has length 95 [2018-02-02 09:08:18,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:18,739 INFO L432 AbstractCegarLoop]: Abstraction has 421 states and 466 transitions. [2018-02-02 09:08:18,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 09:08:18,739 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 466 transitions. [2018-02-02 09:08:18,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 09:08:18,740 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:18,740 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:08:18,740 INFO L371 AbstractCegarLoop]: === Iteration 54 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:18,740 INFO L82 PathProgramCache]: Analyzing trace with hash -912992187, now seen corresponding path program 1 times [2018-02-02 09:08:18,740 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:18,740 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:18,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:18,741 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:18,741 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:18,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:19,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:08:19,009 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:08:19,013 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:19,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:08:19,134 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:19,135 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 22 treesize of output 29 [2018-02-02 09:08:19,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:19,143 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:19,144 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:19,144 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-02 09:08:19,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:19,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:19,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:39 [2018-02-02 09:08:19,233 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 3 case distinctions, treesize of input 40 treesize of output 48 [2018-02-02 09:08:19,235 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 34 treesize of output 34 [2018-02-02 09:08:19,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:19,251 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 37 treesize of output 36 [2018-02-02 09:08:19,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:19,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:19,276 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 3 case distinctions, treesize of input 41 treesize of output 49 [2018-02-02 09:08:19,278 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 42 treesize of output 41 [2018-02-02 09:08:19,278 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:19,298 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:19,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:08:19,305 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:70, output treesize:62 [2018-02-02 09:08:19,340 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 1 case distinctions, treesize of input 46 treesize of output 44 [2018-02-02 09:08:19,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 36 treesize of output 16 [2018-02-02 09:08:19,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:19,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:19,364 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 1 case distinctions, treesize of input 41 treesize of output 39 [2018-02-02 09:08:19,366 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 35 treesize of output 30 [2018-02-02 09:08:19,366 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:19,376 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 30 treesize of output 15 [2018-02-02 09:08:19,377 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:19,396 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 31 treesize of output 11 [2018-02-02 09:08:19,396 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:19,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:19,408 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 1 xjuncts. [2018-02-02 09:08:19,408 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:80, output treesize:20 [2018-02-02 09:08:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-02-02 09:08:19,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:08:19,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 26 [2018-02-02 09:08:19,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 09:08:19,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 09:08:19,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2018-02-02 09:08:19,471 INFO L87 Difference]: Start difference. First operand 421 states and 466 transitions. Second operand 27 states. [2018-02-02 09:08:20,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:08:20,923 INFO L93 Difference]: Finished difference Result 443 states and 491 transitions. [2018-02-02 09:08:20,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 09:08:20,923 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 95 [2018-02-02 09:08:20,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:08:20,924 INFO L225 Difference]: With dead ends: 443 [2018-02-02 09:08:20,924 INFO L226 Difference]: Without dead ends: 443 [2018-02-02 09:08:20,924 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=264, Invalid=1457, Unknown=1, NotChecked=0, Total=1722 [2018-02-02 09:08:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-02-02 09:08:20,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 420. [2018-02-02 09:08:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-02-02 09:08:20,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 465 transitions. [2018-02-02 09:08:20,928 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 465 transitions. Word has length 95 [2018-02-02 09:08:20,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:08:20,928 INFO L432 AbstractCegarLoop]: Abstraction has 420 states and 465 transitions. [2018-02-02 09:08:20,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 09:08:20,928 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 465 transitions. [2018-02-02 09:08:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 09:08:20,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:08:20,929 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 09:08:20,929 INFO L371 AbstractCegarLoop]: === Iteration 55 === [create_dataErr0RequiresViolation, create_dataErr14RequiresViolation, create_dataErr37RequiresViolation, create_dataErr19RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr11RequiresViolation, create_dataErr29RequiresViolation, create_dataErr32RequiresViolation, create_dataErr16RequiresViolation, create_dataErr24RequiresViolation, create_dataErr34RequiresViolation, create_dataErr39RequiresViolation, create_dataErr8RequiresViolation, create_dataErr6RequiresViolation, create_dataErr26RequiresViolation, create_dataErr17RequiresViolation, create_dataErr36RequiresViolation, create_dataErr27RequiresViolation, create_dataErr30RequiresViolation, create_dataErr13RequiresViolation, create_dataErr23RequiresViolation, create_dataErr9RequiresViolation, create_dataErr33RequiresViolation, create_dataErr2RequiresViolation, create_dataErr4RequiresViolation, create_dataErr10RequiresViolation, create_dataErr28RequiresViolation, create_dataErr38RequiresViolation, create_dataErr20RequiresViolation, create_dataErr18RequiresViolation, create_dataErr1RequiresViolation, create_dataErr31RequiresViolation, create_dataErr35RequiresViolation, create_dataErr21RequiresViolation, create_dataErr22RequiresViolation, create_dataErr12RequiresViolation, create_dataErr25RequiresViolation, create_dataErr7RequiresViolation, create_dataErr15RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-02-02 09:08:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1967553487, now seen corresponding path program 1 times [2018-02-02 09:08:20,929 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:08:20,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:08:20,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:20,930 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:20,930 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:08:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:20,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:08:23,232 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:08:23,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:08:23,232 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 09:08:23,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:08:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:08:23,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:08:23,283 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-02 09:08:23,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:23,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:23,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 09:08:23,756 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 13 treesize of output 10 [2018-02-02 09:08:23,851 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-02 09:08:23,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:23,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:23,860 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 13 treesize of output 10 [2018-02-02 09:08:23,861 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-02 09:08:23,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:23,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:23,871 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-02 09:08:23,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-02-02 09:08:23,968 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:23,971 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-02 09:08:23,976 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-02 09:08:23,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:23,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:23,985 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:23,988 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 56 treesize of output 60 [2018-02-02 09:08:23,989 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-02 09:08:23,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:23,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:23,995 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-02 09:08:23,995 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:114, output treesize:32 [2018-02-02 09:08:23,998 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:24,001 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-02 09:08:24,002 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-02 09:08:24,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,012 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:24,014 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 56 treesize of output 60 [2018-02-02 09:08:24,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 1 [2018-02-02 09:08:24,015 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,021 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-02 09:08:24,021 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:114, output treesize:32 [2018-02-02 09:08:24,023 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 20 [2018-02-02 09:08:24,024 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 20 treesize of output 8 [2018-02-02 09:08:24,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:26 [2018-02-02 09:08:24,070 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:24,072 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 33 treesize of output 34 [2018-02-02 09:08:24,073 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 20 treesize of output 1 [2018-02-02 09:08:24,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:08:24,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:26 [2018-02-02 09:08:24,124 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 25 treesize of output 20 [2018-02-02 09:08:24,126 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:24,127 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 20 treesize of output 16 [2018-02-02 09:08:24,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,134 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-02 09:08:24,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:26 [2018-02-02 09:08:24,139 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 29 treesize of output 24 [2018-02-02 09:08:24,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:24,142 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 24 treesize of output 18 [2018-02-02 09:08:24,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,149 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-02 09:08:24,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:26 [2018-02-02 09:08:24,152 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 23 treesize of output 18 [2018-02-02 09:08:24,153 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:24,153 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 27 [2018-02-02 09:08:24,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,161 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-02 09:08:24,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2018-02-02 09:08:24,327 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-02 09:08:24,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 09:08:24,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,345 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:24,347 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 26 treesize of output 35 [2018-02-02 09:08:24,348 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-02 09:08:24,348 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,360 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 1 xjuncts. [2018-02-02 09:08:24,360 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:67, output treesize:68 [2018-02-02 09:08:24,434 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 61 treesize of output 67 [2018-02-02 09:08:24,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-02-02 09:08:24,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,463 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:24,467 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 2 case distinctions, treesize of input 53 treesize of output 59 [2018-02-02 09:08:24,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-02-02 09:08:24,495 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-02 09:08:24,526 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:24,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 124 [2018-02-02 09:08:24,548 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 09:08:24,548 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,632 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 76 treesize of output 75 [2018-02-02 09:08:24,633 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,721 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 4 case distinctions, treesize of input 71 treesize of output 82 [2018-02-02 09:08:24,721 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-02-02 09:08:24,765 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 09:08:24,767 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:24,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-02-02 09:08:24,774 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 18 treesize of output 15 [2018-02-02 09:08:24,774 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,784 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:24,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-02-02 09:08:24,842 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:84, output treesize:374 [2018-02-02 09:08:25,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:25,033 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:25,034 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:25,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 59 treesize of output 116 [2018-02-02 09:08:25,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:25,052 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:25,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:25,053 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:25,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2018-02-02 09:08:25,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:25,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:25,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:25,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:406, output treesize:101 [2018-02-02 09:08:25,339 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 128 treesize of output 95 [2018-02-02 09:08:25,341 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-02-02 09:08:25,341 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-02 09:08:25,349 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 56 treesize of output 23 [2018-02-02 09:08:25,349 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:25,355 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-02 09:08:25,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:08:25,361 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:128, output treesize:49 [2018-02-02 09:08:25,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-02-02 09:08:25,563 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:08:25,563 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:08:25,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-02-02 09:08:25,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:25,571 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 9 treesize of output 1 [2018-02-02 09:08:25,571 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:08:25,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:25,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:08:25,576 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:55, output treesize:3 [2018-02-02 09:08:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 09:08:25,628 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:08:25,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 26] total 57 [2018-02-02 09:08:25,629 INFO L409 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-02-02 09:08:25,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-02-02 09:08:25,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3131, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 09:08:25,629 INFO L87 Difference]: Start difference. First operand 420 states and 465 transitions. Second operand 58 states. Received shutdown request... [2018-02-02 09:08:27,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 09:08:27,584 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:08:27,588 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:08:27,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:08:27 BoogieIcfgContainer [2018-02-02 09:08:27,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:08:27,589 INFO L168 Benchmark]: Toolchain (without parser) took 47265.74 ms. Allocated memory was 397.4 MB in the beginning and 1.4 GB in the end (delta: 961.0 MB). Free memory was 354.3 MB in the beginning and 1.1 GB in the end (delta: -774.6 MB). Peak memory consumption was 186.4 MB. Max. memory is 5.3 GB. [2018-02-02 09:08:27,590 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 397.4 MB. Free memory is still 360.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:08:27,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.81 ms. Allocated memory is still 397.4 MB. Free memory was 354.3 MB in the beginning and 342.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 09:08:27,590 INFO L168 Benchmark]: Boogie Preprocessor took 30.78 ms. Allocated memory is still 397.4 MB. Free memory was 342.4 MB in the beginning and 341.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:08:27,590 INFO L168 Benchmark]: RCFGBuilder took 520.95 ms. Allocated memory is still 397.4 MB. Free memory was 341.1 MB in the beginning and 288.0 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 5.3 GB. [2018-02-02 09:08:27,591 INFO L168 Benchmark]: TraceAbstraction took 46519.64 ms. Allocated memory was 397.4 MB in the beginning and 1.4 GB in the end (delta: 961.0 MB). Free memory was 288.0 MB in the beginning and 1.1 GB in the end (delta: -840.9 MB). Peak memory consumption was 120.2 MB. Max. memory is 5.3 GB. [2018-02-02 09:08:27,591 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 397.4 MB. Free memory is still 360.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 191.81 ms. Allocated memory is still 397.4 MB. Free memory was 354.3 MB in the beginning and 342.4 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.78 ms. Allocated memory is still 397.4 MB. Free memory was 342.4 MB in the beginning and 341.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 520.95 ms. Allocated memory is still 397.4 MB. Free memory was 341.1 MB in the beginning and 288.0 MB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 46519.64 ms. Allocated memory was 397.4 MB in the beginning and 1.4 GB in the end (delta: 961.0 MB). Free memory was 288.0 MB in the beginning and 1.1 GB in the end (delta: -840.9 MB). Peak memory consumption was 120.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 585]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 585). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was constructing difference of abstraction (420states) and interpolant automaton (currently 20 states, 58 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 73 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 215 locations, 91 error locations. TIMEOUT Result, 46.4s OverallTime, 55 OverallIterations, 4 TraceHistogramMax, 28.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8171 SDtfs, 7457 SDslu, 32489 SDs, 0 SdLazy, 30018 SolverSat, 989 SolverUnsat, 117 SolverUnknown, 0 SolverNotchecked, 17.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1953 GetRequests, 1056 SyntacticMatches, 64 SemanticMatches, 832 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 4284 ImplicationChecksByTransitivity, 17.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=422occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 54 MinimizatonAttempts, 914 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 4633 NumberOfCodeBlocks, 4619 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 4564 ConstructedInterpolants, 292 QuantifiedInterpolants, 7489153 SizeOfPredicates, 138 NumberOfNonLiveVariables, 4451 ConjunctsInSsa, 363 ConjunctsInUnsatCore, 69 InterpolantComputations, 45 PerfectInterpolantSequences, 1285/1438 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-08-27-599.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test02_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-08-27-599.csv Completed graceful shutdown