java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01_true-valid-memsafety.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-1cceb4a
[2018-01-29 23:37:14,590 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-01-29 23:37:14,591 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-01-29 23:37:14,604 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-01-29 23:37:14,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-01-29 23:37:14,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-01-29 23:37:14,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-01-29 23:37:14,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-01-29 23:37:14,610 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-01-29 23:37:14,611 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-01-29 23:37:14,612 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-01-29 23:37:14,612 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-01-29 23:37:14,613 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-01-29 23:37:14,613 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-01-29 23:37:14,614 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-01-29 23:37:14,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-01-29 23:37:14,619 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-01-29 23:37:14,620 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-01-29 23:37:14,622 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-01-29 23:37:14,623 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-01-29 23:37:14,625 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-01-29 23:37:14,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-01-29 23:37:14,626 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-01-29 23:37:14,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-01-29 23:37:14,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-01-29 23:37:14,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-01-29 23:37:14,629 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-01-29 23:37:14,630 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-01-29 23:37:14,630 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-01-29 23:37:14,630 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-01-29 23:37:14,631 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-01-29 23:37:14,631 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf
[2018-01-29 23:37:14,641 INFO L110 SettingsManager]: Loading preferences was successful
[2018-01-29 23:37:14,641 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-01-29 23:37:14,642 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-01-29 23:37:14,642 INFO L133 SettingsManager]: * to procedures, called more than once=true
[2018-01-29 23:37:14,643 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-01-29 23:37:14,643 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain
[2018-01-29 23:37:14,643 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true
[2018-01-29 23:37:14,644 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-01-29 23:37:14,644 INFO L133 SettingsManager]: * sizeof long=4
[2018-01-29 23:37:14,644 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-01-29 23:37:14,644 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-01-29 23:37:14,644 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-01-29 23:37:14,645 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-01-29 23:37:14,645 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-01-29 23:37:14,645 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-01-29 23:37:14,645 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-01-29 23:37:14,645 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-01-29 23:37:14,646 INFO L133 SettingsManager]: * sizeof long double=12
[2018-01-29 23:37:14,646 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-01-29 23:37:14,646 INFO L133 SettingsManager]: * Size of a code block=SingleStatement
[2018-01-29 23:37:14,646 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-01-29 23:37:14,646 INFO L133 SettingsManager]: * Add additional assume for each assert=false
[2018-01-29 23:37:14,646 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-01-29 23:37:14,647 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-29 23:37:14,647 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-01-29 23:37:14,647 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-01-29 23:37:14,647 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-01-29 23:37:14,647 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-01-29 23:37:14,648 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-01-29 23:37:14,648 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-01-29 23:37:14,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-01-29 23:37:14,648 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-01-29 23:37:14,649 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2018-01-29 23:37:14,649 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR
[2018-01-29 23:37:14,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-01-29 23:37:14,696 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-01-29 23:37:14,700 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-01-29 23:37:14,702 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-01-29 23:37:14,702 INFO L276 PluginConnector]: CDTParser initialized
[2018-01-29 23:37:14,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/complex_data_creation_test01_true-valid-memsafety.i
[2018-01-29 23:37:14,875 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-01-29 23:37:14,881 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-01-29 23:37:14,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-01-29 23:37:14,882 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-01-29 23:37:14,889 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-01-29 23:37:14,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:37:14" (1/1) ...
[2018-01-29 23:37:14,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33306c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:37:14, skipping insertion in model container
[2018-01-29 23:37:14,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:37:14" (1/1) ...
[2018-01-29 23:37:14,914 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-29 23:37:14,957 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-01-29 23:37:15,085 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-29 23:37:15,107 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-01-29 23:37:15,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:37:15 WrapperNode
[2018-01-29 23:37:15,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-01-29 23:37:15,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-01-29 23:37:15,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-01-29 23:37:15,118 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-01-29 23:37:15,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:37:15" (1/1) ...
[2018-01-29 23:37:15,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:37:15" (1/1) ...
[2018-01-29 23:37:15,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:37:15" (1/1) ...
[2018-01-29 23:37:15,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:37:15" (1/1) ...
[2018-01-29 23:37:15,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:37:15" (1/1) ...
[2018-01-29 23:37:15,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:37:15" (1/1) ...
[2018-01-29 23:37:15,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:37:15" (1/1) ...
[2018-01-29 23:37:15,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-01-29 23:37:15,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-01-29 23:37:15,164 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-01-29 23:37:15,164 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-01-29 23:37:15,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:37:15" (1/1) ...
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-01-29 23:37:15,210 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-01-29 23:37:15,210 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-01-29 23:37:15,210 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data
[2018-01-29 23:37:15,210 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData
[2018-01-29 23:37:15,210 INFO L136 BoogieDeclarations]: Found implementation of procedure append
[2018-01-29 23:37:15,211 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-01-29 23:37:15,211 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2018-01-29 23:37:15,211 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2018-01-29 23:37:15,211 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-01-29 23:37:15,211 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-01-29 23:37:15,211 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-01-29 23:37:15,212 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-01-29 23:37:15,212 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-01-29 23:37:15,212 INFO L128 BoogieDeclarations]: Found specification of procedure malloc
[2018-01-29 23:37:15,212 INFO L128 BoogieDeclarations]: Found specification of procedure free
[2018-01-29 23:37:15,212 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-01-29 23:37:15,212 INFO L128 BoogieDeclarations]: Found specification of procedure create_data
[2018-01-29 23:37:15,213 INFO L128 BoogieDeclarations]: Found specification of procedure freeData
[2018-01-29 23:37:15,213 INFO L128 BoogieDeclarations]: Found specification of procedure append
[2018-01-29 23:37:15,213 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-01-29 23:37:15,213 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-01-29 23:37:15,213 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-01-29 23:37:16,001 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-01-29 23:37:16,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:37:16 BoogieIcfgContainer
[2018-01-29 23:37:16,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-01-29 23:37:16,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-01-29 23:37:16,003 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-01-29 23:37:16,005 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-01-29 23:37:16,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:37:14" (1/3) ...
[2018-01-29 23:37:16,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501da1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:37:16, skipping insertion in model container
[2018-01-29 23:37:16,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:37:15" (2/3) ...
[2018-01-29 23:37:16,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501da1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:37:16, skipping insertion in model container
[2018-01-29 23:37:16,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:37:16" (3/3) ...
[2018-01-29 23:37:16,009 INFO L107 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01_true-valid-memsafety.i
[2018-01-29 23:37:16,017 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-01-29 23:37:16,022 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations.
[2018-01-29 23:37:16,064 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-01-29 23:37:16,065 INFO L323 AbstractCegarLoop]: Hoare is true
[2018-01-29 23:37:16,065 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-01-29 23:37:16,065 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-01-29 23:37:16,065 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-01-29 23:37:16,065 INFO L327 AbstractCegarLoop]: Difference is false
[2018-01-29 23:37:16,066 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-01-29 23:37:16,066 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-01-29 23:37:16,067 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-01-29 23:37:16,092 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states.
[2018-01-29 23:37:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-01-29 23:37:16,096 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:16,097 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:16,097 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-01-29 23:37:16,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1324532528, now seen corresponding path program 1 times
[2018-01-29 23:37:16,104 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:16,105 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:16,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:16,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:16,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:16,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:16,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:37:16,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-01-29 23:37:16,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-29 23:37:16,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-29 23:37:16,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-29 23:37:16,366 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 3 states.
[2018-01-29 23:37:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:16,667 INFO L93 Difference]: Finished difference Result 513 states and 552 transitions.
[2018-01-29 23:37:16,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-29 23:37:16,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8
[2018-01-29 23:37:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:16,684 INFO L225 Difference]: With dead ends: 513
[2018-01-29 23:37:16,684 INFO L226 Difference]: Without dead ends: 256
[2018-01-29 23:37:16,691 INFO L553 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-01-29 23:37:16,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states.
[2018-01-29 23:37:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256.
[2018-01-29 23:37:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states.
[2018-01-29 23:37:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 268 transitions.
[2018-01-29 23:37:16,753 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 268 transitions. Word has length 8
[2018-01-29 23:37:16,754 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:16,754 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 268 transitions.
[2018-01-29 23:37:16,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-29 23:37:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 268 transitions.
[2018-01-29 23:37:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2018-01-29 23:37:16,755 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:16,755 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:16,755 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-01-29 23:37:16,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1324532527, now seen corresponding path program 1 times
[2018-01-29 23:37:16,756 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:16,756 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:16,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:16,757 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:16,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:16,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:16,837 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:37:16,837 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-01-29 23:37:16,839 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-29 23:37:16,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-29 23:37:16,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-29 23:37:16,840 INFO L87 Difference]: Start difference. First operand 256 states and 268 transitions. Second operand 3 states.
[2018-01-29 23:37:17,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:17,032 INFO L93 Difference]: Finished difference Result 258 states and 271 transitions.
[2018-01-29 23:37:17,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-29 23:37:17,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8
[2018-01-29 23:37:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:17,036 INFO L225 Difference]: With dead ends: 258
[2018-01-29 23:37:17,036 INFO L226 Difference]: Without dead ends: 257
[2018-01-29 23:37:17,038 INFO L553 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-01-29 23:37:17,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states.
[2018-01-29 23:37:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255.
[2018-01-29 23:37:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states.
[2018-01-29 23:37:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 267 transitions.
[2018-01-29 23:37:17,057 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 267 transitions. Word has length 8
[2018-01-29 23:37:17,057 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:17,057 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 267 transitions.
[2018-01-29 23:37:17,057 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-29 23:37:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 267 transitions.
[2018-01-29 23:37:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-01-29 23:37:17,058 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:17,058 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:17,059 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-01-29 23:37:17,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1729278109, now seen corresponding path program 1 times
[2018-01-29 23:37:17,059 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:17,059 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:17,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:17,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:17,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:17,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:17,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:37:17,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 23:37:17,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 23:37:17,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 23:37:17,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:37:17,165 INFO L87 Difference]: Start difference. First operand 255 states and 267 transitions. Second operand 5 states.
[2018-01-29 23:37:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:17,401 INFO L93 Difference]: Finished difference Result 255 states and 267 transitions.
[2018-01-29 23:37:17,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 23:37:17,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2018-01-29 23:37:17,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:17,403 INFO L225 Difference]: With dead ends: 255
[2018-01-29 23:37:17,403 INFO L226 Difference]: Without dead ends: 253
[2018-01-29 23:37:17,404 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2018-01-29 23:37:17,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states.
[2018-01-29 23:37:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253.
[2018-01-29 23:37:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states.
[2018-01-29 23:37:17,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 265 transitions.
[2018-01-29 23:37:17,420 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 265 transitions. Word has length 15
[2018-01-29 23:37:17,421 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:17,421 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 265 transitions.
[2018-01-29 23:37:17,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 23:37:17,421 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 265 transitions.
[2018-01-29 23:37:17,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-01-29 23:37:17,422 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:17,422 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:17,423 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-01-29 23:37:17,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1729278108, now seen corresponding path program 1 times
[2018-01-29 23:37:17,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:17,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:17,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:17,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:17,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:17,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:17,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:37:17,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-29 23:37:17,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-29 23:37:17,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-29 23:37:17,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2018-01-29 23:37:17,568 INFO L87 Difference]: Start difference. First operand 253 states and 265 transitions. Second operand 7 states.
[2018-01-29 23:37:18,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:18,040 INFO L93 Difference]: Finished difference Result 277 states and 293 transitions.
[2018-01-29 23:37:18,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-29 23:37:18,040 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15
[2018-01-29 23:37:18,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:18,042 INFO L225 Difference]: With dead ends: 277
[2018-01-29 23:37:18,042 INFO L226 Difference]: Without dead ends: 275
[2018-01-29 23:37:18,042 INFO L553 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-01-29 23:37:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states.
[2018-01-29 23:37:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 262.
[2018-01-29 23:37:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states.
[2018-01-29 23:37:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 277 transitions.
[2018-01-29 23:37:18,052 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 277 transitions. Word has length 15
[2018-01-29 23:37:18,053 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:18,053 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 277 transitions.
[2018-01-29 23:37:18,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-29 23:37:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 277 transitions.
[2018-01-29 23:37:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-01-29 23:37:18,053 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:18,053 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:18,053 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-01-29 23:37:18,054 INFO L82 PathProgramCache]: Analyzing trace with hash -2068013554, now seen corresponding path program 1 times
[2018-01-29 23:37:18,054 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:18,054 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:18,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:18,055 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:18,055 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:18,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:18,124 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:37:18,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 23:37:18,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 23:37:18,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 23:37:18,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 23:37:18,125 INFO L87 Difference]: Start difference. First operand 262 states and 277 transitions. Second operand 4 states.
[2018-01-29 23:37:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:18,300 INFO L93 Difference]: Finished difference Result 262 states and 277 transitions.
[2018-01-29 23:37:18,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-29 23:37:18,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2018-01-29 23:37:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:18,302 INFO L225 Difference]: With dead ends: 262
[2018-01-29 23:37:18,302 INFO L226 Difference]: Without dead ends: 260
[2018-01-29 23:37:18,302 INFO L553 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-01-29 23:37:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states.
[2018-01-29 23:37:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260.
[2018-01-29 23:37:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states.
[2018-01-29 23:37:18,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 274 transitions.
[2018-01-29 23:37:18,311 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 274 transitions. Word has length 16
[2018-01-29 23:37:18,311 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:18,311 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 274 transitions.
[2018-01-29 23:37:18,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 23:37:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 274 transitions.
[2018-01-29 23:37:18,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-01-29 23:37:18,312 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:18,312 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:18,312 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-01-29 23:37:18,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2068013555, now seen corresponding path program 1 times
[2018-01-29 23:37:18,312 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:18,312 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:18,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:18,313 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:18,313 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:18,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:18,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:37:18,345 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 23:37:18,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 23:37:18,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 23:37:18,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 23:37:18,345 INFO L87 Difference]: Start difference. First operand 260 states and 274 transitions. Second operand 4 states.
[2018-01-29 23:37:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:18,496 INFO L93 Difference]: Finished difference Result 260 states and 274 transitions.
[2018-01-29 23:37:18,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-29 23:37:18,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2018-01-29 23:37:18,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:18,499 INFO L225 Difference]: With dead ends: 260
[2018-01-29 23:37:18,499 INFO L226 Difference]: Without dead ends: 258
[2018-01-29 23:37:18,500 INFO L553 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-01-29 23:37:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states.
[2018-01-29 23:37:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258.
[2018-01-29 23:37:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states.
[2018-01-29 23:37:18,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 271 transitions.
[2018-01-29 23:37:18,511 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 271 transitions. Word has length 16
[2018-01-29 23:37:18,511 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:18,511 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 271 transitions.
[2018-01-29 23:37:18,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 23:37:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 271 transitions.
[2018-01-29 23:37:18,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2018-01-29 23:37:18,513 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:18,513 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:18,513 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-01-29 23:37:18,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1258492302, now seen corresponding path program 1 times
[2018-01-29 23:37:18,513 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:18,513 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:18,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:18,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:18,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:18,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:18,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:37:18,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2018-01-29 23:37:18,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-01-29 23:37:18,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-01-29 23:37:18,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2018-01-29 23:37:18,805 INFO L87 Difference]: Start difference. First operand 258 states and 271 transitions. Second operand 13 states.
[2018-01-29 23:37:20,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:20,018 INFO L93 Difference]: Finished difference Result 501 states and 529 transitions.
[2018-01-29 23:37:20,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-01-29 23:37:20,018 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22
[2018-01-29 23:37:20,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:20,020 INFO L225 Difference]: With dead ends: 501
[2018-01-29 23:37:20,020 INFO L226 Difference]: Without dead ends: 261
[2018-01-29 23:37:20,022 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380
[2018-01-29 23:37:20,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states.
[2018-01-29 23:37:20,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259.
[2018-01-29 23:37:20,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states.
[2018-01-29 23:37:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 272 transitions.
[2018-01-29 23:37:20,032 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 272 transitions. Word has length 22
[2018-01-29 23:37:20,032 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:20,032 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 272 transitions.
[2018-01-29 23:37:20,032 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-01-29 23:37:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 272 transitions.
[2018-01-29 23:37:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-01-29 23:37:20,033 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:20,033 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:20,033 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-01-29 23:37:20,034 INFO L82 PathProgramCache]: Analyzing trace with hash 300560400, now seen corresponding path program 1 times
[2018-01-29 23:37:20,034 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:20,034 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:20,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:20,035 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:20,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:20,047 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:20,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:37:20,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-29 23:37:20,136 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 23:37:20,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 23:37:20,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:37:20,137 INFO L87 Difference]: Start difference. First operand 259 states and 272 transitions. Second operand 5 states.
[2018-01-29 23:37:20,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:20,304 INFO L93 Difference]: Finished difference Result 611 states and 647 transitions.
[2018-01-29 23:37:20,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 23:37:20,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25
[2018-01-29 23:37:20,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:20,306 INFO L225 Difference]: With dead ends: 611
[2018-01-29 23:37:20,307 INFO L226 Difference]: Without dead ends: 371
[2018-01-29 23:37:20,308 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2018-01-29 23:37:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states.
[2018-01-29 23:37:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 335.
[2018-01-29 23:37:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states.
[2018-01-29 23:37:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 388 transitions.
[2018-01-29 23:37:20,321 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 388 transitions. Word has length 25
[2018-01-29 23:37:20,321 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:20,321 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 388 transitions.
[2018-01-29 23:37:20,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 23:37:20,321 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 388 transitions.
[2018-01-29 23:37:20,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-01-29 23:37:20,322 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:20,322 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:20,322 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-01-29 23:37:20,322 INFO L82 PathProgramCache]: Analyzing trace with hash -634252802, now seen corresponding path program 1 times
[2018-01-29 23:37:20,322 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:20,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:20,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:20,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:20,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:20,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:20,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:37:20,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 23:37:20,372 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 23:37:20,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 23:37:20,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 23:37:20,372 INFO L87 Difference]: Start difference. First operand 335 states and 388 transitions. Second operand 4 states.
[2018-01-29 23:37:20,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:20,552 INFO L93 Difference]: Finished difference Result 337 states and 390 transitions.
[2018-01-29 23:37:20,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-29 23:37:20,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31
[2018-01-29 23:37:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:20,554 INFO L225 Difference]: With dead ends: 337
[2018-01-29 23:37:20,554 INFO L226 Difference]: Without dead ends: 324
[2018-01-29 23:37:20,554 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:37:20,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states.
[2018-01-29 23:37:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322.
[2018-01-29 23:37:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states.
[2018-01-29 23:37:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 362 transitions.
[2018-01-29 23:37:20,564 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 362 transitions. Word has length 31
[2018-01-29 23:37:20,564 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:20,564 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 362 transitions.
[2018-01-29 23:37:20,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 23:37:20,569 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 362 transitions.
[2018-01-29 23:37:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-01-29 23:37:20,570 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:20,570 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:20,570 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-01-29 23:37:20,570 INFO L82 PathProgramCache]: Analyzing trace with hash -634252801, now seen corresponding path program 1 times
[2018-01-29 23:37:20,571 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:20,571 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:20,572 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:20,572 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:20,573 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:20,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:20,657 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:37:20,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 23:37:20,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 23:37:20,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 23:37:20,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:37:20,658 INFO L87 Difference]: Start difference. First operand 322 states and 362 transitions. Second operand 5 states.
[2018-01-29 23:37:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:20,921 INFO L93 Difference]: Finished difference Result 324 states and 364 transitions.
[2018-01-29 23:37:20,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-29 23:37:20,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31
[2018-01-29 23:37:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:20,924 INFO L225 Difference]: With dead ends: 324
[2018-01-29 23:37:20,924 INFO L226 Difference]: Without dead ends: 311
[2018-01-29 23:37:20,925 INFO L553 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-01-29 23:37:20,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states.
[2018-01-29 23:37:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309.
[2018-01-29 23:37:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states.
[2018-01-29 23:37:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 336 transitions.
[2018-01-29 23:37:20,938 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 336 transitions. Word has length 31
[2018-01-29 23:37:20,938 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:20,938 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 336 transitions.
[2018-01-29 23:37:20,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 23:37:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 336 transitions.
[2018-01-29 23:37:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2018-01-29 23:37:20,939 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:20,940 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:20,940 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-01-29 23:37:20,940 INFO L82 PathProgramCache]: Analyzing trace with hash -409142070, now seen corresponding path program 1 times
[2018-01-29 23:37:20,940 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:20,941 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:20,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:20,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:20,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:20,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:21,094 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:37:21,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-29 23:37:21,095 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-29 23:37:21,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-29 23:37:21,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2018-01-29 23:37:21,096 INFO L87 Difference]: Start difference. First operand 309 states and 336 transitions. Second operand 6 states.
[2018-01-29 23:37:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:21,508 INFO L93 Difference]: Finished difference Result 618 states and 680 transitions.
[2018-01-29 23:37:21,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-29 23:37:21,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38
[2018-01-29 23:37:21,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:21,511 INFO L225 Difference]: With dead ends: 618
[2018-01-29 23:37:21,511 INFO L226 Difference]: Without dead ends: 328
[2018-01-29 23:37:21,512 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2018-01-29 23:37:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states.
[2018-01-29 23:37:21,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 319.
[2018-01-29 23:37:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states.
[2018-01-29 23:37:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 348 transitions.
[2018-01-29 23:37:21,527 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 348 transitions. Word has length 38
[2018-01-29 23:37:21,527 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:21,527 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 348 transitions.
[2018-01-29 23:37:21,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-29 23:37:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 348 transitions.
[2018-01-29 23:37:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39
[2018-01-29 23:37:21,530 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:21,530 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:21,530 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-01-29 23:37:21,531 INFO L82 PathProgramCache]: Analyzing trace with hash -409142071, now seen corresponding path program 1 times
[2018-01-29 23:37:21,531 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:21,531 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:21,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:21,532 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:21,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:21,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:21,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:37:21,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 23:37:21,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 23:37:21,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 23:37:21,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:37:21,621 INFO L87 Difference]: Start difference. First operand 319 states and 348 transitions. Second operand 5 states.
[2018-01-29 23:37:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:21,952 INFO L93 Difference]: Finished difference Result 322 states and 350 transitions.
[2018-01-29 23:37:21,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 23:37:21,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38
[2018-01-29 23:37:21,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:21,954 INFO L225 Difference]: With dead ends: 322
[2018-01-29 23:37:21,954 INFO L226 Difference]: Without dead ends: 321
[2018-01-29 23:37:21,955 INFO L553 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-01-29 23:37:21,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states.
[2018-01-29 23:37:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319.
[2018-01-29 23:37:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states.
[2018-01-29 23:37:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 346 transitions.
[2018-01-29 23:37:21,970 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 346 transitions. Word has length 38
[2018-01-29 23:37:21,970 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:21,970 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 346 transitions.
[2018-01-29 23:37:21,970 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 23:37:21,971 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 346 transitions.
[2018-01-29 23:37:21,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-01-29 23:37:21,971 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:21,972 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:21,972 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-01-29 23:37:21,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1438277668, now seen corresponding path program 1 times
[2018-01-29 23:37:21,972 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:21,972 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:21,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:21,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:21,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:21,992 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:22,336 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:22,337 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:22,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:22,406 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:22,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:37:22,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-01-29 23:37:22,516 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-01-29 23:37:22,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,524 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:22,525 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:22,527 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-01-29 23:37:22,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13
[2018-01-29 23:37:22,554 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-01-29 23:37:22,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-29 23:37:22,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,619 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-01-29 23:37:22,622 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-01-29 23:37:22,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,660 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31
[2018-01-29 23:37:22,750 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-01-29 23:37:22,753 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-01-29 23:37:22,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-01-29 23:37:22,771 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-01-29 23:37:22,772 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,780 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:34
[2018-01-29 23:37:22,858 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-01-29 23:37:22,861 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-01-29 23:37:22,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,873 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-01-29 23:37:22,875 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-01-29 23:37:22,876 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:22,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:12
[2018-01-29 23:37:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:22,932 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:37:22,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14
[2018-01-29 23:37:22,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-01-29 23:37:22,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-01-29 23:37:22,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210
[2018-01-29 23:37:22,934 INFO L87 Difference]: Start difference. First operand 319 states and 346 transitions. Second operand 15 states.
[2018-01-29 23:37:23,658 WARN L143 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 37
[2018-01-29 23:37:23,823 WARN L143 SmtUtils]: Spent 117ms on a formula simplification that was a NOOP. DAG size: 37
[2018-01-29 23:37:24,129 WARN L143 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 35
[2018-01-29 23:37:24,424 WARN L146 SmtUtils]: Spent 228ms on a formula simplification. DAG size of input: 42 DAG size of output 40
[2018-01-29 23:37:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:25,055 INFO L93 Difference]: Finished difference Result 650 states and 712 transitions.
[2018-01-29 23:37:25,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-01-29 23:37:25,055 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48
[2018-01-29 23:37:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:25,058 INFO L225 Difference]: With dead ends: 650
[2018-01-29 23:37:25,058 INFO L226 Difference]: Without dead ends: 350
[2018-01-29 23:37:25,060 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600
[2018-01-29 23:37:25,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states.
[2018-01-29 23:37:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 339.
[2018-01-29 23:37:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states.
[2018-01-29 23:37:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 368 transitions.
[2018-01-29 23:37:25,074 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 368 transitions. Word has length 48
[2018-01-29 23:37:25,075 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:25,075 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 368 transitions.
[2018-01-29 23:37:25,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-01-29 23:37:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 368 transitions.
[2018-01-29 23:37:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-01-29 23:37:25,076 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:25,076 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:25,076 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-01-29 23:37:25,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1438277669, now seen corresponding path program 1 times
[2018-01-29 23:37:25,076 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:25,076 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:25,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:25,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:25,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:25,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:25,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:25,205 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:25,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:25,250 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:25,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:37:25,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:25,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:25,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-01-29 23:37:25,266 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:25,267 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:25,268 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-01-29 23:37:25,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:25,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:25,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15
[2018-01-29 23:37:25,304 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-01-29 23:37:25,307 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-01-29 23:37:25,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:25,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:25,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:25,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27
[2018-01-29 23:37:25,377 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-01-29 23:37:25,381 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-01-29 23:37:25,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:25,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:25,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:25,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:27
[2018-01-29 23:37:25,398 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-01-29 23:37:25,401 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-01-29 23:37:25,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:25,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:25,413 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-01-29 23:37:25,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:15
[2018-01-29 23:37:25,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-01-29 23:37:25,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:37:25,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12
[2018-01-29 23:37:25,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-01-29 23:37:25,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-01-29 23:37:25,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156
[2018-01-29 23:37:25,500 INFO L87 Difference]: Start difference. First operand 339 states and 368 transitions. Second operand 13 states.
[2018-01-29 23:37:25,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:25,905 INFO L93 Difference]: Finished difference Result 347 states and 376 transitions.
[2018-01-29 23:37:25,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-29 23:37:25,905 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48
[2018-01-29 23:37:25,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:25,907 INFO L225 Difference]: With dead ends: 347
[2018-01-29 23:37:25,907 INFO L226 Difference]: Without dead ends: 346
[2018-01-29 23:37:25,908 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272
[2018-01-29 23:37:25,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states.
[2018-01-29 23:37:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 338.
[2018-01-29 23:37:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states.
[2018-01-29 23:37:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 364 transitions.
[2018-01-29 23:37:25,923 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 364 transitions. Word has length 48
[2018-01-29 23:37:25,924 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:25,924 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 364 transitions.
[2018-01-29 23:37:25,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-01-29 23:37:25,924 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 364 transitions.
[2018-01-29 23:37:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2018-01-29 23:37:25,925 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:25,925 INFO L350 BasicCegarLoop]: trace histogram [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]
[2018-01-29 23:37:25,925 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-01-29 23:37:25,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1356010606, now seen corresponding path program 2 times
[2018-01-29 23:37:25,926 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:25,926 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:25,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:25,927 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:25,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:25,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:25,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:26,357 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:26,357 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:26,366 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 23:37:26,393 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 23:37:26,409 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 23:37:26,415 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 23:37:26,423 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:26,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2018-01-29 23:37:26,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-01-29 23:37:26,440 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-01-29 23:37:26,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,448 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:26,449 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:26,450 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-01-29 23:37:26,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13
[2018-01-29 23:37:26,477 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-01-29 23:37:26,479 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-01-29 23:37:26,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,490 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-01-29 23:37:26,492 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-01-29 23:37:26,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31
[2018-01-29 23:37:26,544 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-01-29 23:37:26,546 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-01-29 23:37:26,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,563 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-01-29 23:37:26,565 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-01-29 23:37:26,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:34
[2018-01-29 23:37:26,631 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-01-29 23:37:26,635 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-01-29 23:37:26,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,665 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-01-29 23:37:26,668 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-01-29 23:37:26,668 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,692 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:119, output treesize:37
[2018-01-29 23:37:26,748 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-01-29 23:37:26,752 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-01-29 23:37:26,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,772 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-01-29 23:37:26,774 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-01-29 23:37:26,774 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:26,786 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:15
[2018-01-29 23:37:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:26,835 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:37:26,835 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18
[2018-01-29 23:37:26,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states
[2018-01-29 23:37:26,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2018-01-29 23:37:26,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342
[2018-01-29 23:37:26,836 INFO L87 Difference]: Start difference. First operand 338 states and 364 transitions. Second operand 19 states.
[2018-01-29 23:37:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:27,620 INFO L93 Difference]: Finished difference Result 687 states and 746 transitions.
[2018-01-29 23:37:27,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-01-29 23:37:27,621 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58
[2018-01-29 23:37:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:27,622 INFO L225 Difference]: With dead ends: 687
[2018-01-29 23:37:27,622 INFO L226 Difference]: Without dead ends: 368
[2018-01-29 23:37:27,623 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=206, Invalid=850, Unknown=0, NotChecked=0, Total=1056
[2018-01-29 23:37:27,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states.
[2018-01-29 23:37:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 358.
[2018-01-29 23:37:27,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states.
[2018-01-29 23:37:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 384 transitions.
[2018-01-29 23:37:27,634 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 384 transitions. Word has length 58
[2018-01-29 23:37:27,635 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:27,635 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 384 transitions.
[2018-01-29 23:37:27,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states.
[2018-01-29 23:37:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 384 transitions.
[2018-01-29 23:37:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2018-01-29 23:37:27,636 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:27,636 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 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]
[2018-01-29 23:37:27,636 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-01-29 23:37:27,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1988983424, now seen corresponding path program 3 times
[2018-01-29 23:37:27,636 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:27,637 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:27,637 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:27,637 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-29 23:37:27,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:27,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:28,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:28,042 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:28,046 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-01-29 23:37:28,066 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-01-29 23:37:28,074 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-01-29 23:37:28,083 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-01-29 23:37:28,093 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command
[2018-01-29 23:37:28,095 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 23:37:28,099 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:28,118 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-01-29 23:37:28,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-01-29 23:37:28,127 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:28,128 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:28,128 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-01-29 23:37:28,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,134 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 6 treesize of output 5
[2018-01-29 23:37:28,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13
[2018-01-29 23:37:28,163 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-01-29 23:37:28,166 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-01-29 23:37:28,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,178 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-01-29 23:37:28,180 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-01-29 23:37:28,180 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,191 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:31
[2018-01-29 23:37:28,246 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-01-29 23:37:28,248 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-01-29 23:37:28,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,261 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-01-29 23:37:28,263 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-01-29 23:37:28,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,270 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:31
[2018-01-29 23:37:28,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52
[2018-01-29 23:37:28,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-01-29 23:37:28,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,292 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-01-29 23:37:28,294 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-01-29 23:37:28,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,302 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:31
[2018-01-29 23:37:28,332 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-01-29 23:37:28,335 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-01-29 23:37:28,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,352 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 60 treesize of output 61
[2018-01-29 23:37:28,354 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-01-29 23:37:28,354 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,365 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:129, output treesize:44
[2018-01-29 23:37:28,483 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-01-29 23:37:28,485 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-01-29 23:37:28,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,497 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 32 treesize of output 26
[2018-01-29 23:37:28,499 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 26 treesize of output 11
[2018-01-29 23:37:28,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,501 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:28,508 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-01-29 23:37:28,508 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:70, output treesize:24
[2018-01-29 23:37:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2018-01-29 23:37:28,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:37:28,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26
[2018-01-29 23:37:28,563 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states
[2018-01-29 23:37:28,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2018-01-29 23:37:28,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702
[2018-01-29 23:37:28,564 INFO L87 Difference]: Start difference. First operand 358 states and 384 transitions. Second operand 27 states.
[2018-01-29 23:37:30,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:30,088 INFO L93 Difference]: Finished difference Result 732 states and 792 transitions.
[2018-01-29 23:37:30,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-01-29 23:37:30,088 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 68
[2018-01-29 23:37:30,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:30,089 INFO L225 Difference]: With dead ends: 732
[2018-01-29 23:37:30,089 INFO L226 Difference]: Without dead ends: 393
[2018-01-29 23:37:30,091 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=500, Invalid=1950, Unknown=0, NotChecked=0, Total=2450
[2018-01-29 23:37:30,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states.
[2018-01-29 23:37:30,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 371.
[2018-01-29 23:37:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states.
[2018-01-29 23:37:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 396 transitions.
[2018-01-29 23:37:30,101 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 396 transitions. Word has length 68
[2018-01-29 23:37:30,101 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:30,102 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 396 transitions.
[2018-01-29 23:37:30,102 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states.
[2018-01-29 23:37:30,102 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 396 transitions.
[2018-01-29 23:37:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2018-01-29 23:37:30,103 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:30,103 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:30,103 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-01-29 23:37:30,103 INFO L82 PathProgramCache]: Analyzing trace with hash 262705210, now seen corresponding path program 1 times
[2018-01-29 23:37:30,103 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:30,103 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:30,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:30,104 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-29 23:37:30,104 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:30,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked.
[2018-01-29 23:37:30,164 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:37:30,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 23:37:30,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 23:37:30,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 23:37:30,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 23:37:30,164 INFO L87 Difference]: Start difference. First operand 371 states and 396 transitions. Second operand 4 states.
[2018-01-29 23:37:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:30,323 INFO L93 Difference]: Finished difference Result 377 states and 402 transitions.
[2018-01-29 23:37:30,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-01-29 23:37:30,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97
[2018-01-29 23:37:30,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:30,326 INFO L225 Difference]: With dead ends: 377
[2018-01-29 23:37:30,326 INFO L226 Difference]: Without dead ends: 373
[2018-01-29 23:37:30,326 INFO L553 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-01-29 23:37:30,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states.
[2018-01-29 23:37:30,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 367.
[2018-01-29 23:37:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states.
[2018-01-29 23:37:30,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 388 transitions.
[2018-01-29 23:37:30,338 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 388 transitions. Word has length 97
[2018-01-29 23:37:30,339 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:30,339 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 388 transitions.
[2018-01-29 23:37:30,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 23:37:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 388 transitions.
[2018-01-29 23:37:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2018-01-29 23:37:30,340 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:30,340 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:30,340 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-01-29 23:37:30,341 INFO L82 PathProgramCache]: Analyzing trace with hash 262705211, now seen corresponding path program 1 times
[2018-01-29 23:37:30,341 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:30,341 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:30,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:30,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:30,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:30,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:30,467 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:30,467 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:30,472 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:30,510 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:30,542 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:30,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:37:30,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13
[2018-01-29 23:37:30,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-01-29 23:37:30,572 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-01-29 23:37:30,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156
[2018-01-29 23:37:30,573 INFO L87 Difference]: Start difference. First operand 367 states and 388 transitions. Second operand 13 states.
[2018-01-29 23:37:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:30,647 INFO L93 Difference]: Finished difference Result 749 states and 796 transitions.
[2018-01-29 23:37:30,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-01-29 23:37:30,647 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97
[2018-01-29 23:37:30,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:30,649 INFO L225 Difference]: With dead ends: 749
[2018-01-29 23:37:30,649 INFO L226 Difference]: Without dead ends: 401
[2018-01-29 23:37:30,650 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420
[2018-01-29 23:37:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states.
[2018-01-29 23:37:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 387.
[2018-01-29 23:37:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states.
[2018-01-29 23:37:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 408 transitions.
[2018-01-29 23:37:30,664 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 408 transitions. Word has length 97
[2018-01-29 23:37:30,664 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:30,664 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 408 transitions.
[2018-01-29 23:37:30,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-01-29 23:37:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 408 transitions.
[2018-01-29 23:37:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2018-01-29 23:37:30,665 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:30,665 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:30,666 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-01-29 23:37:30,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1522686441, now seen corresponding path program 2 times
[2018-01-29 23:37:30,666 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:30,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:30,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:30,667 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:30,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:30,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:30,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:30,822 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:30,831 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 23:37:30,853 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 23:37:30,855 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 23:37:30,859 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:30,873 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-01-29 23:37:30,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:30,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:30,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-29 23:37:30,898 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked.
[2018-01-29 23:37:30,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-29 23:37:30,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 15
[2018-01-29 23:37:30,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-01-29 23:37:30,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-01-29 23:37:30,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210
[2018-01-29 23:37:30,919 INFO L87 Difference]: Start difference. First operand 387 states and 408 transitions. Second operand 15 states.
[2018-01-29 23:37:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:31,289 INFO L93 Difference]: Finished difference Result 791 states and 842 transitions.
[2018-01-29 23:37:31,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-01-29 23:37:31,289 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 107
[2018-01-29 23:37:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:31,291 INFO L225 Difference]: With dead ends: 791
[2018-01-29 23:37:31,292 INFO L226 Difference]: Without dead ends: 423
[2018-01-29 23:37:31,293 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650
[2018-01-29 23:37:31,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states.
[2018-01-29 23:37:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 403.
[2018-01-29 23:37:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states.
[2018-01-29 23:37:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 420 transitions.
[2018-01-29 23:37:31,306 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 420 transitions. Word has length 107
[2018-01-29 23:37:31,306 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:31,306 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 420 transitions.
[2018-01-29 23:37:31,306 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-01-29 23:37:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 420 transitions.
[2018-01-29 23:37:31,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2018-01-29 23:37:31,307 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:31,308 INFO L350 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:31,308 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-01-29 23:37:31,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1087696910, now seen corresponding path program 1 times
[2018-01-29 23:37:31,308 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:31,308 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:31,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:31,309 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-29 23:37:31,309 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:31,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:31,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:31,475 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:31,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:31,537 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:31,608 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:37:31,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17
[2018-01-29 23:37:31,609 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-01-29 23:37:31,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-01-29 23:37:31,609 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272
[2018-01-29 23:37:31,610 INFO L87 Difference]: Start difference. First operand 403 states and 420 transitions. Second operand 17 states.
[2018-01-29 23:37:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:31,838 INFO L93 Difference]: Finished difference Result 821 states and 860 transitions.
[2018-01-29 23:37:31,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2018-01-29 23:37:31,838 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 120
[2018-01-29 23:37:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:31,840 INFO L225 Difference]: With dead ends: 821
[2018-01-29 23:37:31,840 INFO L226 Difference]: Without dead ends: 437
[2018-01-29 23:37:31,842 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812
[2018-01-29 23:37:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states.
[2018-01-29 23:37:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 423.
[2018-01-29 23:37:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states.
[2018-01-29 23:37:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 440 transitions.
[2018-01-29 23:37:31,856 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 440 transitions. Word has length 120
[2018-01-29 23:37:31,856 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:31,856 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 440 transitions.
[2018-01-29 23:37:31,856 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-01-29 23:37:31,857 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 440 transitions.
[2018-01-29 23:37:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2018-01-29 23:37:31,858 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:31,858 INFO L350 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:31,858 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-01-29 23:37:31,858 INFO L82 PathProgramCache]: Analyzing trace with hash 198714016, now seen corresponding path program 2 times
[2018-01-29 23:37:31,858 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:31,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:31,859 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:31,859 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:31,860 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:31,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:32,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:32,138 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:32,151 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 23:37:32,184 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 23:37:32,189 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 23:37:32,194 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:32,200 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-01-29 23:37:32,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:32,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:32,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5
[2018-01-29 23:37:32,259 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-01-29 23:37:32,264 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (let ((.cse0 (store |c_old(#valid)| |create_data_#t~malloc3.base| 1))) (and (= (select .cse0 |create_data_#t~malloc4.base|) 0) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)) (= |c_#valid| (store .cse0 |create_data_#t~malloc4.base| 1))))) is different from true
[2018-01-29 23:37:32,407 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:32,408 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:32,409 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:32,410 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 25 treesize of output 42
[2018-01-29 23:37:32,414 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34
[2018-01-29 23:37:32,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:32,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:32,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:37:32,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:28
[2018-01-29 23:37:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked.
[2018-01-29 23:37:32,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-29 23:37:32,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 24
[2018-01-29 23:37:32,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-01-29 23:37:32,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-01-29 23:37:32,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=373, Unknown=2, NotChecked=82, Total=552
[2018-01-29 23:37:32,585 INFO L87 Difference]: Start difference. First operand 423 states and 440 transitions. Second operand 24 states.
[2018-01-29 23:37:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:33,891 INFO L93 Difference]: Finished difference Result 921 states and 971 transitions.
[2018-01-29 23:37:33,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2018-01-29 23:37:33,893 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 130
[2018-01-29 23:37:33,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:33,895 INFO L225 Difference]: With dead ends: 921
[2018-01-29 23:37:33,895 INFO L226 Difference]: Without dead ends: 517
[2018-01-29 23:37:33,897 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=480, Invalid=1470, Unknown=38, NotChecked=174, Total=2162
[2018-01-29 23:37:33,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states.
[2018-01-29 23:37:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 473.
[2018-01-29 23:37:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states.
[2018-01-29 23:37:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 498 transitions.
[2018-01-29 23:37:33,917 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 498 transitions. Word has length 130
[2018-01-29 23:37:33,918 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:33,918 INFO L432 AbstractCegarLoop]: Abstraction has 473 states and 498 transitions.
[2018-01-29 23:37:33,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-01-29 23:37:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 498 transitions.
[2018-01-29 23:37:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2018-01-29 23:37:33,919 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:33,920 INFO L350 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:33,920 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-01-29 23:37:33,920 INFO L82 PathProgramCache]: Analyzing trace with hash -999110989, now seen corresponding path program 1 times
[2018-01-29 23:37:33,920 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:33,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:33,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:33,921 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-29 23:37:33,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:33,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:34,161 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:34,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:34,161 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:34,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:34,214 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:34,258 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:34,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:37:34,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21
[2018-01-29 23:37:34,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-01-29 23:37:34,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-01-29 23:37:34,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420
[2018-01-29 23:37:34,292 INFO L87 Difference]: Start difference. First operand 473 states and 498 transitions. Second operand 21 states.
[2018-01-29 23:37:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:34,633 INFO L93 Difference]: Finished difference Result 961 states and 1017 transitions.
[2018-01-29 23:37:34,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-01-29 23:37:34,636 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 140
[2018-01-29 23:37:34,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:34,638 INFO L225 Difference]: With dead ends: 961
[2018-01-29 23:37:34,638 INFO L226 Difference]: Without dead ends: 507
[2018-01-29 23:37:34,640 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=427, Invalid=905, Unknown=0, NotChecked=0, Total=1332
[2018-01-29 23:37:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states.
[2018-01-29 23:37:34,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 493.
[2018-01-29 23:37:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states.
[2018-01-29 23:37:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 518 transitions.
[2018-01-29 23:37:34,665 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 518 transitions. Word has length 140
[2018-01-29 23:37:34,665 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:34,665 INFO L432 AbstractCegarLoop]: Abstraction has 493 states and 518 transitions.
[2018-01-29 23:37:34,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-01-29 23:37:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 518 transitions.
[2018-01-29 23:37:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2018-01-29 23:37:34,667 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:34,667 INFO L350 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:34,667 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-01-29 23:37:34,668 INFO L82 PathProgramCache]: Analyzing trace with hash -14353339, now seen corresponding path program 2 times
[2018-01-29 23:37:34,668 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:34,668 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:34,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:34,669 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:34,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:34,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:35,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:35,038 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:35,049 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 23:37:35,085 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 23:37:35,090 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 23:37:35,111 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:35,281 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) |c_#length|) (= (select (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base|) 0) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true
[2018-01-29 23:37:35,398 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:35,405 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:35,407 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:35,408 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-01-29 23:37:35,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:35,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 23
[2018-01-29 23:37:35,466 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:35,466 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36
[2018-01-29 23:37:35,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:35,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:35,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:37:35,485 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29
[2018-01-29 23:37:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked.
[2018-01-29 23:37:35,614 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-29 23:37:35,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 29
[2018-01-29 23:37:35,615 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states
[2018-01-29 23:37:35,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2018-01-29 23:37:35,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=619, Unknown=2, NotChecked=52, Total=812
[2018-01-29 23:37:35,616 INFO L87 Difference]: Start difference. First operand 493 states and 518 transitions. Second operand 29 states.
[2018-01-29 23:37:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:38,062 INFO L93 Difference]: Finished difference Result 1040 states and 1099 transitions.
[2018-01-29 23:37:38,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states.
[2018-01-29 23:37:38,068 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 150
[2018-01-29 23:37:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:38,070 INFO L225 Difference]: With dead ends: 1040
[2018-01-29 23:37:38,070 INFO L226 Difference]: Without dead ends: 566
[2018-01-29 23:37:38,072 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=751, Invalid=2592, Unknown=83, NotChecked=114, Total=3540
[2018-01-29 23:37:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states.
[2018-01-29 23:37:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 534.
[2018-01-29 23:37:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states.
[2018-01-29 23:37:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 563 transitions.
[2018-01-29 23:37:38,091 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 563 transitions. Word has length 150
[2018-01-29 23:37:38,092 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:38,092 INFO L432 AbstractCegarLoop]: Abstraction has 534 states and 563 transitions.
[2018-01-29 23:37:38,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states.
[2018-01-29 23:37:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 563 transitions.
[2018-01-29 23:37:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2018-01-29 23:37:38,093 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:38,093 INFO L350 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:38,093 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-01-29 23:37:38,094 INFO L82 PathProgramCache]: Analyzing trace with hash -51885767, now seen corresponding path program 1 times
[2018-01-29 23:37:38,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:38,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:38,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:38,094 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-29 23:37:38,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:38,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:38,389 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:38,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:38,389 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:38,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:38,466 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:38,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:37:38,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25
[2018-01-29 23:37:38,554 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states
[2018-01-29 23:37:38,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2018-01-29 23:37:38,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600
[2018-01-29 23:37:38,554 INFO L87 Difference]: Start difference. First operand 534 states and 563 transitions. Second operand 25 states.
[2018-01-29 23:37:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:39,135 INFO L93 Difference]: Finished difference Result 1083 states and 1149 transitions.
[2018-01-29 23:37:39,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-01-29 23:37:39,135 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 162
[2018-01-29 23:37:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:39,137 INFO L225 Difference]: With dead ends: 1083
[2018-01-29 23:37:39,137 INFO L226 Difference]: Without dead ends: 568
[2018-01-29 23:37:39,138 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=631, Invalid=1349, Unknown=0, NotChecked=0, Total=1980
[2018-01-29 23:37:39,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states.
[2018-01-29 23:37:39,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 554.
[2018-01-29 23:37:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states.
[2018-01-29 23:37:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 583 transitions.
[2018-01-29 23:37:39,170 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 583 transitions. Word has length 162
[2018-01-29 23:37:39,170 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:39,170 INFO L432 AbstractCegarLoop]: Abstraction has 554 states and 583 transitions.
[2018-01-29 23:37:39,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states.
[2018-01-29 23:37:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 583 transitions.
[2018-01-29 23:37:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2018-01-29 23:37:39,172 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:39,172 INFO L350 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:39,172 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-01-29 23:37:39,173 INFO L82 PathProgramCache]: Analyzing trace with hash -618781365, now seen corresponding path program 2 times
[2018-01-29 23:37:39,173 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:39,173 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:39,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:39,174 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:39,174 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:39,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:39,637 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:39,637 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:39,642 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 23:37:39,676 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 23:37:39,680 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 23:37:39,683 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:39,707 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-01-29 23:37:39,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:37:39,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:39,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:39,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:39,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7
[2018-01-29 23:37:39,847 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 15 treesize of output 11
[2018-01-29 23:37:39,849 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 11 treesize of output 3
[2018-01-29 23:37:39,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:39,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:39,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:39,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3
[2018-01-29 23:37:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked.
[2018-01-29 23:37:40,161 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-29 23:37:40,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [25] total 29
[2018-01-29 23:37:40,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states
[2018-01-29 23:37:40,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2018-01-29 23:37:40,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812
[2018-01-29 23:37:40,164 INFO L87 Difference]: Start difference. First operand 554 states and 583 transitions. Second operand 29 states.
[2018-01-29 23:37:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:40,847 INFO L93 Difference]: Finished difference Result 1205 states and 1279 transitions.
[2018-01-29 23:37:40,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states.
[2018-01-29 23:37:40,848 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 172
[2018-01-29 23:37:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:40,851 INFO L225 Difference]: With dead ends: 1205
[2018-01-29 23:37:40,851 INFO L226 Difference]: Without dead ends: 670
[2018-01-29 23:37:40,853 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080
[2018-01-29 23:37:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states.
[2018-01-29 23:37:40,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 582.
[2018-01-29 23:37:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states.
[2018-01-29 23:37:40,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 611 transitions.
[2018-01-29 23:37:40,885 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 611 transitions. Word has length 172
[2018-01-29 23:37:40,886 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:40,886 INFO L432 AbstractCegarLoop]: Abstraction has 582 states and 611 transitions.
[2018-01-29 23:37:40,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states.
[2018-01-29 23:37:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 611 transitions.
[2018-01-29 23:37:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2018-01-29 23:37:40,888 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:40,888 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:40,888 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-01-29 23:37:40,888 INFO L82 PathProgramCache]: Analyzing trace with hash 700067965, now seen corresponding path program 1 times
[2018-01-29 23:37:40,888 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:40,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:40,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:40,889 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-29 23:37:40,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:40,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:40,987 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked.
[2018-01-29 23:37:40,987 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:37:40,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 23:37:40,988 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-01-29 23:37:40,988 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-01-29 23:37:40,988 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-01-29 23:37:40,989 INFO L87 Difference]: Start difference. First operand 582 states and 611 transitions. Second operand 4 states.
[2018-01-29 23:37:41,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:41,037 INFO L93 Difference]: Finished difference Result 1169 states and 1236 transitions.
[2018-01-29 23:37:41,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-01-29 23:37:41,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182
[2018-01-29 23:37:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:41,042 INFO L225 Difference]: With dead ends: 1169
[2018-01-29 23:37:41,042 INFO L226 Difference]: Without dead ends: 606
[2018-01-29 23:37:41,043 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:37:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states.
[2018-01-29 23:37:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 588.
[2018-01-29 23:37:41,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states.
[2018-01-29 23:37:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 613 transitions.
[2018-01-29 23:37:41,075 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 613 transitions. Word has length 182
[2018-01-29 23:37:41,076 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:41,076 INFO L432 AbstractCegarLoop]: Abstraction has 588 states and 613 transitions.
[2018-01-29 23:37:41,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-01-29 23:37:41,076 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 613 transitions.
[2018-01-29 23:37:41,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183
[2018-01-29 23:37:41,077 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:41,078 INFO L350 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:41,078 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-01-29 23:37:41,078 INFO L82 PathProgramCache]: Analyzing trace with hash -260517012, now seen corresponding path program 1 times
[2018-01-29 23:37:41,078 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:41,078 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:41,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:41,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:41,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:41,109 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:41,489 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:41,489 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:41,495 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:41,554 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:41,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:37:41,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29
[2018-01-29 23:37:41,644 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states
[2018-01-29 23:37:41,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2018-01-29 23:37:41,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812
[2018-01-29 23:37:41,645 INFO L87 Difference]: Start difference. First operand 588 states and 613 transitions. Second operand 29 states.
[2018-01-29 23:37:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:42,282 INFO L93 Difference]: Finished difference Result 1191 states and 1249 transitions.
[2018-01-29 23:37:42,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states.
[2018-01-29 23:37:42,282 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 182
[2018-01-29 23:37:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:42,285 INFO L225 Difference]: With dead ends: 1191
[2018-01-29 23:37:42,286 INFO L226 Difference]: Without dead ends: 622
[2018-01-29 23:37:42,288 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1881, Unknown=0, NotChecked=0, Total=2756
[2018-01-29 23:37:42,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states.
[2018-01-29 23:37:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 608.
[2018-01-29 23:37:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states.
[2018-01-29 23:37:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 633 transitions.
[2018-01-29 23:37:42,320 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 633 transitions. Word has length 182
[2018-01-29 23:37:42,321 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:42,321 INFO L432 AbstractCegarLoop]: Abstraction has 608 states and 633 transitions.
[2018-01-29 23:37:42,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states.
[2018-01-29 23:37:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 633 transitions.
[2018-01-29 23:37:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193
[2018-01-29 23:37:42,323 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:42,323 INFO L350 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:42,323 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-01-29 23:37:42,323 INFO L82 PathProgramCache]: Analyzing trace with hash -135662978, now seen corresponding path program 2 times
[2018-01-29 23:37:42,323 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:42,324 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:42,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:42,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:42,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:42,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 0 proven. 806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:42,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:42,888 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:42,893 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 23:37:42,917 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 23:37:42,921 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 23:37:42,925 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:42,961 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-01-29 23:37:42,964 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-01-29 23:37:43,093 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:43,094 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:43,095 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-01-29 23:37:43,100 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-01-29 23:37:43,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:43,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:43,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:37:43,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20
[2018-01-29 23:37:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked.
[2018-01-29 23:37:43,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-29 23:37:43,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [29] total 34
[2018-01-29 23:37:43,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states
[2018-01-29 23:37:43,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2018-01-29 23:37:43,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=763, Unknown=2, NotChecked=122, Total=1122
[2018-01-29 23:37:43,299 INFO L87 Difference]: Start difference. First operand 608 states and 633 transitions. Second operand 34 states.
[2018-01-29 23:37:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:44,651 INFO L93 Difference]: Finished difference Result 1241 states and 1302 transitions.
[2018-01-29 23:37:44,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states.
[2018-01-29 23:37:44,652 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 192
[2018-01-29 23:37:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:44,653 INFO L225 Difference]: With dead ends: 1241
[2018-01-29 23:37:44,654 INFO L226 Difference]: Without dead ends: 652
[2018-01-29 23:37:44,655 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1408, Invalid=3605, Unknown=107, NotChecked=282, Total=5402
[2018-01-29 23:37:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states.
[2018-01-29 23:37:44,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 634.
[2018-01-29 23:37:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states.
[2018-01-29 23:37:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 661 transitions.
[2018-01-29 23:37:44,680 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 661 transitions. Word has length 192
[2018-01-29 23:37:44,680 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:44,680 INFO L432 AbstractCegarLoop]: Abstraction has 634 states and 661 transitions.
[2018-01-29 23:37:44,680 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states.
[2018-01-29 23:37:44,680 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 661 transitions.
[2018-01-29 23:37:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203
[2018-01-29 23:37:44,681 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:44,681 INFO L350 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:44,681 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-01-29 23:37:44,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1339351825, now seen corresponding path program 1 times
[2018-01-29 23:37:44,682 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:44,682 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:44,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:44,682 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-29 23:37:44,682 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:44,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 0 proven. 938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:45,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:45,376 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:45,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:45,443 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 0 proven. 938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:45,508 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:37:45,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33
[2018-01-29 23:37:45,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states
[2018-01-29 23:37:45,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2018-01-29 23:37:45,509 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056
[2018-01-29 23:37:45,510 INFO L87 Difference]: Start difference. First operand 634 states and 661 transitions. Second operand 33 states.
[2018-01-29 23:37:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:45,890 INFO L93 Difference]: Finished difference Result 1283 states and 1345 transitions.
[2018-01-29 23:37:45,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states.
[2018-01-29 23:37:45,890 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 202
[2018-01-29 23:37:45,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:45,894 INFO L225 Difference]: With dead ends: 1283
[2018-01-29 23:37:45,894 INFO L226 Difference]: Without dead ends: 668
[2018-01-29 23:37:45,896 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1159, Invalid=2501, Unknown=0, NotChecked=0, Total=3660
[2018-01-29 23:37:45,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states.
[2018-01-29 23:37:45,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 654.
[2018-01-29 23:37:45,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states.
[2018-01-29 23:37:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 681 transitions.
[2018-01-29 23:37:45,935 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 681 transitions. Word has length 202
[2018-01-29 23:37:45,935 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:45,936 INFO L432 AbstractCegarLoop]: Abstraction has 654 states and 681 transitions.
[2018-01-29 23:37:45,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states.
[2018-01-29 23:37:45,936 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 681 transitions.
[2018-01-29 23:37:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213
[2018-01-29 23:37:45,937 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:45,937 INFO L350 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:45,938 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-01-29 23:37:45,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1656634077, now seen corresponding path program 2 times
[2018-01-29 23:37:45,938 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:45,938 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:45,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:45,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:45,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:45,971 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:46,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:46,694 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:46,702 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 23:37:46,730 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 23:37:46,734 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 23:37:46,738 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:46,846 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) |c_#length|) (= (select (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base|) 0) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true
[2018-01-29 23:37:47,021 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:47,023 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 17 treesize of output 23
[2018-01-29 23:37:47,026 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:47,029 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:47,029 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36
[2018-01-29 23:37:47,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:47,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:47,069 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:47,070 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:47,070 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:47,071 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:47,071 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-01-29 23:37:47,072 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:47,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:37:47,080 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29
[2018-01-29 23:37:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1080 trivial. 0 not checked.
[2018-01-29 23:37:47,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-29 23:37:47,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [33] total 39
[2018-01-29 23:37:47,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states
[2018-01-29 23:37:47,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2018-01-29 23:37:47,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1107, Unknown=2, NotChecked=72, Total=1482
[2018-01-29 23:37:47,300 INFO L87 Difference]: Start difference. First operand 654 states and 681 transitions. Second operand 39 states.
[2018-01-29 23:37:49,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:49,550 INFO L93 Difference]: Finished difference Result 1324 states and 1388 transitions.
[2018-01-29 23:37:49,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states.
[2018-01-29 23:37:49,550 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 212
[2018-01-29 23:37:49,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:49,552 INFO L225 Difference]: With dead ends: 1324
[2018-01-29 23:37:49,552 INFO L226 Difference]: Without dead ends: 689
[2018-01-29 23:37:49,555 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1542 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1838, Invalid=5122, Unknown=184, NotChecked=166, Total=7310
[2018-01-29 23:37:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states.
[2018-01-29 23:37:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 673.
[2018-01-29 23:37:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states.
[2018-01-29 23:37:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 698 transitions.
[2018-01-29 23:37:49,594 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 698 transitions. Word has length 212
[2018-01-29 23:37:49,594 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:49,595 INFO L432 AbstractCegarLoop]: Abstraction has 673 states and 698 transitions.
[2018-01-29 23:37:49,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states.
[2018-01-29 23:37:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 698 transitions.
[2018-01-29 23:37:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2018-01-29 23:37:49,596 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:49,596 INFO L350 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:49,597 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-01-29 23:37:49,597 INFO L82 PathProgramCache]: Analyzing trace with hash -173964312, now seen corresponding path program 1 times
[2018-01-29 23:37:49,597 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:49,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:49,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:49,598 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-29 23:37:49,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:49,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 0 proven. 1232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:50,752 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:50,752 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:50,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:50,831 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 0 proven. 1232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:50,904 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:37:50,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37
[2018-01-29 23:37:50,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states
[2018-01-29 23:37:50,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants.
[2018-01-29 23:37:50,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332
[2018-01-29 23:37:50,905 INFO L87 Difference]: Start difference. First operand 673 states and 698 transitions. Second operand 37 states.
[2018-01-29 23:37:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:51,448 INFO L93 Difference]: Finished difference Result 1361 states and 1419 transitions.
[2018-01-29 23:37:51,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states.
[2018-01-29 23:37:51,449 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 224
[2018-01-29 23:37:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:51,452 INFO L225 Difference]: With dead ends: 1361
[2018-01-29 23:37:51,452 INFO L226 Difference]: Without dead ends: 707
[2018-01-29 23:37:51,455 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1483, Invalid=3209, Unknown=0, NotChecked=0, Total=4692
[2018-01-29 23:37:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states.
[2018-01-29 23:37:51,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 693.
[2018-01-29 23:37:51,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states.
[2018-01-29 23:37:51,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 718 transitions.
[2018-01-29 23:37:51,496 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 718 transitions. Word has length 224
[2018-01-29 23:37:51,496 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:51,496 INFO L432 AbstractCegarLoop]: Abstraction has 693 states and 718 transitions.
[2018-01-29 23:37:51,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states.
[2018-01-29 23:37:51,496 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 718 transitions.
[2018-01-29 23:37:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235
[2018-01-29 23:37:51,498 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:51,498 INFO L350 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:51,498 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-01-29 23:37:51,499 INFO L82 PathProgramCache]: Analyzing trace with hash 718646394, now seen corresponding path program 2 times
[2018-01-29 23:37:51,499 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:51,499 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:51,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:51,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:51,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:51,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 0 proven. 1394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:52,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:52,274 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:52,280 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 23:37:52,306 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 23:37:52,309 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 23:37:52,313 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:52,349 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-01-29 23:37:52,352 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-01-29 23:37:52,437 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:52,438 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:52,438 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-01-29 23:37:52,443 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-01-29 23:37:52,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:52,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:52,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:37:52,452 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20
[2018-01-29 23:37:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1394 trivial. 0 not checked.
[2018-01-29 23:37:52,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-29 23:37:52,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [37] total 42
[2018-01-29 23:37:52,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states
[2018-01-29 23:37:52,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2018-01-29 23:37:52,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1195, Unknown=2, NotChecked=154, Total=1722
[2018-01-29 23:37:52,614 INFO L87 Difference]: Start difference. First operand 693 states and 718 transitions. Second operand 42 states.
[2018-01-29 23:37:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:54,369 INFO L93 Difference]: Finished difference Result 1441 states and 1505 transitions.
[2018-01-29 23:37:54,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states.
[2018-01-29 23:37:54,369 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 234
[2018-01-29 23:37:54,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:54,374 INFO L225 Difference]: With dead ends: 1441
[2018-01-29 23:37:54,374 INFO L226 Difference]: Without dead ends: 767
[2018-01-29 23:37:54,378 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1885 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2312, Invalid=5895, Unknown=173, NotChecked=362, Total=8742
[2018-01-29 23:37:54,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states.
[2018-01-29 23:37:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 730.
[2018-01-29 23:37:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states.
[2018-01-29 23:37:54,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 758 transitions.
[2018-01-29 23:37:54,427 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 758 transitions. Word has length 234
[2018-01-29 23:37:54,428 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:54,428 INFO L432 AbstractCegarLoop]: Abstraction has 730 states and 758 transitions.
[2018-01-29 23:37:54,428 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states.
[2018-01-29 23:37:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 758 transitions.
[2018-01-29 23:37:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245
[2018-01-29 23:37:54,430 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:54,430 INFO L350 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:54,430 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-01-29 23:37:54,430 INFO L82 PathProgramCache]: Analyzing trace with hash 358991501, now seen corresponding path program 1 times
[2018-01-29 23:37:54,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:54,431 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:54,431 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:54,432 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-29 23:37:54,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:54,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 1566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:55,282 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:55,282 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:55,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:55,348 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 1566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:55,418 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:37:55,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41
[2018-01-29 23:37:55,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states
[2018-01-29 23:37:55,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2018-01-29 23:37:55,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640
[2018-01-29 23:37:55,419 INFO L87 Difference]: Start difference. First operand 730 states and 758 transitions. Second operand 41 states.
[2018-01-29 23:37:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:55,968 INFO L93 Difference]: Finished difference Result 1475 states and 1540 transitions.
[2018-01-29 23:37:55,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states.
[2018-01-29 23:37:55,968 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 244
[2018-01-29 23:37:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:55,971 INFO L225 Difference]: With dead ends: 1475
[2018-01-29 23:37:55,971 INFO L226 Difference]: Without dead ends: 764
[2018-01-29 23:37:55,972 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1847, Invalid=4005, Unknown=0, NotChecked=0, Total=5852
[2018-01-29 23:37:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states.
[2018-01-29 23:37:55,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 750.
[2018-01-29 23:37:55,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states.
[2018-01-29 23:37:56,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 778 transitions.
[2018-01-29 23:37:56,000 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 778 transitions. Word has length 244
[2018-01-29 23:37:56,000 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:37:56,000 INFO L432 AbstractCegarLoop]: Abstraction has 750 states and 778 transitions.
[2018-01-29 23:37:56,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states.
[2018-01-29 23:37:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 778 transitions.
[2018-01-29 23:37:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2018-01-29 23:37:56,001 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:37:56,002 INFO L350 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:37:56,002 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-01-29 23:37:56,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1104023009, now seen corresponding path program 2 times
[2018-01-29 23:37:56,002 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:37:56,002 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:37:56,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:56,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:37:56,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:37:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:37:56,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:37:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1748 backedges. 0 proven. 1748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-01-29 23:37:56,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:37:56,828 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:37:56,833 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-01-29 23:37:56,860 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command
[2018-01-29 23:37:56,864 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-01-29 23:37:56,869 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:37:57,032 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) |c_#length|) (= (select (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base|) 0) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true
[2018-01-29 23:37:57,184 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:57,185 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 17 treesize of output 23
[2018-01-29 23:37:57,187 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:57,189 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:57,189 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 36
[2018-01-29 23:37:57,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:57,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:57,207 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:57,207 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:57,208 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:57,209 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:37:57,209 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-01-29 23:37:57,210 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:37:57,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:37:57,218 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29
[2018-01-29 23:37:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1748 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1748 trivial. 0 not checked.
[2018-01-29 23:37:57,470 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-29 23:37:57,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [41] total 49
[2018-01-29 23:37:57,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states
[2018-01-29 23:37:57,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants.
[2018-01-29 23:37:57,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=1799, Unknown=2, NotChecked=92, Total=2352
[2018-01-29 23:37:57,471 INFO L87 Difference]: Start difference. First operand 750 states and 778 transitions. Second operand 49 states.
[2018-01-29 23:37:59,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:37:59,985 INFO L93 Difference]: Finished difference Result 1539 states and 1607 transitions.
[2018-01-29 23:37:59,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states.
[2018-01-29 23:37:59,985 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 254
[2018-01-29 23:37:59,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:37:59,987 INFO L225 Difference]: With dead ends: 1539
[2018-01-29 23:37:59,988 INFO L226 Difference]: Without dead ends: 808
[2018-01-29 23:37:59,990 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2784 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2881, Invalid=8853, Unknown=260, NotChecked=216, Total=12210
[2018-01-29 23:37:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states.
[2018-01-29 23:38:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 770.
[2018-01-29 23:38:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states.
[2018-01-29 23:38:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 797 transitions.
[2018-01-29 23:38:00,020 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 797 transitions. Word has length 254
[2018-01-29 23:38:00,020 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:00,020 INFO L432 AbstractCegarLoop]: Abstraction has 770 states and 797 transitions.
[2018-01-29 23:38:00,020 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states.
[2018-01-29 23:38:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 797 transitions.
[2018-01-29 23:38:00,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266
[2018-01-29 23:38:00,021 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:00,022 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:00,022 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-01-29 23:38:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1538482900, now seen corresponding path program 1 times
[2018-01-29 23:38:00,022 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:00,022 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:00,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:00,023 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-01-29 23:38:00,023 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:00,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:00,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:00,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 23:38:00,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 23:38:00,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 23:38:00,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:38:00,169 INFO L87 Difference]: Start difference. First operand 770 states and 797 transitions. Second operand 5 states.
[2018-01-29 23:38:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:00,414 INFO L93 Difference]: Finished difference Result 770 states and 797 transitions.
[2018-01-29 23:38:00,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-01-29 23:38:00,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 265
[2018-01-29 23:38:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:00,417 INFO L225 Difference]: With dead ends: 770
[2018-01-29 23:38:00,417 INFO L226 Difference]: Without dead ends: 769
[2018-01-29 23:38:00,418 INFO L553 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-01-29 23:38:00,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states.
[2018-01-29 23:38:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769.
[2018-01-29 23:38:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states.
[2018-01-29 23:38:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 796 transitions.
[2018-01-29 23:38:00,447 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 796 transitions. Word has length 265
[2018-01-29 23:38:00,448 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:00,448 INFO L432 AbstractCegarLoop]: Abstraction has 769 states and 796 transitions.
[2018-01-29 23:38:00,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 23:38:00,448 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 796 transitions.
[2018-01-29 23:38:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266
[2018-01-29 23:38:00,449 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:00,450 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:00,450 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-01-29 23:38:00,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1538482901, now seen corresponding path program 1 times
[2018-01-29 23:38:00,450 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:00,450 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:00,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:00,451 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:00,451 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:00,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:00,794 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:00,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-29 23:38:00,795 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-01-29 23:38:00,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-01-29 23:38:00,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2018-01-29 23:38:00,795 INFO L87 Difference]: Start difference. First operand 769 states and 796 transitions. Second operand 6 states.
[2018-01-29 23:38:01,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:01,165 INFO L93 Difference]: Finished difference Result 771 states and 798 transitions.
[2018-01-29 23:38:01,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-29 23:38:01,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265
[2018-01-29 23:38:01,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:01,168 INFO L225 Difference]: With dead ends: 771
[2018-01-29 23:38:01,169 INFO L226 Difference]: Without dead ends: 764
[2018-01-29 23:38:01,169 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2018-01-29 23:38:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states.
[2018-01-29 23:38:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764.
[2018-01-29 23:38:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states.
[2018-01-29 23:38:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 791 transitions.
[2018-01-29 23:38:01,220 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 791 transitions. Word has length 265
[2018-01-29 23:38:01,220 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:01,221 INFO L432 AbstractCegarLoop]: Abstraction has 764 states and 791 transitions.
[2018-01-29 23:38:01,221 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-01-29 23:38:01,221 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 791 transitions.
[2018-01-29 23:38:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267
[2018-01-29 23:38:01,222 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:01,223 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:01,223 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-01-29 23:38:01,223 INFO L82 PathProgramCache]: Analyzing trace with hash -652515550, now seen corresponding path program 1 times
[2018-01-29 23:38:01,223 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:01,223 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:01,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:01,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:01,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:01,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:02,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:02,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-01-29 23:38:02,066 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-29 23:38:02,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-29 23:38:02,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2018-01-29 23:38:02,066 INFO L87 Difference]: Start difference. First operand 764 states and 791 transitions. Second operand 8 states.
[2018-01-29 23:38:02,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:02,630 INFO L93 Difference]: Finished difference Result 785 states and 812 transitions.
[2018-01-29 23:38:02,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-29 23:38:02,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 266
[2018-01-29 23:38:02,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:02,632 INFO L225 Difference]: With dead ends: 785
[2018-01-29 23:38:02,632 INFO L226 Difference]: Without dead ends: 784
[2018-01-29 23:38:02,633 INFO L553 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-01-29 23:38:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states.
[2018-01-29 23:38:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 777.
[2018-01-29 23:38:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states.
[2018-01-29 23:38:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 808 transitions.
[2018-01-29 23:38:02,671 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 808 transitions. Word has length 266
[2018-01-29 23:38:02,671 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:02,671 INFO L432 AbstractCegarLoop]: Abstraction has 777 states and 808 transitions.
[2018-01-29 23:38:02,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-29 23:38:02,672 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 808 transitions.
[2018-01-29 23:38:02,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267
[2018-01-29 23:38:02,674 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:02,674 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:02,674 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-01-29 23:38:02,674 INFO L82 PathProgramCache]: Analyzing trace with hash -652515549, now seen corresponding path program 1 times
[2018-01-29 23:38:02,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:02,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:02,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:02,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:02,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:03,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:04,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:04,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:04,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2018-01-29 23:38:04,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-01-29 23:38:04,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-01-29 23:38:04,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156
[2018-01-29 23:38:04,045 INFO L87 Difference]: Start difference. First operand 777 states and 808 transitions. Second operand 13 states.
[2018-01-29 23:38:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:04,671 INFO L93 Difference]: Finished difference Result 784 states and 810 transitions.
[2018-01-29 23:38:04,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-01-29 23:38:04,672 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 266
[2018-01-29 23:38:04,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:04,675 INFO L225 Difference]: With dead ends: 784
[2018-01-29 23:38:04,675 INFO L226 Difference]: Without dead ends: 783
[2018-01-29 23:38:04,676 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462
[2018-01-29 23:38:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states.
[2018-01-29 23:38:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 757.
[2018-01-29 23:38:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states.
[2018-01-29 23:38:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 785 transitions.
[2018-01-29 23:38:04,747 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 785 transitions. Word has length 266
[2018-01-29 23:38:04,747 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:04,747 INFO L432 AbstractCegarLoop]: Abstraction has 757 states and 785 transitions.
[2018-01-29 23:38:04,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-01-29 23:38:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 785 transitions.
[2018-01-29 23:38:04,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267
[2018-01-29 23:38:04,749 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:04,749 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:04,749 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-01-29 23:38:04,749 INFO L82 PathProgramCache]: Analyzing trace with hash 448329793, now seen corresponding path program 1 times
[2018-01-29 23:38:04,749 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:04,749 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:04,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:04,750 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:04,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:04,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:04,977 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:04,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-01-29 23:38:04,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-01-29 23:38:04,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-01-29 23:38:04,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2018-01-29 23:38:04,978 INFO L87 Difference]: Start difference. First operand 757 states and 785 transitions. Second operand 7 states.
[2018-01-29 23:38:05,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:05,228 INFO L93 Difference]: Finished difference Result 776 states and 806 transitions.
[2018-01-29 23:38:05,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-01-29 23:38:05,228 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 266
[2018-01-29 23:38:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:05,230 INFO L225 Difference]: With dead ends: 776
[2018-01-29 23:38:05,230 INFO L226 Difference]: Without dead ends: 775
[2018-01-29 23:38:05,231 INFO L553 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-01-29 23:38:05,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states.
[2018-01-29 23:38:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 756.
[2018-01-29 23:38:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states.
[2018-01-29 23:38:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 784 transitions.
[2018-01-29 23:38:05,273 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 784 transitions. Word has length 266
[2018-01-29 23:38:05,273 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:05,273 INFO L432 AbstractCegarLoop]: Abstraction has 756 states and 784 transitions.
[2018-01-29 23:38:05,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-01-29 23:38:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 784 transitions.
[2018-01-29 23:38:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267
[2018-01-29 23:38:05,275 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:05,275 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:05,275 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-01-29 23:38:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash 448329794, now seen corresponding path program 1 times
[2018-01-29 23:38:05,275 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:05,275 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:05,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:05,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:05,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:05,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:05,549 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:05,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-29 23:38:05,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-29 23:38:05,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-29 23:38:05,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2018-01-29 23:38:05,550 INFO L87 Difference]: Start difference. First operand 756 states and 784 transitions. Second operand 9 states.
[2018-01-29 23:38:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:05,872 INFO L93 Difference]: Finished difference Result 786 states and 816 transitions.
[2018-01-29 23:38:05,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-01-29 23:38:05,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 266
[2018-01-29 23:38:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:05,875 INFO L225 Difference]: With dead ends: 786
[2018-01-29 23:38:05,875 INFO L226 Difference]: Without dead ends: 785
[2018-01-29 23:38:05,875 INFO L553 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-01-29 23:38:05,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states.
[2018-01-29 23:38:05,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 755.
[2018-01-29 23:38:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states.
[2018-01-29 23:38:05,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 783 transitions.
[2018-01-29 23:38:05,918 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 783 transitions. Word has length 266
[2018-01-29 23:38:05,918 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:05,918 INFO L432 AbstractCegarLoop]: Abstraction has 755 states and 783 transitions.
[2018-01-29 23:38:05,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-29 23:38:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 783 transitions.
[2018-01-29 23:38:05,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270
[2018-01-29 23:38:05,920 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:05,920 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:05,920 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-01-29 23:38:05,921 INFO L82 PathProgramCache]: Analyzing trace with hash 321458883, now seen corresponding path program 1 times
[2018-01-29 23:38:05,921 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:05,921 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:05,921 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:05,922 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:05,922 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:06,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:07,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:07,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:07,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2018-01-29 23:38:07,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-01-29 23:38:07,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-01-29 23:38:07,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132
[2018-01-29 23:38:07,065 INFO L87 Difference]: Start difference. First operand 755 states and 783 transitions. Second operand 12 states.
[2018-01-29 23:38:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:07,819 INFO L93 Difference]: Finished difference Result 761 states and 789 transitions.
[2018-01-29 23:38:07,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-01-29 23:38:07,820 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 269
[2018-01-29 23:38:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:07,821 INFO L225 Difference]: With dead ends: 761
[2018-01-29 23:38:07,822 INFO L226 Difference]: Without dead ends: 759
[2018-01-29 23:38:07,822 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272
[2018-01-29 23:38:07,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states.
[2018-01-29 23:38:07,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 753.
[2018-01-29 23:38:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states.
[2018-01-29 23:38:07,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 778 transitions.
[2018-01-29 23:38:07,886 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 778 transitions. Word has length 269
[2018-01-29 23:38:07,886 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:07,886 INFO L432 AbstractCegarLoop]: Abstraction has 753 states and 778 transitions.
[2018-01-29 23:38:07,886 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-01-29 23:38:07,886 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 778 transitions.
[2018-01-29 23:38:07,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270
[2018-01-29 23:38:07,888 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:07,888 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:07,888 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-01-29 23:38:07,889 INFO L82 PathProgramCache]: Analyzing trace with hash 321458884, now seen corresponding path program 1 times
[2018-01-29 23:38:07,889 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:07,889 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:07,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:07,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:07,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:08,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:09,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:09,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2018-01-29 23:38:09,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-01-29 23:38:09,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-01-29 23:38:09,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156
[2018-01-29 23:38:09,802 INFO L87 Difference]: Start difference. First operand 753 states and 778 transitions. Second operand 13 states.
[2018-01-29 23:38:10,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:10,731 INFO L93 Difference]: Finished difference Result 759 states and 784 transitions.
[2018-01-29 23:38:10,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-01-29 23:38:10,731 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 269
[2018-01-29 23:38:10,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:10,733 INFO L225 Difference]: With dead ends: 759
[2018-01-29 23:38:10,733 INFO L226 Difference]: Without dead ends: 757
[2018-01-29 23:38:10,734 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342
[2018-01-29 23:38:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states.
[2018-01-29 23:38:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 728.
[2018-01-29 23:38:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states.
[2018-01-29 23:38:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 748 transitions.
[2018-01-29 23:38:10,789 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 748 transitions. Word has length 269
[2018-01-29 23:38:10,789 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:10,789 INFO L432 AbstractCegarLoop]: Abstraction has 728 states and 748 transitions.
[2018-01-29 23:38:10,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-01-29 23:38:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 748 transitions.
[2018-01-29 23:38:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271
[2018-01-29 23:38:10,790 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:10,790 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:10,790 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-01-29 23:38:10,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1453825657, now seen corresponding path program 1 times
[2018-01-29 23:38:10,791 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:10,791 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:10,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:10,791 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:10,791 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:10,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:10,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:10,907 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:10,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 23:38:10,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 23:38:10,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 23:38:10,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:38:10,908 INFO L87 Difference]: Start difference. First operand 728 states and 748 transitions. Second operand 5 states.
[2018-01-29 23:38:11,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:11,097 INFO L93 Difference]: Finished difference Result 751 states and 773 transitions.
[2018-01-29 23:38:11,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-29 23:38:11,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 270
[2018-01-29 23:38:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:11,100 INFO L225 Difference]: With dead ends: 751
[2018-01-29 23:38:11,100 INFO L226 Difference]: Without dead ends: 750
[2018-01-29 23:38:11,100 INFO L553 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-01-29 23:38:11,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states.
[2018-01-29 23:38:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 727.
[2018-01-29 23:38:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states.
[2018-01-29 23:38:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 747 transitions.
[2018-01-29 23:38:11,147 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 747 transitions. Word has length 270
[2018-01-29 23:38:11,147 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:11,147 INFO L432 AbstractCegarLoop]: Abstraction has 727 states and 747 transitions.
[2018-01-29 23:38:11,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 23:38:11,147 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 747 transitions.
[2018-01-29 23:38:11,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271
[2018-01-29 23:38:11,148 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:11,148 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:11,149 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-01-29 23:38:11,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1453825656, now seen corresponding path program 1 times
[2018-01-29 23:38:11,149 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:11,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:11,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:11,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:11,150 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:11,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:11,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:11,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2018-01-29 23:38:11,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states
[2018-01-29 23:38:11,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2018-01-29 23:38:11,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2018-01-29 23:38:11,551 INFO L87 Difference]: Start difference. First operand 727 states and 747 transitions. Second operand 10 states.
[2018-01-29 23:38:11,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:11,897 INFO L93 Difference]: Finished difference Result 761 states and 783 transitions.
[2018-01-29 23:38:11,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2018-01-29 23:38:11,897 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 270
[2018-01-29 23:38:11,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:11,900 INFO L225 Difference]: With dead ends: 761
[2018-01-29 23:38:11,900 INFO L226 Difference]: Without dead ends: 760
[2018-01-29 23:38:11,901 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272
[2018-01-29 23:38:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states.
[2018-01-29 23:38:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 726.
[2018-01-29 23:38:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states.
[2018-01-29 23:38:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 746 transitions.
[2018-01-29 23:38:11,959 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 746 transitions. Word has length 270
[2018-01-29 23:38:11,960 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:11,960 INFO L432 AbstractCegarLoop]: Abstraction has 726 states and 746 transitions.
[2018-01-29 23:38:11,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2018-01-29 23:38:11,960 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 746 transitions.
[2018-01-29 23:38:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272
[2018-01-29 23:38:11,961 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:11,961 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:11,961 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-01-29 23:38:11,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2118922245, now seen corresponding path program 1 times
[2018-01-29 23:38:11,961 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:11,961 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:11,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:11,962 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:11,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:11,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:12,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:12,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2018-01-29 23:38:12,450 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states
[2018-01-29 23:38:12,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2018-01-29 23:38:12,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240
[2018-01-29 23:38:12,450 INFO L87 Difference]: Start difference. First operand 726 states and 746 transitions. Second operand 16 states.
[2018-01-29 23:38:13,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:13,248 INFO L93 Difference]: Finished difference Result 798 states and 826 transitions.
[2018-01-29 23:38:13,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-01-29 23:38:13,249 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 271
[2018-01-29 23:38:13,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:13,250 INFO L225 Difference]: With dead ends: 798
[2018-01-29 23:38:13,251 INFO L226 Difference]: Without dead ends: 797
[2018-01-29 23:38:13,251 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=912, Unknown=0, NotChecked=0, Total=1056
[2018-01-29 23:38:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states.
[2018-01-29 23:38:13,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 714.
[2018-01-29 23:38:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states.
[2018-01-29 23:38:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 738 transitions.
[2018-01-29 23:38:13,300 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 738 transitions. Word has length 271
[2018-01-29 23:38:13,300 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:13,300 INFO L432 AbstractCegarLoop]: Abstraction has 714 states and 738 transitions.
[2018-01-29 23:38:13,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2018-01-29 23:38:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 738 transitions.
[2018-01-29 23:38:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272
[2018-01-29 23:38:13,301 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:13,302 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:13,302 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-01-29 23:38:13,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2118922244, now seen corresponding path program 1 times
[2018-01-29 23:38:13,302 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:13,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:13,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:13,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:13,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:13,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:14,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:14,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2018-01-29 23:38:14,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-01-29 23:38:14,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-01-29 23:38:14,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306
[2018-01-29 23:38:14,060 INFO L87 Difference]: Start difference. First operand 714 states and 738 transitions. Second operand 18 states.
[2018-01-29 23:38:15,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:15,052 INFO L93 Difference]: Finished difference Result 776 states and 802 transitions.
[2018-01-29 23:38:15,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-01-29 23:38:15,052 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 271
[2018-01-29 23:38:15,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:15,055 INFO L225 Difference]: With dead ends: 776
[2018-01-29 23:38:15,056 INFO L226 Difference]: Without dead ends: 775
[2018-01-29 23:38:15,056 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122
[2018-01-29 23:38:15,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states.
[2018-01-29 23:38:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 714.
[2018-01-29 23:38:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states.
[2018-01-29 23:38:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 737 transitions.
[2018-01-29 23:38:15,121 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 737 transitions. Word has length 271
[2018-01-29 23:38:15,121 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:15,121 INFO L432 AbstractCegarLoop]: Abstraction has 714 states and 737 transitions.
[2018-01-29 23:38:15,121 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-01-29 23:38:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 737 transitions.
[2018-01-29 23:38:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272
[2018-01-29 23:38:15,122 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:15,122 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:15,122 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-01-29 23:38:15,123 INFO L82 PathProgramCache]: Analyzing trace with hash -315649547, now seen corresponding path program 1 times
[2018-01-29 23:38:15,123 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:15,123 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:15,123 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:15,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:15,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:15,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:16,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:16,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2018-01-29 23:38:16,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-01-29 23:38:16,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-01-29 23:38:16,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132
[2018-01-29 23:38:16,377 INFO L87 Difference]: Start difference. First operand 714 states and 737 transitions. Second operand 12 states.
[2018-01-29 23:38:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:16,955 INFO L93 Difference]: Finished difference Result 723 states and 746 transitions.
[2018-01-29 23:38:16,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-01-29 23:38:16,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 271
[2018-01-29 23:38:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:16,957 INFO L225 Difference]: With dead ends: 723
[2018-01-29 23:38:16,957 INFO L226 Difference]: Without dead ends: 722
[2018-01-29 23:38:16,957 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272
[2018-01-29 23:38:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states.
[2018-01-29 23:38:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 713.
[2018-01-29 23:38:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states.
[2018-01-29 23:38:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 735 transitions.
[2018-01-29 23:38:17,005 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 735 transitions. Word has length 271
[2018-01-29 23:38:17,005 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:17,005 INFO L432 AbstractCegarLoop]: Abstraction has 713 states and 735 transitions.
[2018-01-29 23:38:17,005 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-01-29 23:38:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 735 transitions.
[2018-01-29 23:38:17,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272
[2018-01-29 23:38:17,006 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:17,007 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:17,007 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-01-29 23:38:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash -315649546, now seen corresponding path program 1 times
[2018-01-29 23:38:17,007 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:17,007 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:17,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:17,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:17,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:17,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:17,854 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:17,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2018-01-29 23:38:17,855 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states
[2018-01-29 23:38:17,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2018-01-29 23:38:17,855 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182
[2018-01-29 23:38:17,855 INFO L87 Difference]: Start difference. First operand 713 states and 735 transitions. Second operand 14 states.
[2018-01-29 23:38:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:18,786 INFO L93 Difference]: Finished difference Result 726 states and 749 transitions.
[2018-01-29 23:38:18,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-01-29 23:38:18,787 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 271
[2018-01-29 23:38:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:18,789 INFO L225 Difference]: With dead ends: 726
[2018-01-29 23:38:18,789 INFO L226 Difference]: Without dead ends: 725
[2018-01-29 23:38:18,789 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506
[2018-01-29 23:38:18,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states.
[2018-01-29 23:38:18,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 698.
[2018-01-29 23:38:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states.
[2018-01-29 23:38:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 719 transitions.
[2018-01-29 23:38:18,838 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 719 transitions. Word has length 271
[2018-01-29 23:38:18,839 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:18,839 INFO L432 AbstractCegarLoop]: Abstraction has 698 states and 719 transitions.
[2018-01-29 23:38:18,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2018-01-29 23:38:18,839 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 719 transitions.
[2018-01-29 23:38:18,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287
[2018-01-29 23:38:18,840 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:18,840 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:18,840 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-01-29 23:38:18,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1552001514, now seen corresponding path program 1 times
[2018-01-29 23:38:18,840 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:18,840 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:18,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:18,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:18,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:18,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:18,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:18,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-01-29 23:38:18,951 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 23:38:18,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 23:38:18,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:38:18,951 INFO L87 Difference]: Start difference. First operand 698 states and 719 transitions. Second operand 5 states.
[2018-01-29 23:38:19,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:19,015 INFO L93 Difference]: Finished difference Result 1446 states and 1495 transitions.
[2018-01-29 23:38:19,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-29 23:38:19,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 286
[2018-01-29 23:38:19,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:19,017 INFO L225 Difference]: With dead ends: 1446
[2018-01-29 23:38:19,017 INFO L226 Difference]: Without dead ends: 768
[2018-01-29 23:38:19,018 INFO L553 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-01-29 23:38:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states.
[2018-01-29 23:38:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 707.
[2018-01-29 23:38:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states.
[2018-01-29 23:38:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 728 transitions.
[2018-01-29 23:38:19,066 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 728 transitions. Word has length 286
[2018-01-29 23:38:19,066 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:19,066 INFO L432 AbstractCegarLoop]: Abstraction has 707 states and 728 transitions.
[2018-01-29 23:38:19,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 23:38:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 728 transitions.
[2018-01-29 23:38:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289
[2018-01-29 23:38:19,067 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:19,068 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:19,068 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-01-29 23:38:19,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1480145241, now seen corresponding path program 1 times
[2018-01-29 23:38:19,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:19,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:19,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:19,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:19,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:19,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:19,575 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:19,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2018-01-29 23:38:19,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states
[2018-01-29 23:38:19,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2018-01-29 23:38:19,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272
[2018-01-29 23:38:19,576 INFO L87 Difference]: Start difference. First operand 707 states and 728 transitions. Second operand 17 states.
[2018-01-29 23:38:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:20,381 INFO L93 Difference]: Finished difference Result 1452 states and 1498 transitions.
[2018-01-29 23:38:20,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-01-29 23:38:20,381 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 288
[2018-01-29 23:38:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:20,383 INFO L225 Difference]: With dead ends: 1452
[2018-01-29 23:38:20,383 INFO L226 Difference]: Without dead ends: 765
[2018-01-29 23:38:20,384 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122
[2018-01-29 23:38:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states.
[2018-01-29 23:38:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 707.
[2018-01-29 23:38:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states.
[2018-01-29 23:38:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 727 transitions.
[2018-01-29 23:38:20,436 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 727 transitions. Word has length 288
[2018-01-29 23:38:20,436 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:20,436 INFO L432 AbstractCegarLoop]: Abstraction has 707 states and 727 transitions.
[2018-01-29 23:38:20,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states.
[2018-01-29 23:38:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 727 transitions.
[2018-01-29 23:38:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291
[2018-01-29 23:38:20,437 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:20,437 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:20,437 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-01-29 23:38:20,437 INFO L82 PathProgramCache]: Analyzing trace with hash 86200420, now seen corresponding path program 1 times
[2018-01-29 23:38:20,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:20,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:20,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:20,438 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:20,438 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:20,549 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:20,902 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:38:20,902 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:38:20,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:20,990 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:38:21,046 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:21,047 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-01-29 23:38:21,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:21,056 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:21,057 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:21,057 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-01-29 23:38:21,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:21,062 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-01-29 23:38:21,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20
[2018-01-29 23:38:21,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:21,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-29 23:38:21,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17
[2018-01-29 23:38:21,148 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-01-29 23:38:21,148 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-01-29 23:38:21,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306
[2018-01-29 23:38:21,149 INFO L87 Difference]: Start difference. First operand 707 states and 727 transitions. Second operand 18 states.
[2018-01-29 23:38:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:21,537 INFO L93 Difference]: Finished difference Result 726 states and 748 transitions.
[2018-01-29 23:38:21,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-01-29 23:38:21,537 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 290
[2018-01-29 23:38:21,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:21,539 INFO L225 Difference]: With dead ends: 726
[2018-01-29 23:38:21,539 INFO L226 Difference]: Without dead ends: 724
[2018-01-29 23:38:21,540 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506
[2018-01-29 23:38:21,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states.
[2018-01-29 23:38:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 704.
[2018-01-29 23:38:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states.
[2018-01-29 23:38:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 723 transitions.
[2018-01-29 23:38:21,593 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 723 transitions. Word has length 290
[2018-01-29 23:38:21,594 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:21,594 INFO L432 AbstractCegarLoop]: Abstraction has 704 states and 723 transitions.
[2018-01-29 23:38:21,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-01-29 23:38:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 723 transitions.
[2018-01-29 23:38:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291
[2018-01-29 23:38:21,595 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:21,596 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:21,596 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-01-29 23:38:21,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1702545986, now seen corresponding path program 1 times
[2018-01-29 23:38:21,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:21,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:21,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:21,597 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:21,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:21,619 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:21,675 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:21,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-01-29 23:38:21,675 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-01-29 23:38:21,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-01-29 23:38:21,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-29 23:38:21,676 INFO L87 Difference]: Start difference. First operand 704 states and 723 transitions. Second operand 3 states.
[2018-01-29 23:38:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:21,730 INFO L93 Difference]: Finished difference Result 752 states and 772 transitions.
[2018-01-29 23:38:21,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-01-29 23:38:21,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290
[2018-01-29 23:38:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:21,732 INFO L225 Difference]: With dead ends: 752
[2018-01-29 23:38:21,732 INFO L226 Difference]: Without dead ends: 705
[2018-01-29 23:38:21,732 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-01-29 23:38:21,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states.
[2018-01-29 23:38:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705.
[2018-01-29 23:38:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states.
[2018-01-29 23:38:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 724 transitions.
[2018-01-29 23:38:21,792 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 724 transitions. Word has length 290
[2018-01-29 23:38:21,792 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:21,792 INFO L432 AbstractCegarLoop]: Abstraction has 705 states and 724 transitions.
[2018-01-29 23:38:21,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-01-29 23:38:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 724 transitions.
[2018-01-29 23:38:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293
[2018-01-29 23:38:21,793 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:21,794 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:21,794 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-01-29 23:38:21,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1140497403, now seen corresponding path program 1 times
[2018-01-29 23:38:21,794 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:21,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:21,794 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:21,795 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:21,795 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:21,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:21,922 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:21,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 23:38:21,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 23:38:21,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 23:38:21,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:38:21,922 INFO L87 Difference]: Start difference. First operand 705 states and 724 transitions. Second operand 5 states.
[2018-01-29 23:38:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:22,183 INFO L93 Difference]: Finished difference Result 724 states and 745 transitions.
[2018-01-29 23:38:22,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-29 23:38:22,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 292
[2018-01-29 23:38:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:22,186 INFO L225 Difference]: With dead ends: 724
[2018-01-29 23:38:22,187 INFO L226 Difference]: Without dead ends: 723
[2018-01-29 23:38:22,193 INFO L553 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-01-29 23:38:22,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states.
[2018-01-29 23:38:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 711.
[2018-01-29 23:38:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states.
[2018-01-29 23:38:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 732 transitions.
[2018-01-29 23:38:22,278 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 732 transitions. Word has length 292
[2018-01-29 23:38:22,279 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:22,279 INFO L432 AbstractCegarLoop]: Abstraction has 711 states and 732 transitions.
[2018-01-29 23:38:22,279 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 23:38:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 732 transitions.
[2018-01-29 23:38:22,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293
[2018-01-29 23:38:22,282 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:22,283 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:22,283 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-01-29 23:38:22,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1140497404, now seen corresponding path program 1 times
[2018-01-29 23:38:22,283 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:22,283 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:22,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:22,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:22,284 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:22,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:23,599 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:23,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2018-01-29 23:38:23,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states
[2018-01-29 23:38:23,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2018-01-29 23:38:23,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306
[2018-01-29 23:38:23,600 INFO L87 Difference]: Start difference. First operand 711 states and 732 transitions. Second operand 18 states.
[2018-01-29 23:38:24,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:24,698 INFO L93 Difference]: Finished difference Result 817 states and 849 transitions.
[2018-01-29 23:38:24,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-01-29 23:38:24,698 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 292
[2018-01-29 23:38:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:24,700 INFO L225 Difference]: With dead ends: 817
[2018-01-29 23:38:24,700 INFO L226 Difference]: Without dead ends: 816
[2018-01-29 23:38:24,700 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930
[2018-01-29 23:38:24,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states.
[2018-01-29 23:38:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 773.
[2018-01-29 23:38:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states.
[2018-01-29 23:38:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 801 transitions.
[2018-01-29 23:38:24,750 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 801 transitions. Word has length 292
[2018-01-29 23:38:24,750 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:24,750 INFO L432 AbstractCegarLoop]: Abstraction has 773 states and 801 transitions.
[2018-01-29 23:38:24,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2018-01-29 23:38:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 801 transitions.
[2018-01-29 23:38:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295
[2018-01-29 23:38:24,752 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:24,752 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:24,752 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-01-29 23:38:24,753 INFO L82 PathProgramCache]: Analyzing trace with hash 713645018, now seen corresponding path program 1 times
[2018-01-29 23:38:24,753 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:24,753 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:24,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:24,754 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:24,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:24,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:24,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:24,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:24,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-29 23:38:24,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-01-29 23:38:24,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-01-29 23:38:24,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2018-01-29 23:38:24,914 INFO L87 Difference]: Start difference. First operand 773 states and 801 transitions. Second operand 8 states.
[2018-01-29 23:38:25,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:25,108 INFO L93 Difference]: Finished difference Result 798 states and 825 transitions.
[2018-01-29 23:38:25,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2018-01-29 23:38:25,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 294
[2018-01-29 23:38:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:25,110 INFO L225 Difference]: With dead ends: 798
[2018-01-29 23:38:25,110 INFO L226 Difference]: Without dead ends: 792
[2018-01-29 23:38:25,110 INFO L553 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-01-29 23:38:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states.
[2018-01-29 23:38:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 773.
[2018-01-29 23:38:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states.
[2018-01-29 23:38:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 799 transitions.
[2018-01-29 23:38:25,159 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 799 transitions. Word has length 294
[2018-01-29 23:38:25,159 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:25,159 INFO L432 AbstractCegarLoop]: Abstraction has 773 states and 799 transitions.
[2018-01-29 23:38:25,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-01-29 23:38:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 799 transitions.
[2018-01-29 23:38:25,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298
[2018-01-29 23:38:25,161 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:25,161 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:25,161 INFO L371 AbstractCegarLoop]: === Iteration 56 === [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-01-29 23:38:25,161 INFO L82 PathProgramCache]: Analyzing trace with hash 557043058, now seen corresponding path program 1 times
[2018-01-29 23:38:25,161 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:25,161 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:25,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:25,162 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:25,162 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:25,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:25,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:38:25,493 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:38:25,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:25,578 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:38:25,679 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-01-29 23:38:25,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:25,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:25,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18
[2018-01-29 23:38:25,738 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-01-29 23:38:25,741 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-01-29 23:38:25,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:25,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:25,762 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-01-29 23:38:25,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28
[2018-01-29 23:38:25,802 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-01-29 23:38:25,805 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-01-29 23:38:25,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:25,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:25,814 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-01-29 23:38:25,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11
[2018-01-29 23:38:25,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:25,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-01-29 23:38:25,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20
[2018-01-29 23:38:25,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-01-29 23:38:25,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-01-29 23:38:25,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420
[2018-01-29 23:38:25,927 INFO L87 Difference]: Start difference. First operand 773 states and 799 transitions. Second operand 21 states.
[2018-01-29 23:38:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:26,651 INFO L93 Difference]: Finished difference Result 784 states and 812 transitions.
[2018-01-29 23:38:26,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-01-29 23:38:26,694 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 297
[2018-01-29 23:38:26,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:26,695 INFO L225 Difference]: With dead ends: 784
[2018-01-29 23:38:26,695 INFO L226 Difference]: Without dead ends: 783
[2018-01-29 23:38:26,696 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870
[2018-01-29 23:38:26,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states.
[2018-01-29 23:38:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 772.
[2018-01-29 23:38:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states.
[2018-01-29 23:38:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 798 transitions.
[2018-01-29 23:38:26,744 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 798 transitions. Word has length 297
[2018-01-29 23:38:26,745 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:26,745 INFO L432 AbstractCegarLoop]: Abstraction has 772 states and 798 transitions.
[2018-01-29 23:38:26,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-01-29 23:38:26,745 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 798 transitions.
[2018-01-29 23:38:26,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298
[2018-01-29 23:38:26,746 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:26,746 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:26,746 INFO L371 AbstractCegarLoop]: === Iteration 57 === [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-01-29 23:38:26,746 INFO L82 PathProgramCache]: Analyzing trace with hash 557043059, now seen corresponding path program 1 times
[2018-01-29 23:38:26,747 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:26,747 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:26,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:26,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:26,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:26,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:27,309 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:38:27,309 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:38:27,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:27,435 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:38:27,450 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-01-29 23:38:27,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:27,456 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:27,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5
[2018-01-29 23:38:27,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:27,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:27,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17
[2018-01-29 23:38:27,534 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc4.base| Int) (|create_data_#t~malloc3.base| Int)) (and (= (store (store |c_old(#length)| |create_data_#t~malloc3.base| 16) |create_data_#t~malloc4.base| 80) |c_#length|) (= (select (store |c_old(#valid)| |create_data_#t~malloc3.base| 1) |create_data_#t~malloc4.base|) 0) (= 0 (select |c_old(#valid)| |create_data_#t~malloc3.base|)))) is different from true
[2018-01-29 23:38:27,694 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:27,694 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:27,695 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:27,696 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-01-29 23:38:27,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:27,706 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:27,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27
[2018-01-29 23:38:27,713 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:27,713 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:27,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46
[2018-01-29 23:38:27,714 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:27,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:27,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:38:27,736 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:22
[2018-01-29 23:38:27,767 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-01-29 23:38:27,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:38:27,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:27,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:27,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:38:27,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:20
[2018-01-29 23:38:28,414 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:28,415 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:28,416 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:28,419 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:28,419 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:28,420 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:28,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 60
[2018-01-29 23:38:28,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts.
[2018-01-29 23:38:28,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts.
[2018-01-29 23:38:28,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:133
[2018-01-29 23:38:28,743 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 76 treesize of output 84
[2018-01-29 23:38:28,746 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 77 treesize of output 76
[2018-01-29 23:38:28,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:28,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:28,897 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 72 treesize of output 80
[2018-01-29 23:38:28,899 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 73 treesize of output 72
[2018-01-29 23:38:28,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:28,947 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,018 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 76 treesize of output 84
[2018-01-29 23:38:29,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76
[2018-01-29 23:38:29,021 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,071 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,131 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 73 treesize of output 81
[2018-01-29 23:38:29,134 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 74 treesize of output 73
[2018-01-29 23:38:29,135 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,170 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,223 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 72 treesize of output 80
[2018-01-29 23:38:29,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66
[2018-01-29 23:38:29,227 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,260 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 69 treesize of output 68
[2018-01-29 23:38:29,260 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,279 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,328 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 69 treesize of output 79
[2018-01-29 23:38:29,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69
[2018-01-29 23:38:29,331 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,379 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts.
[2018-01-29 23:38:29,413 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 13 variables, input treesize:226, output treesize:202
[2018-01-29 23:38:29,510 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 86 treesize of output 84
[2018-01-29 23:38:29,513 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 76 treesize of output 56
[2018-01-29 23:38:29,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,592 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 86 treesize of output 84
[2018-01-29 23:38:29,594 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 80 treesize of output 75
[2018-01-29 23:38:29,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,627 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 75 treesize of output 60
[2018-01-29 23:38:29,627 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,658 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 76 treesize of output 56
[2018-01-29 23:38:29,658 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,715 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 56 treesize of output 54
[2018-01-29 23:38:29,717 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 50 treesize of output 39
[2018-01-29 23:38:29,717 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,740 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 46 treesize of output 26
[2018-01-29 23:38:29,740 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,756 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,792 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 56 treesize of output 54
[2018-01-29 23:38:29,794 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 50 treesize of output 45
[2018-01-29 23:38:29,794 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,817 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 45 treesize of output 30
[2018-01-29 23:38:29,817 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,842 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 46 treesize of output 26
[2018-01-29 23:38:29,842 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,856 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,898 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 83 treesize of output 81
[2018-01-29 23:38:29,901 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 77 treesize of output 66
[2018-01-29 23:38:29,901 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,938 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 73 treesize of output 53
[2018-01-29 23:38:29,939 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:29,968 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:30,002 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 53 treesize of output 53
[2018-01-29 23:38:30,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42
[2018-01-29 23:38:30,005 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:30,031 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 42 treesize of output 31
[2018-01-29 23:38:30,031 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:30,057 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 45 treesize of output 27
[2018-01-29 23:38:30,057 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:30,071 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:30,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 6 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts.
[2018-01-29 23:38:30,096 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 19 variables, input treesize:256, output treesize:80
[2018-01-29 23:38:30,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1950 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:30,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:38:30,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22] total 32
[2018-01-29 23:38:30,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states
[2018-01-29 23:38:30,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2018-01-29 23:38:30,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=907, Unknown=6, NotChecked=60, Total=1056
[2018-01-29 23:38:30,560 INFO L87 Difference]: Start difference. First operand 772 states and 798 transitions. Second operand 33 states.
[2018-01-29 23:38:31,787 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 67 DAG size of output 53
[2018-01-29 23:38:31,960 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 81 DAG size of output 65
[2018-01-29 23:38:32,214 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 122 DAG size of output 99
[2018-01-29 23:38:32,572 WARN L146 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 148 DAG size of output 117
[2018-01-29 23:38:32,851 WARN L146 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 125 DAG size of output 102
[2018-01-29 23:38:33,394 WARN L146 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 148 DAG size of output 107
[2018-01-29 23:38:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:34,319 INFO L93 Difference]: Finished difference Result 981 states and 1047 transitions.
[2018-01-29 23:38:34,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states.
[2018-01-29 23:38:34,319 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 297
[2018-01-29 23:38:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:34,321 INFO L225 Difference]: With dead ends: 981
[2018-01-29 23:38:34,321 INFO L226 Difference]: Without dead ends: 980
[2018-01-29 23:38:34,321 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 272 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=468, Invalid=3304, Unknown=14, NotChecked=120, Total=3906
[2018-01-29 23:38:34,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states.
[2018-01-29 23:38:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 840.
[2018-01-29 23:38:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states.
[2018-01-29 23:38:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 878 transitions.
[2018-01-29 23:38:34,375 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 878 transitions. Word has length 297
[2018-01-29 23:38:34,375 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:34,375 INFO L432 AbstractCegarLoop]: Abstraction has 840 states and 878 transitions.
[2018-01-29 23:38:34,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states.
[2018-01-29 23:38:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 878 transitions.
[2018-01-29 23:38:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298
[2018-01-29 23:38:34,376 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:34,376 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:34,376 INFO L371 AbstractCegarLoop]: === Iteration 58 === [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-01-29 23:38:34,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1613074308, now seen corresponding path program 1 times
[2018-01-29 23:38:34,377 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:34,377 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:34,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:34,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:34,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:34,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:34,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:34,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:34,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2018-01-29 23:38:34,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-01-29 23:38:34,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-01-29 23:38:34,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132
[2018-01-29 23:38:34,754 INFO L87 Difference]: Start difference. First operand 840 states and 878 transitions. Second operand 12 states.
[2018-01-29 23:38:35,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:35,230 INFO L93 Difference]: Finished difference Result 893 states and 944 transitions.
[2018-01-29 23:38:35,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2018-01-29 23:38:35,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 297
[2018-01-29 23:38:35,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:35,232 INFO L225 Difference]: With dead ends: 893
[2018-01-29 23:38:35,232 INFO L226 Difference]: Without dead ends: 892
[2018-01-29 23:38:35,232 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506
[2018-01-29 23:38:35,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states.
[2018-01-29 23:38:35,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 845.
[2018-01-29 23:38:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states.
[2018-01-29 23:38:35,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 884 transitions.
[2018-01-29 23:38:35,285 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 884 transitions. Word has length 297
[2018-01-29 23:38:35,285 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:35,285 INFO L432 AbstractCegarLoop]: Abstraction has 845 states and 884 transitions.
[2018-01-29 23:38:35,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-01-29 23:38:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 884 transitions.
[2018-01-29 23:38:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298
[2018-01-29 23:38:35,286 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:35,287 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:35,287 INFO L371 AbstractCegarLoop]: === Iteration 59 === [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-01-29 23:38:35,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1613074307, now seen corresponding path program 1 times
[2018-01-29 23:38:35,287 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:35,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:35,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:35,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:35,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:35,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:35,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:35,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-01-29 23:38:35,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-01-29 23:38:35,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-01-29 23:38:35,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-01-29 23:38:35,394 INFO L87 Difference]: Start difference. First operand 845 states and 884 transitions. Second operand 5 states.
[2018-01-29 23:38:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:35,589 INFO L93 Difference]: Finished difference Result 848 states and 886 transitions.
[2018-01-29 23:38:35,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-01-29 23:38:35,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 297
[2018-01-29 23:38:35,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:35,590 INFO L225 Difference]: With dead ends: 848
[2018-01-29 23:38:35,591 INFO L226 Difference]: Without dead ends: 847
[2018-01-29 23:38:35,591 INFO L553 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-01-29 23:38:35,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states.
[2018-01-29 23:38:35,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 845.
[2018-01-29 23:38:35,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states.
[2018-01-29 23:38:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 883 transitions.
[2018-01-29 23:38:35,641 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 883 transitions. Word has length 297
[2018-01-29 23:38:35,641 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:35,641 INFO L432 AbstractCegarLoop]: Abstraction has 845 states and 883 transitions.
[2018-01-29 23:38:35,641 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-01-29 23:38:35,641 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 883 transitions.
[2018-01-29 23:38:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301
[2018-01-29 23:38:35,643 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:35,643 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:35,643 INFO L371 AbstractCegarLoop]: === Iteration 60 === [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-01-29 23:38:35,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1292088299, now seen corresponding path program 1 times
[2018-01-29 23:38:35,643 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:35,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:35,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:35,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:35,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:35,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:35,805 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:35,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-01-29 23:38:35,805 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-01-29 23:38:35,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-01-29 23:38:35,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2018-01-29 23:38:35,806 INFO L87 Difference]: Start difference. First operand 845 states and 883 transitions. Second operand 9 states.
[2018-01-29 23:38:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:36,111 INFO L93 Difference]: Finished difference Result 892 states and 944 transitions.
[2018-01-29 23:38:36,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2018-01-29 23:38:36,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 300
[2018-01-29 23:38:36,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:36,113 INFO L225 Difference]: With dead ends: 892
[2018-01-29 23:38:36,113 INFO L226 Difference]: Without dead ends: 891
[2018-01-29 23:38:36,113 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210
[2018-01-29 23:38:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states.
[2018-01-29 23:38:36,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 878.
[2018-01-29 23:38:36,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states.
[2018-01-29 23:38:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 922 transitions.
[2018-01-29 23:38:36,167 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 922 transitions. Word has length 300
[2018-01-29 23:38:36,167 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:36,167 INFO L432 AbstractCegarLoop]: Abstraction has 878 states and 922 transitions.
[2018-01-29 23:38:36,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-01-29 23:38:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 922 transitions.
[2018-01-29 23:38:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301
[2018-01-29 23:38:36,169 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:36,169 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:36,169 INFO L371 AbstractCegarLoop]: === Iteration 61 === [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-01-29 23:38:36,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1292088298, now seen corresponding path program 1 times
[2018-01-29 23:38:36,169 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:36,170 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:36,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:36,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:36,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:36,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:36,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-01-29 23:38:36,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23
[2018-01-29 23:38:36,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-01-29 23:38:36,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-01-29 23:38:36,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552
[2018-01-29 23:38:36,994 INFO L87 Difference]: Start difference. First operand 878 states and 922 transitions. Second operand 24 states.
[2018-01-29 23:38:38,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:38,134 INFO L93 Difference]: Finished difference Result 961 states and 1014 transitions.
[2018-01-29 23:38:38,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states.
[2018-01-29 23:38:38,134 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 300
[2018-01-29 23:38:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:38,136 INFO L225 Difference]: With dead ends: 961
[2018-01-29 23:38:38,136 INFO L226 Difference]: Without dead ends: 959
[2018-01-29 23:38:38,136 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=2203, Unknown=0, NotChecked=0, Total=2450
[2018-01-29 23:38:38,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states.
[2018-01-29 23:38:38,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 933.
[2018-01-29 23:38:38,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states.
[2018-01-29 23:38:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 985 transitions.
[2018-01-29 23:38:38,190 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 985 transitions. Word has length 300
[2018-01-29 23:38:38,191 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:38,191 INFO L432 AbstractCegarLoop]: Abstraction has 933 states and 985 transitions.
[2018-01-29 23:38:38,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-01-29 23:38:38,191 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 985 transitions.
[2018-01-29 23:38:38,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303
[2018-01-29 23:38:38,192 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:38,192 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:38,192 INFO L371 AbstractCegarLoop]: === Iteration 62 === [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-01-29 23:38:38,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1278083151, now seen corresponding path program 1 times
[2018-01-29 23:38:38,193 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:38,193 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:38,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:38,193 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:38,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:38,244 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:38,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:38,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:38:38,984 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:38:38,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:39,093 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:38:39,096 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-01-29 23:38:39,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-29 23:38:39,280 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-01-29 23:38:39,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:38:39,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21
[2018-01-29 23:38:39,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33
[2018-01-29 23:38:39,328 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 22 treesize of output 21
[2018-01-29 23:38:39,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27
[2018-01-29 23:38:39,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:38:39,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:38:39,374 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-01-29 23:38:39,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:38:39,376 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,377 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:38:39,388 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:37, output treesize:57
[2018-01-29 23:38:39,428 WARN L307 Elim1Store]: Array PQE input equivalent to false
[2018-01-29 23:38:39,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,434 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:39,435 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:39,435 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-01-29 23:38:39,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:29
[2018-01-29 23:38:39,597 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:39,598 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:39,599 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:39,600 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74
[2018-01-29 23:38:39,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:67
[2018-01-29 23:38:39,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 79
[2018-01-29 23:38:39,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 77 treesize of output 76
[2018-01-29 23:38:39,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 59
[2018-01-29 23:38:39,792 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 52 treesize of output 51
[2018-01-29 23:38:39,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,823 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-01-29 23:38:39,823 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:98, output treesize:90
[2018-01-29 23:38:39,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 54
[2018-01-29 23:38:39,879 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 50 treesize of output 39
[2018-01-29 23:38:39,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,890 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 39 treesize of output 30
[2018-01-29 23:38:39,890 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,901 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 46 treesize of output 26
[2018-01-29 23:38:39,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:38:39,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:78
[2018-01-29 23:38:39,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 76
[2018-01-29 23:38:39,976 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 63 treesize of output 54
[2018-01-29 23:38:39,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:39,996 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 53 treesize of output 48
[2018-01-29 23:38:39,996 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:40,012 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 48 treesize of output 39
[2018-01-29 23:38:40,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:40,027 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26
[2018-01-29 23:38:40,028 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:38:40,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27
[2018-01-29 23:38:40,042 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:38:40,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:38:40,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:38:40,068 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:82, output treesize:49
[2018-01-29 23:38:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:40,334 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-01-29 23:38:40,334 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 45
[2018-01-29 23:38:40,334 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states
[2018-01-29 23:38:40,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2018-01-29 23:38:40,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1944, Unknown=0, NotChecked=0, Total=2070
[2018-01-29 23:38:40,335 INFO L87 Difference]: Start difference. First operand 933 states and 985 transitions. Second operand 46 states.
[2018-01-29 23:38:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-01-29 23:38:44,462 INFO L93 Difference]: Finished difference Result 1726 states and 1828 transitions.
[2018-01-29 23:38:44,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states.
[2018-01-29 23:38:44,462 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 302
[2018-01-29 23:38:44,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-01-29 23:38:44,465 INFO L225 Difference]: With dead ends: 1726
[2018-01-29 23:38:44,465 INFO L226 Difference]: Without dead ends: 1724
[2018-01-29 23:38:44,466 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3592 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=932, Invalid=11278, Unknown=0, NotChecked=0, Total=12210
[2018-01-29 23:38:44,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states.
[2018-01-29 23:38:44,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1268.
[2018-01-29 23:38:44,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states.
[2018-01-29 23:38:44,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1344 transitions.
[2018-01-29 23:38:44,553 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1344 transitions. Word has length 302
[2018-01-29 23:38:44,554 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-01-29 23:38:44,554 INFO L432 AbstractCegarLoop]: Abstraction has 1268 states and 1344 transitions.
[2018-01-29 23:38:44,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states.
[2018-01-29 23:38:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1344 transitions.
[2018-01-29 23:38:44,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303
[2018-01-29 23:38:44,555 INFO L342 BasicCegarLoop]: Found error trace
[2018-01-29 23:38:44,555 INFO L350 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-01-29 23:38:44,555 INFO L371 AbstractCegarLoop]: === Iteration 63 === [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-01-29 23:38:44,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1278083152, now seen corresponding path program 1 times
[2018-01-29 23:38:44,555 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-01-29 23:38:44,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-01-29 23:38:44,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:44,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:44,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-01-29 23:38:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:44,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-01-29 23:38:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked.
[2018-01-29 23:38:46,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-01-29 23:38:46,119 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP
No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-01-29 23:38:46,123 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-01-29 23:38:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-01-29 23:38:46,214 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-01-29 23:38:46,216 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-01-29 23:38:46,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:46,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:46,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-01-29 23:38:46,426 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-01-29 23:38:46,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:38:46,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:46,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:46,438 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-01-29 23:38:46,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7
[2018-01-29 23:38:46,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:46,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:46,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:46,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37
[2018-01-29 23:38:46,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40
[2018-01-29 23:38:46,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30
[2018-01-29 23:38:46,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:46,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32
[2018-01-29 23:38:46,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:38:46,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-01-29 23:38:46,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31
[2018-01-29 23:38:46,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22
[2018-01-29 23:38:46,578 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts.
[2018-01-29 23:38:46,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15
[2018-01-29 23:38:46,595 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:46,604 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-01-29 23:38:46,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts.
[2018-01-29 23:38:46,626 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:53, output treesize:201
[2018-01-29 23:38:46,709 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:46,710 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:46,710 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 67 treesize of output 61
[2018-01-29 23:38:46,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:46,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:46,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:110, output treesize:61
[2018-01-29 23:38:46,951 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:46,952 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:46,953 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:46,954 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 32 treesize of output 25
[2018-01-29 23:38:46,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:46,964 INFO L700 Elim1Store]: detected not equals via solver
[2018-01-29 23:38:46,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 57
[2018-01-29 23:38:46,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:46,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:46,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:57
[2018-01-29 23:38:47,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 73
[2018-01-29 23:38:47,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 67 treesize of output 66
[2018-01-29 23:38:47,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:47,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:47,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 76
[2018-01-29 23:38:47,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 69 treesize of output 68
[2018-01-29 23:38:47,185 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:47,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:47,219 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-01-29 23:38:47,219 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:88, output treesize:82
[2018-01-29 23:38:47,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 105
[2018-01-29 23:38:47,350 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 96 treesize of output 75
[2018-01-29 23:38:47,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:47,373 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 75 treesize of output 71
[2018-01-29 23:38:47,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-01-29 23:38:47,392 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 58 treesize of output 42
[2018-01-29 23:38:47,393 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2018-01-29 23:38:47,410 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 76 treesize of output 72
[2018-01-29 23:38:47,411 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts.
Received shutdown request...
[2018-01-29 23:38:47,419 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants
[2018-01-29 23:38:47,419 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-01-29 23:38:47,426 WARN L185 ceAbstractionStarter]: Timeout
[2018-01-29 23:38:47,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:38:47 BoogieIcfgContainer
[2018-01-29 23:38:47,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-01-29 23:38:47,427 INFO L168 Benchmark]: Toolchain (without parser) took 92551.83 ms. Allocated memory was 305.1 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 264.0 MB in the beginning and 544.9 MB in the end (delta: -280.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 5.3 GB.
[2018-01-29 23:38:47,429 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-01-29 23:38:47,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 236.06 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 252.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB.
[2018-01-29 23:38:47,429 INFO L168 Benchmark]: Boogie Preprocessor took 45.33 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
[2018-01-29 23:38:47,429 INFO L168 Benchmark]: RCFGBuilder took 838.48 ms. Allocated memory is still 305.1 MB. Free memory was 250.1 MB in the beginning and 194.7 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 5.3 GB.
[2018-01-29 23:38:47,430 INFO L168 Benchmark]: TraceAbstraction took 91423.63 ms. Allocated memory was 305.1 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 194.7 MB in the beginning and 544.9 MB in the end (delta: -350.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB.
[2018-01-29 23:38:47,431 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.16 ms. Allocated memory is still 305.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 236.06 ms. Allocated memory is still 305.1 MB. Free memory was 264.0 MB in the beginning and 252.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 45.33 ms. Allocated memory is still 305.1 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 838.48 ms. Allocated memory is still 305.1 MB. Free memory was 250.1 MB in the beginning and 194.7 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 91423.63 ms. Allocated memory was 305.1 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 194.7 MB in the beginning and 544.9 MB in the end (delta: -350.3 MB). Peak memory consumption was 1.3 GB. 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 analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 561). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 585]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 585). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 592). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 596). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 586). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 594). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that free always succeeds (line 595). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 590). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 593). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 578). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 581). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 583). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 577). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 579). Cancelled while BasicCegarLoop was analyzing trace of length 303 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 46.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 6 procedures, 264 locations, 91 error locations. TIMEOUT Result, 91.3s OverallTime, 63 OverallIterations, 21 TraceHistogramMax, 46.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12504 SDtfs, 12111 SDslu, 103627 SDs, 0 SdLazy, 33879 SolverSat, 1336 SolverUnsat, 394 SolverUnknown, 0 SolverNotchecked, 20.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5936 GetRequests, 4181 SyntacticMatches, 54 SemanticMatches, 1701 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 20309 ImplicationChecksByTransitivity, 34.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1268occurred in iteration=62, 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: 2.2s AutomataMinimizationTime, 62 MinimizatonAttempts, 1810 StatesRemovedByMinimization, 55 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 3.6s SatisfiabilityAnalysisTime, 30.2s InterpolantComputationTime, 15694 NumberOfCodeBlocks, 14734 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 15608 ConstructedInterpolants, 1299 QuantifiedInterpolants, 62600360 SizeOfPredicates, 332 NumberOfNonLiveVariables, 10124 ConjunctsInSsa, 588 ConjunctsInUnsatCore, 86 InterpolantComputations, 48 PerfectInterpolantSequences, 69235/86528 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test01_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-38-47-442.csv
Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/complex_data_creation_test01_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-38-47-442.csv
Completed graceful shutdown