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-acfac67 [2018-01-28 22:00:45,098 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 22:00:45,099 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 22:00:45,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 22:00:45,114 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 22:00:45,115 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 22:00:45,116 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 22:00:45,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 22:00:45,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 22:00:45,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 22:00:45,122 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 22:00:45,122 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 22:00:45,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 22:00:45,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 22:00:45,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 22:00:45,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 22:00:45,130 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 22:00:45,132 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 22:00:45,133 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 22:00:45,134 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 22:00:45,137 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 22:00:45,137 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 22:00:45,137 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 22:00:45,138 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 22:00:45,139 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 22:00:45,140 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 22:00:45,141 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 22:00:45,141 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 22:00:45,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 22:00:45,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 22:00:45,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 22:00:45,143 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-28 22:00:45,151 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 22:00:45,151 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 22:00:45,152 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 22:00:45,152 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 22:00:45,153 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 22:00:45,153 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 22:00:45,153 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 22:00:45,153 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 22:00:45,153 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 22:00:45,154 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 22:00:45,154 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 22:00:45,154 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 22:00:45,154 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 22:00:45,154 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 22:00:45,154 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 22:00:45,154 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 22:00:45,154 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 22:00:45,155 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 22:00:45,155 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 22:00:45,155 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 22:00:45,155 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 22:00:45,155 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 22:00:45,155 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 22:00:45,156 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 22:00:45,156 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 22:00:45,156 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 22:00:45,156 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 22:00:45,156 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 22:00:45,156 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 22:00:45,157 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 22:00:45,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 22:00:45,157 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 22:00:45,157 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 22:00:45,158 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 22:00:45,190 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 22:00:45,200 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 22:00:45,204 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 22:00:45,205 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 22:00:45,206 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 22:00:45,206 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-28 22:00:45,387 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 22:00:45,392 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 22:00:45,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 22:00:45,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 22:00:45,399 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 22:00:45,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:00:45" (1/1) ... [2018-01-28 22:00:45,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd1337a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:00:45, skipping insertion in model container [2018-01-28 22:00:45,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:00:45" (1/1) ... [2018-01-28 22:00:45,417 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:00:45,456 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 22:00:45,583 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:00:45,611 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 22:00:45,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:00:45 WrapperNode [2018-01-28 22:00:45,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 22:00:45,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 22:00:45,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 22:00:45,625 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 22:00:45,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:00:45" (1/1) ... [2018-01-28 22:00:45,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:00:45" (1/1) ... [2018-01-28 22:00:45,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:00:45" (1/1) ... [2018-01-28 22:00:45,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:00:45" (1/1) ... [2018-01-28 22:00:45,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:00:45" (1/1) ... [2018-01-28 22:00:45,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:00:45" (1/1) ... [2018-01-28 22:00:45,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:00:45" (1/1) ... [2018-01-28 22:00:45,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 22:00:45,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 22:00:45,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 22:00:45,671 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 22:00:45,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:00:45" (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-28 22:00:45,724 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 22:00:45,724 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 22:00:45,725 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-28 22:00:45,725 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-28 22:00:45,725 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-28 22:00:45,725 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 22:00:45,725 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 22:00:45,725 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 22:00:45,725 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 22:00:45,725 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 22:00:45,725 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 22:00:45,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 22:00:45,726 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 22:00:45,726 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 22:00:45,726 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 22:00:45,726 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 22:00:45,726 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-28 22:00:45,726 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-28 22:00:45,726 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-28 22:00:45,726 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 22:00:45,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 22:00:45,727 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 22:00:46,443 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 22:00:46,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:00:46 BoogieIcfgContainer [2018-01-28 22:00:46,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 22:00:46,444 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 22:00:46,444 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 22:00:46,447 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 22:00:46,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:00:45" (1/3) ... [2018-01-28 22:00:46,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4149bb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:00:46, skipping insertion in model container [2018-01-28 22:00:46,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:00:45" (2/3) ... [2018-01-28 22:00:46,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4149bb60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:00:46, skipping insertion in model container [2018-01-28 22:00:46,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:00:46" (3/3) ... [2018-01-28 22:00:46,450 INFO L107 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01_true-valid-memsafety.i [2018-01-28 22:00:46,456 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 22:00:46,462 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 91 error locations. [2018-01-28 22:00:46,511 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 22:00:46,512 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 22:00:46,512 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 22:00:46,512 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 22:00:46,512 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 22:00:46,512 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 22:00:46,512 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 22:00:46,512 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 22:00:46,513 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 22:00:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states. [2018-01-28 22:00:46,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-28 22:00:46,544 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:46,546 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:00:46,546 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-28 22:00:46,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1324532528, now seen corresponding path program 1 times [2018-01-28 22:00:46,554 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:46,555 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:46,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:46,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:46,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:46,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:46,813 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-28 22:00:46,815 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:00:46,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:00:46,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:00:46,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:00:46,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:00:46,828 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 3 states. [2018-01-28 22:00:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:47,110 INFO L93 Difference]: Finished difference Result 513 states and 552 transitions. [2018-01-28 22:00:47,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:00:47,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-01-28 22:00:47,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:47,126 INFO L225 Difference]: With dead ends: 513 [2018-01-28 22:00:47,126 INFO L226 Difference]: Without dead ends: 256 [2018-01-28 22:00:47,132 INFO L533 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-28 22:00:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-01-28 22:00:47,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-01-28 22:00:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-01-28 22:00:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 268 transitions. [2018-01-28 22:00:47,188 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 268 transitions. Word has length 8 [2018-01-28 22:00:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:47,189 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 268 transitions. [2018-01-28 22:00:47,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:00:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 268 transitions. [2018-01-28 22:00:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-28 22:00:47,189 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:47,190 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:00:47,190 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-28 22:00:47,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1324532527, now seen corresponding path program 1 times [2018-01-28 22:00:47,190 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:47,190 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:47,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:47,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:47,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:47,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:47,255 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-28 22:00:47,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:00:47,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-28 22:00:47,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:00:47,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:00:47,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:00:47,258 INFO L87 Difference]: Start difference. First operand 256 states and 268 transitions. Second operand 3 states. [2018-01-28 22:00:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:47,529 INFO L93 Difference]: Finished difference Result 258 states and 271 transitions. [2018-01-28 22:00:47,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:00:47,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-01-28 22:00:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:47,533 INFO L225 Difference]: With dead ends: 258 [2018-01-28 22:00:47,534 INFO L226 Difference]: Without dead ends: 257 [2018-01-28 22:00:47,535 INFO L533 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-28 22:00:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-01-28 22:00:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-01-28 22:00:47,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-01-28 22:00:47,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 267 transitions. [2018-01-28 22:00:47,554 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 267 transitions. Word has length 8 [2018-01-28 22:00:47,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:47,555 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 267 transitions. [2018-01-28 22:00:47,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:00:47,555 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 267 transitions. [2018-01-28 22:00:47,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 22:00:47,555 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:47,555 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:00:47,556 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-28 22:00:47,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1729278109, now seen corresponding path program 1 times [2018-01-28 22:00:47,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:47,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:47,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:47,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:47,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:47,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:47,658 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-28 22:00:47,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:00:47,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:00:47,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:00:47,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:00:47,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:00:47,659 INFO L87 Difference]: Start difference. First operand 255 states and 267 transitions. Second operand 5 states. [2018-01-28 22:00:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:47,895 INFO L93 Difference]: Finished difference Result 255 states and 267 transitions. [2018-01-28 22:00:47,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:00:47,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-28 22:00:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:47,897 INFO L225 Difference]: With dead ends: 255 [2018-01-28 22:00:47,897 INFO L226 Difference]: Without dead ends: 253 [2018-01-28 22:00:47,897 INFO L533 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-28 22:00:47,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-01-28 22:00:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-01-28 22:00:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-01-28 22:00:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 265 transitions. [2018-01-28 22:00:47,914 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 265 transitions. Word has length 15 [2018-01-28 22:00:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:47,916 INFO L432 AbstractCegarLoop]: Abstraction has 253 states and 265 transitions. [2018-01-28 22:00:47,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:00:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 265 transitions. [2018-01-28 22:00:47,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 22:00:47,917 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:47,917 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:00:47,917 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-28 22:00:47,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1729278108, now seen corresponding path program 1 times [2018-01-28 22:00:47,918 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:47,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:47,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:47,919 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:47,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:47,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 22:00:48,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:00:48,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:00:48,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:00:48,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:00:48,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:00:48,065 INFO L87 Difference]: Start difference. First operand 253 states and 265 transitions. Second operand 7 states. [2018-01-28 22:00:48,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:48,513 INFO L93 Difference]: Finished difference Result 277 states and 293 transitions. [2018-01-28 22:00:48,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:00:48,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-28 22:00:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:48,515 INFO L225 Difference]: With dead ends: 277 [2018-01-28 22:00:48,515 INFO L226 Difference]: Without dead ends: 275 [2018-01-28 22:00:48,516 INFO L533 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-28 22:00:48,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-01-28 22:00:48,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 262. [2018-01-28 22:00:48,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-01-28 22:00:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 277 transitions. [2018-01-28 22:00:48,527 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 277 transitions. Word has length 15 [2018-01-28 22:00:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:48,528 INFO L432 AbstractCegarLoop]: Abstraction has 262 states and 277 transitions. [2018-01-28 22:00:48,528 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:00:48,528 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 277 transitions. [2018-01-28 22:00:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 22:00:48,528 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:48,528 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:00:48,528 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-28 22:00:48,529 INFO L82 PathProgramCache]: Analyzing trace with hash -2068013554, now seen corresponding path program 1 times [2018-01-28 22:00:48,529 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:48,529 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:48,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:48,530 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:48,530 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:48,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:48,611 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-28 22:00:48,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:00:48,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:00:48,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:00:48,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:00:48,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:00:48,613 INFO L87 Difference]: Start difference. First operand 262 states and 277 transitions. Second operand 4 states. [2018-01-28 22:00:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:48,807 INFO L93 Difference]: Finished difference Result 262 states and 277 transitions. [2018-01-28 22:00:48,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:00:48,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-28 22:00:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:48,808 INFO L225 Difference]: With dead ends: 262 [2018-01-28 22:00:48,808 INFO L226 Difference]: Without dead ends: 260 [2018-01-28 22:00:48,809 INFO L533 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-28 22:00:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-01-28 22:00:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2018-01-28 22:00:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-01-28 22:00:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 274 transitions. [2018-01-28 22:00:48,817 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 274 transitions. Word has length 16 [2018-01-28 22:00:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:48,817 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 274 transitions. [2018-01-28 22:00:48,818 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:00:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 274 transitions. [2018-01-28 22:00:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-28 22:00:48,818 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:48,818 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 22:00:48,818 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-28 22:00:48,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2068013555, now seen corresponding path program 1 times [2018-01-28 22:00:48,818 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:48,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:48,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:48,819 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:48,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:48,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:48,847 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-28 22:00:48,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:00:48,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:00:48,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:00:48,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:00:48,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:00:48,848 INFO L87 Difference]: Start difference. First operand 260 states and 274 transitions. Second operand 4 states. [2018-01-28 22:00:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:49,002 INFO L93 Difference]: Finished difference Result 260 states and 274 transitions. [2018-01-28 22:00:49,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:00:49,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-28 22:00:49,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:49,004 INFO L225 Difference]: With dead ends: 260 [2018-01-28 22:00:49,004 INFO L226 Difference]: Without dead ends: 258 [2018-01-28 22:00:49,004 INFO L533 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-28 22:00:49,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-01-28 22:00:49,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-01-28 22:00:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-01-28 22:00:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 271 transitions. [2018-01-28 22:00:49,011 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 271 transitions. Word has length 16 [2018-01-28 22:00:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:49,012 INFO L432 AbstractCegarLoop]: Abstraction has 258 states and 271 transitions. [2018-01-28 22:00:49,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:00:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 271 transitions. [2018-01-28 22:00:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-28 22:00:49,013 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:49,013 INFO L330 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-28 22:00:49,013 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-28 22:00:49,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1258492302, now seen corresponding path program 1 times [2018-01-28 22:00:49,013 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:49,013 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:49,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:49,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:49,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:49,033 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:49,321 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-28 22:00:49,321 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:00:49,321 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-28 22:00:49,321 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:00:49,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:00:49,322 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:00:49,322 INFO L87 Difference]: Start difference. First operand 258 states and 271 transitions. Second operand 13 states. [2018-01-28 22:00:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:50,530 INFO L93 Difference]: Finished difference Result 501 states and 529 transitions. [2018-01-28 22:00:50,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 22:00:50,531 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-01-28 22:00:50,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:50,532 INFO L225 Difference]: With dead ends: 501 [2018-01-28 22:00:50,533 INFO L226 Difference]: Without dead ends: 261 [2018-01-28 22:00:50,534 INFO L533 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-28 22:00:50,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-01-28 22:00:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259. [2018-01-28 22:00:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-01-28 22:00:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 272 transitions. [2018-01-28 22:00:50,544 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 272 transitions. Word has length 22 [2018-01-28 22:00:50,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:50,544 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 272 transitions. [2018-01-28 22:00:50,545 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:00:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 272 transitions. [2018-01-28 22:00:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 22:00:50,546 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:50,546 INFO L330 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-28 22:00:50,546 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-28 22:00:50,546 INFO L82 PathProgramCache]: Analyzing trace with hash 300560400, now seen corresponding path program 1 times [2018-01-28 22:00:50,546 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:50,546 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:50,547 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:50,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:50,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:50,563 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:50,618 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-28 22:00:50,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:00:50,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:00:50,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:00:50,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:00:50,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:00:50,619 INFO L87 Difference]: Start difference. First operand 259 states and 272 transitions. Second operand 5 states. [2018-01-28 22:00:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:50,706 INFO L93 Difference]: Finished difference Result 611 states and 647 transitions. [2018-01-28 22:00:50,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:00:50,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-28 22:00:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:50,709 INFO L225 Difference]: With dead ends: 611 [2018-01-28 22:00:50,710 INFO L226 Difference]: Without dead ends: 371 [2018-01-28 22:00:50,711 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:00:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-01-28 22:00:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 335. [2018-01-28 22:00:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-01-28 22:00:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 388 transitions. [2018-01-28 22:00:50,727 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 388 transitions. Word has length 25 [2018-01-28 22:00:50,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:50,728 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 388 transitions. [2018-01-28 22:00:50,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:00:50,728 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 388 transitions. [2018-01-28 22:00:50,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 22:00:50,729 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:50,729 INFO L330 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-28 22:00:50,729 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-28 22:00:50,730 INFO L82 PathProgramCache]: Analyzing trace with hash -634252802, now seen corresponding path program 1 times [2018-01-28 22:00:50,730 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:50,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:50,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:50,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:50,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:50,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:50,810 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-28 22:00:50,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:00:50,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:00:50,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:00:50,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:00:50,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:00:50,811 INFO L87 Difference]: Start difference. First operand 335 states and 388 transitions. Second operand 4 states. [2018-01-28 22:00:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:50,971 INFO L93 Difference]: Finished difference Result 337 states and 390 transitions. [2018-01-28 22:00:50,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:00:50,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-01-28 22:00:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:50,974 INFO L225 Difference]: With dead ends: 337 [2018-01-28 22:00:50,974 INFO L226 Difference]: Without dead ends: 324 [2018-01-28 22:00:50,974 INFO L533 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-28 22:00:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-01-28 22:00:50,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2018-01-28 22:00:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-01-28 22:00:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 362 transitions. [2018-01-28 22:00:50,987 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 362 transitions. Word has length 31 [2018-01-28 22:00:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:50,988 INFO L432 AbstractCegarLoop]: Abstraction has 322 states and 362 transitions. [2018-01-28 22:00:50,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:00:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 362 transitions. [2018-01-28 22:00:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 22:00:50,989 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:50,989 INFO L330 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-28 22:00:50,989 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-28 22:00:50,989 INFO L82 PathProgramCache]: Analyzing trace with hash -634252801, now seen corresponding path program 1 times [2018-01-28 22:00:50,989 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:50,990 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:50,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:50,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:50,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:51,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:51,121 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-28 22:00:51,122 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:00:51,122 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:00:51,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:00:51,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:00:51,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:00:51,123 INFO L87 Difference]: Start difference. First operand 322 states and 362 transitions. Second operand 5 states. [2018-01-28 22:00:51,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:51,281 INFO L93 Difference]: Finished difference Result 324 states and 364 transitions. [2018-01-28 22:00:51,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:00:51,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-28 22:00:51,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:51,283 INFO L225 Difference]: With dead ends: 324 [2018-01-28 22:00:51,283 INFO L226 Difference]: Without dead ends: 311 [2018-01-28 22:00:51,284 INFO L533 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-28 22:00:51,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-01-28 22:00:51,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2018-01-28 22:00:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-01-28 22:00:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 336 transitions. [2018-01-28 22:00:51,298 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 336 transitions. Word has length 31 [2018-01-28 22:00:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:51,298 INFO L432 AbstractCegarLoop]: Abstraction has 309 states and 336 transitions. [2018-01-28 22:00:51,298 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:00:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 336 transitions. [2018-01-28 22:00:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 22:00:51,299 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:51,300 INFO L330 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-28 22:00:51,300 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-28 22:00:51,300 INFO L82 PathProgramCache]: Analyzing trace with hash -409142070, now seen corresponding path program 1 times [2018-01-28 22:00:51,300 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:51,300 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:51,301 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:51,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:51,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:51,320 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:51,410 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-28 22:00:51,410 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:00:51,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:00:51,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:00:51,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:00:51,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:00:51,411 INFO L87 Difference]: Start difference. First operand 309 states and 336 transitions. Second operand 6 states. [2018-01-28 22:00:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:51,763 INFO L93 Difference]: Finished difference Result 618 states and 680 transitions. [2018-01-28 22:00:51,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:00:51,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-28 22:00:51,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:51,810 INFO L225 Difference]: With dead ends: 618 [2018-01-28 22:00:51,810 INFO L226 Difference]: Without dead ends: 328 [2018-01-28 22:00:51,811 INFO L533 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-28 22:00:51,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-01-28 22:00:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 319. [2018-01-28 22:00:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-01-28 22:00:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 348 transitions. [2018-01-28 22:00:51,825 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 348 transitions. Word has length 38 [2018-01-28 22:00:51,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:51,826 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 348 transitions. [2018-01-28 22:00:51,826 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:00:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 348 transitions. [2018-01-28 22:00:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 22:00:51,827 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:51,827 INFO L330 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-28 22:00:51,827 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-28 22:00:51,827 INFO L82 PathProgramCache]: Analyzing trace with hash -409142071, now seen corresponding path program 1 times [2018-01-28 22:00:51,827 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:51,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:51,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:51,828 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:51,828 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:51,842 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:51,893 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-28 22:00:51,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:00:51,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:00:51,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:00:51,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:00:51,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:00:51,894 INFO L87 Difference]: Start difference. First operand 319 states and 348 transitions. Second operand 5 states. [2018-01-28 22:00:52,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:52,146 INFO L93 Difference]: Finished difference Result 322 states and 350 transitions. [2018-01-28 22:00:52,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:00:52,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-28 22:00:52,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:52,148 INFO L225 Difference]: With dead ends: 322 [2018-01-28 22:00:52,148 INFO L226 Difference]: Without dead ends: 321 [2018-01-28 22:00:52,148 INFO L533 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-28 22:00:52,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-01-28 22:00:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2018-01-28 22:00:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-01-28 22:00:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 346 transitions. [2018-01-28 22:00:52,158 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 346 transitions. Word has length 38 [2018-01-28 22:00:52,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:52,158 INFO L432 AbstractCegarLoop]: Abstraction has 319 states and 346 transitions. [2018-01-28 22:00:52,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:00:52,159 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 346 transitions. [2018-01-28 22:00:52,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-28 22:00:52,159 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:52,159 INFO L330 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-28 22:00:52,159 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-28 22:00:52,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1438277668, now seen corresponding path program 1 times [2018-01-28 22:00:52,160 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:52,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:52,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:52,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:52,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:52,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:52,435 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-28 22:00:52,435 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:00:52,435 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-28 22:00:52,456 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:52,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:00:52,553 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-28 22:00:52,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:52,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:52,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:00:52,612 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-28 22:00:52,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:52,664 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:00:52,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:00:52,667 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-28 22:00:52,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:52,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:52,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-28 22:00:52,739 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-28 22:00:52,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, 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-28 22:00:52,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:52,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:52,802 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-28 22:00:52,804 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-28 22:00:52,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:52,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:52,850 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-28 22:00:52,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-01-28 22:00:52,973 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-28 22:00:52,977 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-28 22:00:52,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:52,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:52,999 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-28 22:00:53,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 1 [2018-01-28 22:00:53,002 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:53,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:53,012 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-28 22:00:53,012 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:34 [2018-01-28 22:00:53,068 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-28 22:00:53,071 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-28 22:00:53,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:53,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:53,088 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-28 22:00:53,091 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-28 22:00:53,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:53,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:53,098 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-28 22:00:53,098 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:12 [2018-01-28 22:00:53,113 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-28 22:00:53,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:00:53,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2018-01-28 22:00:53,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 22:00:53,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 22:00:53,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:00:53,135 INFO L87 Difference]: Start difference. First operand 319 states and 346 transitions. Second operand 15 states. [2018-01-28 22:00:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:54,153 INFO L93 Difference]: Finished difference Result 650 states and 712 transitions. [2018-01-28 22:00:54,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:00:54,154 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-01-28 22:00:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:54,156 INFO L225 Difference]: With dead ends: 650 [2018-01-28 22:00:54,156 INFO L226 Difference]: Without dead ends: 350 [2018-01-28 22:00:54,158 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2018-01-28 22:00:54,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-01-28 22:00:54,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 339. [2018-01-28 22:00:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-01-28 22:00:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 368 transitions. [2018-01-28 22:00:54,180 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 368 transitions. Word has length 48 [2018-01-28 22:00:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:54,180 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 368 transitions. [2018-01-28 22:00:54,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 22:00:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 368 transitions. [2018-01-28 22:00:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-28 22:00:54,181 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:54,181 INFO L330 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-28 22:00:54,181 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-28 22:00:54,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1438277669, now seen corresponding path program 1 times [2018-01-28 22:00:54,182 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:54,182 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:54,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:54,183 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:54,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:54,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:54,343 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-28 22:00:54,344 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:00:54,344 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-28 22:00:54,353 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:54,405 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:00:54,410 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-28 22:00:54,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:54,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:54,413 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:00:54,422 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:00:54,423 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:00:54,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-28 22:00:54,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:54,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:54,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-01-28 22:00:54,460 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-28 22:00:54,467 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-28 22:00:54,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:54,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:54,508 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-28 22:00:54,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-01-28 22:00:54,557 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-28 22:00:54,560 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-28 22:00:54,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:54,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:54,570 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-28 22:00:54,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:27 [2018-01-28 22:00:54,576 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-28 22:00:54,580 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-28 22:00:54,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:54,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:54,590 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-28 22:00:54,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:15 [2018-01-28 22:00:54,628 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-28 22:00:54,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:00:54,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-01-28 22:00:54,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:00:54,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:00:54,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:00:54,663 INFO L87 Difference]: Start difference. First operand 339 states and 368 transitions. Second operand 13 states. [2018-01-28 22:00:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:55,140 INFO L93 Difference]: Finished difference Result 347 states and 376 transitions. [2018-01-28 22:00:55,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:00:55,140 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-01-28 22:00:55,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:55,142 INFO L225 Difference]: With dead ends: 347 [2018-01-28 22:00:55,142 INFO L226 Difference]: Without dead ends: 346 [2018-01-28 22:00:55,143 INFO L533 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-28 22:00:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-01-28 22:00:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 338. [2018-01-28 22:00:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-01-28 22:00:55,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 364 transitions. [2018-01-28 22:00:55,154 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 364 transitions. Word has length 48 [2018-01-28 22:00:55,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:55,155 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 364 transitions. [2018-01-28 22:00:55,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:00:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 364 transitions. [2018-01-28 22:00:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-28 22:00:55,156 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:55,156 INFO L330 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-28 22:00:55,156 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-28 22:00:55,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1356010606, now seen corresponding path program 2 times [2018-01-28 22:00:55,157 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:55,157 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:55,157 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:55,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:55,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:55,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:55,652 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-28 22:00:55,652 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:00:55,652 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-28 22:00:55,661 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:00:55,681 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:00:55,692 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:00:55,694 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:00:55,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:00:55,702 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-28 22:00:55,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:00:55,712 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-28 22:00:55,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:00:55,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:00:55,719 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-28 22:00:55,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-28 22:00:55,730 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-28 22:00:55,732 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-28 22:00:55,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,740 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-28 22:00:55,742 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-28 22:00:55,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,750 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-28 22:00:55,750 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:31 [2018-01-28 22:00:55,778 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-28 22:00:55,781 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-28 22:00:55,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,795 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-28 22:00:55,797 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-28 22:00:55,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,806 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-28 22:00:55,806 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:116, output treesize:34 [2018-01-28 22:00:55,855 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-28 22:00:55,858 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-28 22:00:55,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,886 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-28 22:00:55,889 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-28 22:00:55,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,893 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,899 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-28 22:00:55,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:119, output treesize:37 [2018-01-28 22:00:55,961 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-28 22:00:55,964 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-28 22:00:55,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,981 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-28 22:00:55,983 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-28 22:00:55,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,985 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:55,991 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-28 22:00:55,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:55, output treesize:15 [2018-01-28 22:00:56,017 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-28 22:00:56,037 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:00:56,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 18 [2018-01-28 22:00:56,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-28 22:00:56,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-28 22:00:56,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2018-01-28 22:00:56,038 INFO L87 Difference]: Start difference. First operand 338 states and 364 transitions. Second operand 19 states. [2018-01-28 22:00:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:56,806 INFO L93 Difference]: Finished difference Result 687 states and 746 transitions. [2018-01-28 22:00:56,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 22:00:56,841 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 58 [2018-01-28 22:00:56,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:56,843 INFO L225 Difference]: With dead ends: 687 [2018-01-28 22:00:56,843 INFO L226 Difference]: Without dead ends: 368 [2018-01-28 22:00:56,844 INFO L533 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-28 22:00:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-01-28 22:00:56,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 358. [2018-01-28 22:00:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-01-28 22:00:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 384 transitions. [2018-01-28 22:00:56,859 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 384 transitions. Word has length 58 [2018-01-28 22:00:56,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:56,859 INFO L432 AbstractCegarLoop]: Abstraction has 358 states and 384 transitions. [2018-01-28 22:00:56,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-28 22:00:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 384 transitions. [2018-01-28 22:00:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-28 22:00:56,860 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:56,861 INFO L330 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-28 22:00:56,861 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-28 22:00:56,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1988983424, now seen corresponding path program 3 times [2018-01-28 22:00:56,861 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:56,861 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:56,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:56,862 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:00:56,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:56,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:57,314 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-28 22:00:57,314 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:00:57,314 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-28 22:00:57,319 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 22:00:57,344 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:00:57,352 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:00:57,361 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:00:57,371 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 22:00:57,374 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:00:57,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:00:57,382 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-28 22:00:57,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:00:57,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:00:57,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:00:57,391 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-28 22:00:57,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,397 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-28 22:00:57,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-28 22:00:57,425 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-28 22:00:57,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 10 treesize of output 9 [2018-01-28 22:00:57,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,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, 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-28 22:00:57,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, 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-28 22:00:57,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,443 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,450 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-28 22:00:57,450 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:31 [2018-01-28 22:00:57,501 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-28 22:00:57,503 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-28 22:00:57,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,515 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-28 22:00:57,517 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-28 22:00:57,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,524 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-28 22:00:57,524 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:31 [2018-01-28 22:00:57,532 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-28 22:00:57,534 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-28 22:00:57,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,547 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-28 22:00:57,549 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-28 22:00:57,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,555 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-28 22:00:57,555 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:113, output treesize:31 [2018-01-28 22:00:57,584 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-28 22:00:57,586 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-28 22:00:57,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,604 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-28 22:00:57,606 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-28 22:00:57,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,617 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-28 22:00:57,617 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:129, output treesize:44 [2018-01-28 22:00:57,733 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-28 22:00:57,736 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-28 22:00:57,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,751 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-28 22:00:57,754 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-28 22:00:57,754 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:00:57,764 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-28 22:00:57,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:70, output treesize:24 [2018-01-28 22:00:57,798 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-28 22:00:57,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:00:57,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 26 [2018-01-28 22:00:57,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-28 22:00:57,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-28 22:00:57,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2018-01-28 22:00:57,819 INFO L87 Difference]: Start difference. First operand 358 states and 384 transitions. Second operand 27 states. [2018-01-28 22:00:59,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:59,397 INFO L93 Difference]: Finished difference Result 732 states and 792 transitions. [2018-01-28 22:00:59,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 22:00:59,398 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 68 [2018-01-28 22:00:59,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:59,399 INFO L225 Difference]: With dead ends: 732 [2018-01-28 22:00:59,399 INFO L226 Difference]: Without dead ends: 393 [2018-01-28 22:00:59,400 INFO L533 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-28 22:00:59,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-01-28 22:00:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 371. [2018-01-28 22:00:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-01-28 22:00:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 396 transitions. [2018-01-28 22:00:59,412 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 396 transitions. Word has length 68 [2018-01-28 22:00:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:59,412 INFO L432 AbstractCegarLoop]: Abstraction has 371 states and 396 transitions. [2018-01-28 22:00:59,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-28 22:00:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 396 transitions. [2018-01-28 22:00:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-28 22:00:59,413 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:59,413 INFO L330 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-28 22:00:59,413 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-28 22:00:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash 262705210, now seen corresponding path program 1 times [2018-01-28 22:00:59,414 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:59,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:59,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:59,414 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:00:59,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:59,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:59,462 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-28 22:00:59,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:00:59,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:00:59,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:00:59,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:00:59,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:00:59,463 INFO L87 Difference]: Start difference. First operand 371 states and 396 transitions. Second operand 4 states. [2018-01-28 22:00:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:59,607 INFO L93 Difference]: Finished difference Result 377 states and 402 transitions. [2018-01-28 22:00:59,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 22:00:59,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-01-28 22:00:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:59,609 INFO L225 Difference]: With dead ends: 377 [2018-01-28 22:00:59,609 INFO L226 Difference]: Without dead ends: 373 [2018-01-28 22:00:59,609 INFO L533 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-28 22:00:59,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-01-28 22:00:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 367. [2018-01-28 22:00:59,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-01-28 22:00:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 388 transitions. [2018-01-28 22:00:59,622 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 388 transitions. Word has length 97 [2018-01-28 22:00:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:59,623 INFO L432 AbstractCegarLoop]: Abstraction has 367 states and 388 transitions. [2018-01-28 22:00:59,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:00:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 388 transitions. [2018-01-28 22:00:59,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-01-28 22:00:59,624 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:59,624 INFO L330 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-28 22:00:59,624 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-28 22:00:59,625 INFO L82 PathProgramCache]: Analyzing trace with hash 262705211, now seen corresponding path program 1 times [2018-01-28 22:00:59,625 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:59,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:59,625 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:59,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:59,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:59,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:00:59,737 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-28 22:00:59,737 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:00:59,737 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-28 22:00:59,742 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:00:59,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:00:59,836 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-28 22:00:59,870 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:00:59,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-01-28 22:00:59,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:00:59,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:00:59,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:00:59,871 INFO L87 Difference]: Start difference. First operand 367 states and 388 transitions. Second operand 13 states. [2018-01-28 22:00:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:00:59,967 INFO L93 Difference]: Finished difference Result 749 states and 796 transitions. [2018-01-28 22:00:59,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 22:00:59,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2018-01-28 22:00:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:00:59,969 INFO L225 Difference]: With dead ends: 749 [2018-01-28 22:00:59,969 INFO L226 Difference]: Without dead ends: 401 [2018-01-28 22:00:59,971 INFO L533 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-28 22:00:59,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-01-28 22:00:59,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 387. [2018-01-28 22:00:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-01-28 22:00:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 408 transitions. [2018-01-28 22:00:59,986 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 408 transitions. Word has length 97 [2018-01-28 22:00:59,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:00:59,986 INFO L432 AbstractCegarLoop]: Abstraction has 387 states and 408 transitions. [2018-01-28 22:00:59,986 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:00:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 408 transitions. [2018-01-28 22:00:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-01-28 22:00:59,987 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:00:59,988 INFO L330 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-28 22:00:59,988 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-28 22:00:59,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1522686441, now seen corresponding path program 2 times [2018-01-28 22:00:59,988 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:00:59,988 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:00:59,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:00:59,989 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:00:59,989 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:00,010 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:00,181 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-28 22:01:00,181 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:00,181 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-28 22:01:00,186 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:01:00,208 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:01:00,212 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:01:00,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:00,225 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-28 22:01:00,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:00,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:00,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 22:01:00,251 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-28 22:01:00,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:01:00,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 15 [2018-01-28 22:01:00,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 22:01:00,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 22:01:00,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-01-28 22:01:00,279 INFO L87 Difference]: Start difference. First operand 387 states and 408 transitions. Second operand 15 states. [2018-01-28 22:01:00,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:00,619 INFO L93 Difference]: Finished difference Result 791 states and 842 transitions. [2018-01-28 22:01:00,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 22:01:00,620 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 107 [2018-01-28 22:01:00,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:00,621 INFO L225 Difference]: With dead ends: 791 [2018-01-28 22:01:00,621 INFO L226 Difference]: Without dead ends: 423 [2018-01-28 22:01:00,622 INFO L533 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-28 22:01:00,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-01-28 22:01:00,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 403. [2018-01-28 22:01:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-01-28 22:01:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 420 transitions. [2018-01-28 22:01:00,631 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 420 transitions. Word has length 107 [2018-01-28 22:01:00,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:00,631 INFO L432 AbstractCegarLoop]: Abstraction has 403 states and 420 transitions. [2018-01-28 22:01:00,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 22:01:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 420 transitions. [2018-01-28 22:01:00,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-01-28 22:01:00,632 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:00,632 INFO L330 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-28 22:01:00,632 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-28 22:01:00,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1087696910, now seen corresponding path program 1 times [2018-01-28 22:01:00,632 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:00,632 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:00,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:00,633 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:01:00,633 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:00,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:00,879 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-28 22:01:00,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:00,879 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-28 22:01:00,887 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:00,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:01,006 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-28 22:01:01,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:01:01,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2018-01-28 22:01:01,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 22:01:01,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 22:01:01,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:01:01,029 INFO L87 Difference]: Start difference. First operand 403 states and 420 transitions. Second operand 17 states. [2018-01-28 22:01:01,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:01,181 INFO L93 Difference]: Finished difference Result 821 states and 860 transitions. [2018-01-28 22:01:01,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 22:01:01,181 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 120 [2018-01-28 22:01:01,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:01,183 INFO L225 Difference]: With dead ends: 821 [2018-01-28 22:01:01,183 INFO L226 Difference]: Without dead ends: 437 [2018-01-28 22:01:01,183 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:01:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-01-28 22:01:01,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 423. [2018-01-28 22:01:01,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-01-28 22:01:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 440 transitions. [2018-01-28 22:01:01,192 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 440 transitions. Word has length 120 [2018-01-28 22:01:01,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:01,192 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 440 transitions. [2018-01-28 22:01:01,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 22:01:01,193 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 440 transitions. [2018-01-28 22:01:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-01-28 22:01:01,193 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:01,194 INFO L330 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-28 22:01:01,194 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-28 22:01:01,194 INFO L82 PathProgramCache]: Analyzing trace with hash 198714016, now seen corresponding path program 2 times [2018-01-28 22:01:01,194 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:01,194 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:01,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:01,195 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:01,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:01,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:01,401 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-28 22:01:01,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:01,401 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-28 22:01:01,407 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:01:01,433 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:01:01,436 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:01:01,441 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:01,444 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-28 22:01:01,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:01,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:01,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 22:01:01,513 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-28 22:01:01,517 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-28 22:01:01,644 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:01,651 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:01,652 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:01,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-28 22:01:01,655 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-28 22:01:01,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:01,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:01,695 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-28 22:01:01,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:28 [2018-01-28 22:01:01,795 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-28 22:01:01,828 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:01:01,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [17] total 24 [2018-01-28 22:01:01,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-28 22:01:01,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-28 22:01:01,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=373, Unknown=2, NotChecked=82, Total=552 [2018-01-28 22:01:01,864 INFO L87 Difference]: Start difference. First operand 423 states and 440 transitions. Second operand 24 states. [2018-01-28 22:01:02,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:02,981 INFO L93 Difference]: Finished difference Result 921 states and 971 transitions. [2018-01-28 22:01:02,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-01-28 22:01:02,981 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 130 [2018-01-28 22:01:02,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:02,984 INFO L225 Difference]: With dead ends: 921 [2018-01-28 22:01:02,984 INFO L226 Difference]: Without dead ends: 517 [2018-01-28 22:01:02,986 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=480, Invalid=1470, Unknown=38, NotChecked=174, Total=2162 [2018-01-28 22:01:02,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2018-01-28 22:01:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 473. [2018-01-28 22:01:03,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-01-28 22:01:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 498 transitions. [2018-01-28 22:01:03,006 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 498 transitions. Word has length 130 [2018-01-28 22:01:03,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:03,006 INFO L432 AbstractCegarLoop]: Abstraction has 473 states and 498 transitions. [2018-01-28 22:01:03,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-28 22:01:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 498 transitions. [2018-01-28 22:01:03,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-01-28 22:01:03,008 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:03,008 INFO L330 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-28 22:01:03,008 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-28 22:01:03,008 INFO L82 PathProgramCache]: Analyzing trace with hash -999110989, now seen corresponding path program 1 times [2018-01-28 22:01:03,008 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:03,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:03,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:03,009 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:01:03,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:03,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:03,268 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-28 22:01:03,268 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:03,268 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-28 22:01:03,278 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:03,328 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:03,390 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-28 22:01:03,425 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:01:03,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2018-01-28 22:01:03,425 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:01:03,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:01:03,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-01-28 22:01:03,426 INFO L87 Difference]: Start difference. First operand 473 states and 498 transitions. Second operand 21 states. [2018-01-28 22:01:03,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:03,695 INFO L93 Difference]: Finished difference Result 961 states and 1017 transitions. [2018-01-28 22:01:03,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-28 22:01:03,699 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 140 [2018-01-28 22:01:03,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:03,701 INFO L225 Difference]: With dead ends: 961 [2018-01-28 22:01:03,701 INFO L226 Difference]: Without dead ends: 507 [2018-01-28 22:01:03,703 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=427, Invalid=905, Unknown=0, NotChecked=0, Total=1332 [2018-01-28 22:01:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-01-28 22:01:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 493. [2018-01-28 22:01:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-01-28 22:01:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 518 transitions. [2018-01-28 22:01:03,724 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 518 transitions. Word has length 140 [2018-01-28 22:01:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:03,725 INFO L432 AbstractCegarLoop]: Abstraction has 493 states and 518 transitions. [2018-01-28 22:01:03,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:01:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 518 transitions. [2018-01-28 22:01:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-01-28 22:01:03,726 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:03,727 INFO L330 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-28 22:01:03,727 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-28 22:01:03,727 INFO L82 PathProgramCache]: Analyzing trace with hash -14353339, now seen corresponding path program 2 times [2018-01-28 22:01:03,727 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:03,727 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:03,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:03,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:03,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:03,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:04,161 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-28 22:01:04,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:04,162 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-28 22:01:04,167 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:01:04,198 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:01:04,201 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:01:04,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:04,311 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-28 22:01:04,464 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:04,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:04,466 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:04,467 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-28 22:01:04,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:04,481 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-28 22:01:04,486 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:04,487 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-28 22:01:04,488 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:04,504 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:04,512 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-28 22:01:04,512 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-01-28 22:01:04,628 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-28 22:01:04,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:01:04,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 29 [2018-01-28 22:01:04,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 22:01:04,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 22:01:04,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=619, Unknown=2, NotChecked=52, Total=812 [2018-01-28 22:01:04,656 INFO L87 Difference]: Start difference. First operand 493 states and 518 transitions. Second operand 29 states. [2018-01-28 22:01:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:06,863 INFO L93 Difference]: Finished difference Result 1040 states and 1099 transitions. [2018-01-28 22:01:06,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-28 22:01:06,864 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 150 [2018-01-28 22:01:06,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:06,866 INFO L225 Difference]: With dead ends: 1040 [2018-01-28 22:01:06,866 INFO L226 Difference]: Without dead ends: 566 [2018-01-28 22:01:06,867 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 751 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=751, Invalid=2590, Unknown=85, NotChecked=114, Total=3540 [2018-01-28 22:01:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-01-28 22:01:06,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 534. [2018-01-28 22:01:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2018-01-28 22:01:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 563 transitions. [2018-01-28 22:01:06,887 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 563 transitions. Word has length 150 [2018-01-28 22:01:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:06,888 INFO L432 AbstractCegarLoop]: Abstraction has 534 states and 563 transitions. [2018-01-28 22:01:06,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 22:01:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 563 transitions. [2018-01-28 22:01:06,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-01-28 22:01:06,889 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:06,889 INFO L330 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-28 22:01:06,889 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-28 22:01:06,889 INFO L82 PathProgramCache]: Analyzing trace with hash -51885767, now seen corresponding path program 1 times [2018-01-28 22:01:06,890 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:06,890 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:06,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:06,890 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:01:06,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:06,910 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:07,194 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-28 22:01:07,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:07,195 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-28 22:01:07,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:07,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:07,304 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-28 22:01:07,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:01:07,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2018-01-28 22:01:07,324 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-28 22:01:07,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-28 22:01:07,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-01-28 22:01:07,325 INFO L87 Difference]: Start difference. First operand 534 states and 563 transitions. Second operand 25 states. [2018-01-28 22:01:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:07,580 INFO L93 Difference]: Finished difference Result 1083 states and 1149 transitions. [2018-01-28 22:01:07,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-28 22:01:07,581 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 162 [2018-01-28 22:01:07,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:07,583 INFO L225 Difference]: With dead ends: 1083 [2018-01-28 22:01:07,583 INFO L226 Difference]: Without dead ends: 568 [2018-01-28 22:01:07,585 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=631, Invalid=1349, Unknown=0, NotChecked=0, Total=1980 [2018-01-28 22:01:07,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-01-28 22:01:07,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 554. [2018-01-28 22:01:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-01-28 22:01:07,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 583 transitions. [2018-01-28 22:01:07,606 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 583 transitions. Word has length 162 [2018-01-28 22:01:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:07,606 INFO L432 AbstractCegarLoop]: Abstraction has 554 states and 583 transitions. [2018-01-28 22:01:07,606 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-28 22:01:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 583 transitions. [2018-01-28 22:01:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-01-28 22:01:07,607 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:07,607 INFO L330 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-28 22:01:07,607 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-28 22:01:07,607 INFO L82 PathProgramCache]: Analyzing trace with hash -618781365, now seen corresponding path program 2 times [2018-01-28 22:01:07,607 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:07,608 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:07,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:07,608 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:07,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:07,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:07,626 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:08,004 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-28 22:01:08,005 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:08,005 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-28 22:01:08,010 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:01:08,038 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:01:08,051 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:01:08,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:08,073 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-28 22:01:08,090 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-28 22:01:08,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:08,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:08,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:08,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-28 22:01:08,226 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-28 22:01:08,240 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-28 22:01:08,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:08,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:08,243 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-28 22:01:08,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-01-28 22:01:08,335 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-28 22:01:08,356 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:01:08,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [25] total 29 [2018-01-28 22:01:08,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 22:01:08,357 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 22:01:08,357 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:01:08,357 INFO L87 Difference]: Start difference. First operand 554 states and 583 transitions. Second operand 29 states. [2018-01-28 22:01:09,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:09,125 INFO L93 Difference]: Finished difference Result 1205 states and 1279 transitions. [2018-01-28 22:01:09,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-01-28 22:01:09,126 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 172 [2018-01-28 22:01:09,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:09,128 INFO L225 Difference]: With dead ends: 1205 [2018-01-28 22:01:09,128 INFO L226 Difference]: Without dead ends: 670 [2018-01-28 22:01:09,130 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080 [2018-01-28 22:01:09,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-01-28 22:01:09,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 582. [2018-01-28 22:01:09,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-01-28 22:01:09,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 611 transitions. [2018-01-28 22:01:09,164 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 611 transitions. Word has length 172 [2018-01-28 22:01:09,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:09,165 INFO L432 AbstractCegarLoop]: Abstraction has 582 states and 611 transitions. [2018-01-28 22:01:09,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 22:01:09,165 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 611 transitions. [2018-01-28 22:01:09,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-01-28 22:01:09,167 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:09,167 INFO L330 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-28 22:01:09,167 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-28 22:01:09,167 INFO L82 PathProgramCache]: Analyzing trace with hash 700067965, now seen corresponding path program 1 times [2018-01-28 22:01:09,167 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:09,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:09,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:09,168 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:01:09,169 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:09,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:09,276 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-28 22:01:09,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:09,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:01:09,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 22:01:09,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 22:01:09,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 22:01:09,277 INFO L87 Difference]: Start difference. First operand 582 states and 611 transitions. Second operand 4 states. [2018-01-28 22:01:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:09,326 INFO L93 Difference]: Finished difference Result 1169 states and 1236 transitions. [2018-01-28 22:01:09,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 22:01:09,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-01-28 22:01:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:09,330 INFO L225 Difference]: With dead ends: 1169 [2018-01-28 22:01:09,330 INFO L226 Difference]: Without dead ends: 606 [2018-01-28 22:01:09,332 INFO L533 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-28 22:01:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-01-28 22:01:09,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 588. [2018-01-28 22:01:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-01-28 22:01:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 613 transitions. [2018-01-28 22:01:09,363 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 613 transitions. Word has length 182 [2018-01-28 22:01:09,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:09,364 INFO L432 AbstractCegarLoop]: Abstraction has 588 states and 613 transitions. [2018-01-28 22:01:09,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 22:01:09,364 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 613 transitions. [2018-01-28 22:01:09,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-01-28 22:01:09,365 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:09,365 INFO L330 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-28 22:01:09,366 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-28 22:01:09,366 INFO L82 PathProgramCache]: Analyzing trace with hash -260517012, now seen corresponding path program 1 times [2018-01-28 22:01:09,366 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:09,366 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:09,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:09,367 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:09,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:09,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:09,784 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-28 22:01:09,785 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:09,785 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-28 22:01:09,801 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:09,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:09,899 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-28 22:01:09,919 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:01:09,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-01-28 22:01:09,920 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 22:01:09,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 22:01:09,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-01-28 22:01:09,920 INFO L87 Difference]: Start difference. First operand 588 states and 613 transitions. Second operand 29 states. [2018-01-28 22:01:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:10,272 INFO L93 Difference]: Finished difference Result 1191 states and 1249 transitions. [2018-01-28 22:01:10,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-28 22:01:10,272 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 182 [2018-01-28 22:01:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:10,274 INFO L225 Difference]: With dead ends: 1191 [2018-01-28 22:01:10,274 INFO L226 Difference]: Without dead ends: 622 [2018-01-28 22:01:10,275 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=875, Invalid=1881, Unknown=0, NotChecked=0, Total=2756 [2018-01-28 22:01:10,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2018-01-28 22:01:10,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 608. [2018-01-28 22:01:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-01-28 22:01:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 633 transitions. [2018-01-28 22:01:10,296 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 633 transitions. Word has length 182 [2018-01-28 22:01:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:10,297 INFO L432 AbstractCegarLoop]: Abstraction has 608 states and 633 transitions. [2018-01-28 22:01:10,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 22:01:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 633 transitions. [2018-01-28 22:01:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-01-28 22:01:10,298 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:10,298 INFO L330 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-28 22:01:10,299 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-28 22:01:10,299 INFO L82 PathProgramCache]: Analyzing trace with hash -135662978, now seen corresponding path program 2 times [2018-01-28 22:01:10,299 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:10,299 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:10,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:10,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:10,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:10,322 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:10,966 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-28 22:01:10,967 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:10,967 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-28 22:01:10,972 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:01:10,998 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:01:11,001 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:01:11,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:11,035 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-28 22:01:11,038 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-28 22:01:11,163 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:11,164 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:11,166 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-28 22:01:11,171 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-28 22:01:11,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:11,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:11,208 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-28 22:01:11,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-01-28 22:01:11,320 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-28 22:01:11,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:01:11,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [29] total 34 [2018-01-28 22:01:11,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-28 22:01:11,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-28 22:01:11,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=763, Unknown=2, NotChecked=122, Total=1122 [2018-01-28 22:01:11,341 INFO L87 Difference]: Start difference. First operand 608 states and 633 transitions. Second operand 34 states. [2018-01-28 22:01:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:12,603 INFO L93 Difference]: Finished difference Result 1241 states and 1302 transitions. [2018-01-28 22:01:12,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-01-28 22:01:12,604 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 192 [2018-01-28 22:01:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:12,606 INFO L225 Difference]: With dead ends: 1241 [2018-01-28 22:01:12,606 INFO L226 Difference]: Without dead ends: 652 [2018-01-28 22:01:12,609 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1408, Invalid=3605, Unknown=107, NotChecked=282, Total=5402 [2018-01-28 22:01:12,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-01-28 22:01:12,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 634. [2018-01-28 22:01:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-01-28 22:01:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 661 transitions. [2018-01-28 22:01:12,650 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 661 transitions. Word has length 192 [2018-01-28 22:01:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:12,650 INFO L432 AbstractCegarLoop]: Abstraction has 634 states and 661 transitions. [2018-01-28 22:01:12,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-28 22:01:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 661 transitions. [2018-01-28 22:01:12,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-01-28 22:01:12,652 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:12,652 INFO L330 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-28 22:01:12,652 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-28 22:01:12,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1339351825, now seen corresponding path program 1 times [2018-01-28 22:01:12,653 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:12,653 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:12,653 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:12,653 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:01:12,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:12,683 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:13,262 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-28 22:01:13,262 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:13,262 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-28 22:01:13,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:13,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:13,389 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-28 22:01:13,409 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:01:13,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 33 [2018-01-28 22:01:13,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 22:01:13,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 22:01:13,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 22:01:13,410 INFO L87 Difference]: Start difference. First operand 634 states and 661 transitions. Second operand 33 states. [2018-01-28 22:01:13,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:13,789 INFO L93 Difference]: Finished difference Result 1283 states and 1345 transitions. [2018-01-28 22:01:13,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-28 22:01:13,789 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 202 [2018-01-28 22:01:13,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:13,792 INFO L225 Difference]: With dead ends: 1283 [2018-01-28 22:01:13,792 INFO L226 Difference]: Without dead ends: 668 [2018-01-28 22:01:13,794 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1159, Invalid=2501, Unknown=0, NotChecked=0, Total=3660 [2018-01-28 22:01:13,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-01-28 22:01:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 654. [2018-01-28 22:01:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-01-28 22:01:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 681 transitions. [2018-01-28 22:01:13,838 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 681 transitions. Word has length 202 [2018-01-28 22:01:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:13,839 INFO L432 AbstractCegarLoop]: Abstraction has 654 states and 681 transitions. [2018-01-28 22:01:13,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 22:01:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 681 transitions. [2018-01-28 22:01:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-01-28 22:01:13,840 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:13,841 INFO L330 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-28 22:01:13,841 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-28 22:01:13,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1656634077, now seen corresponding path program 2 times [2018-01-28 22:01:13,841 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:13,841 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:13,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:13,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:13,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:13,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:14,584 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-28 22:01:14,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:14,584 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-28 22:01:14,590 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:01:14,619 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:01:14,623 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:01:14,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:14,714 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-28 22:01:14,882 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:14,886 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-28 22:01:14,888 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:14,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:14,891 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-28 22:01:14,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:14,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:14,911 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:14,912 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:14,912 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:14,913 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:14,913 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-28 22:01:14,914 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:14,921 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-28 22:01:14,921 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-01-28 22:01:15,088 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-28 22:01:15,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:01:15,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [33] total 39 [2018-01-28 22:01:15,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-28 22:01:15,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-28 22:01:15,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1107, Unknown=2, NotChecked=72, Total=1482 [2018-01-28 22:01:15,110 INFO L87 Difference]: Start difference. First operand 654 states and 681 transitions. Second operand 39 states. [2018-01-28 22:01:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:17,244 INFO L93 Difference]: Finished difference Result 1324 states and 1388 transitions. [2018-01-28 22:01:17,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-01-28 22:01:17,244 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 212 [2018-01-28 22:01:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:17,248 INFO L225 Difference]: With dead ends: 1324 [2018-01-28 22:01:17,248 INFO L226 Difference]: Without dead ends: 689 [2018-01-28 22:01:17,250 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1542 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1838, Invalid=5123, Unknown=183, NotChecked=166, Total=7310 [2018-01-28 22:01:17,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-01-28 22:01:17,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 673. [2018-01-28 22:01:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-01-28 22:01:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 698 transitions. [2018-01-28 22:01:17,293 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 698 transitions. Word has length 212 [2018-01-28 22:01:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:17,294 INFO L432 AbstractCegarLoop]: Abstraction has 673 states and 698 transitions. [2018-01-28 22:01:17,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-28 22:01:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 698 transitions. [2018-01-28 22:01:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-01-28 22:01:17,295 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:17,296 INFO L330 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-28 22:01:17,296 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-28 22:01:17,296 INFO L82 PathProgramCache]: Analyzing trace with hash -173964312, now seen corresponding path program 1 times [2018-01-28 22:01:17,296 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:17,296 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:17,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:17,297 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:01:17,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:17,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:17,893 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-28 22:01:17,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:17,894 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-28 22:01:17,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:17,975 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:18,052 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-28 22:01:18,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:01:18,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 37 [2018-01-28 22:01:18,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-28 22:01:18,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-28 22:01:18,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-01-28 22:01:18,089 INFO L87 Difference]: Start difference. First operand 673 states and 698 transitions. Second operand 37 states. [2018-01-28 22:01:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:18,732 INFO L93 Difference]: Finished difference Result 1361 states and 1419 transitions. [2018-01-28 22:01:18,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-28 22:01:18,733 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 224 [2018-01-28 22:01:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:18,735 INFO L225 Difference]: With dead ends: 1361 [2018-01-28 22:01:18,736 INFO L226 Difference]: Without dead ends: 707 [2018-01-28 22:01:18,739 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1483, Invalid=3209, Unknown=0, NotChecked=0, Total=4692 [2018-01-28 22:01:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-01-28 22:01:18,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 693. [2018-01-28 22:01:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2018-01-28 22:01:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 718 transitions. [2018-01-28 22:01:18,783 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 718 transitions. Word has length 224 [2018-01-28 22:01:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:18,783 INFO L432 AbstractCegarLoop]: Abstraction has 693 states and 718 transitions. [2018-01-28 22:01:18,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-28 22:01:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 718 transitions. [2018-01-28 22:01:18,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-01-28 22:01:18,785 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:18,785 INFO L330 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-28 22:01:18,786 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-28 22:01:18,786 INFO L82 PathProgramCache]: Analyzing trace with hash 718646394, now seen corresponding path program 2 times [2018-01-28 22:01:18,786 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:18,786 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:18,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:18,787 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:18,787 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:18,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:19,514 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-28 22:01:19,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:19,515 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-28 22:01:19,521 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:01:19,547 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:01:19,550 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:01:19,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:19,594 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-28 22:01:19,597 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-28 22:01:19,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:19,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:19,691 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-28 22:01:19,694 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-28 22:01:19,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:19,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:19,703 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-28 22:01:19,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:20 [2018-01-28 22:01:19,843 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-28 22:01:19,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:01:19,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [37] total 42 [2018-01-28 22:01:19,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-01-28 22:01:19,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-01-28 22:01:19,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1195, Unknown=2, NotChecked=154, Total=1722 [2018-01-28 22:01:19,865 INFO L87 Difference]: Start difference. First operand 693 states and 718 transitions. Second operand 42 states. [2018-01-28 22:01:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:21,641 INFO L93 Difference]: Finished difference Result 1441 states and 1505 transitions. [2018-01-28 22:01:21,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-01-28 22:01:21,641 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 234 [2018-01-28 22:01:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:21,644 INFO L225 Difference]: With dead ends: 1441 [2018-01-28 22:01:21,645 INFO L226 Difference]: Without dead ends: 767 [2018-01-28 22:01:21,648 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1885 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2312, Invalid=5895, Unknown=173, NotChecked=362, Total=8742 [2018-01-28 22:01:21,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2018-01-28 22:01:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 730. [2018-01-28 22:01:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-01-28 22:01:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 758 transitions. [2018-01-28 22:01:21,695 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 758 transitions. Word has length 234 [2018-01-28 22:01:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:21,696 INFO L432 AbstractCegarLoop]: Abstraction has 730 states and 758 transitions. [2018-01-28 22:01:21,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-01-28 22:01:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 758 transitions. [2018-01-28 22:01:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-01-28 22:01:21,698 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:21,698 INFO L330 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-28 22:01:21,698 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-28 22:01:21,698 INFO L82 PathProgramCache]: Analyzing trace with hash 358991501, now seen corresponding path program 1 times [2018-01-28 22:01:21,698 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:21,699 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:21,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:21,699 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:01:21,700 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:21,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:22,419 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-28 22:01:22,420 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:22,420 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-28 22:01:22,424 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:22,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:22,546 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-28 22:01:22,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:01:22,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 41 [2018-01-28 22:01:22,576 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-28 22:01:22,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-28 22:01:22,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-01-28 22:01:22,576 INFO L87 Difference]: Start difference. First operand 730 states and 758 transitions. Second operand 41 states. [2018-01-28 22:01:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:23,139 INFO L93 Difference]: Finished difference Result 1475 states and 1540 transitions. [2018-01-28 22:01:23,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-28 22:01:23,139 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 244 [2018-01-28 22:01:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:23,141 INFO L225 Difference]: With dead ends: 1475 [2018-01-28 22:01:23,141 INFO L226 Difference]: Without dead ends: 764 [2018-01-28 22:01:23,142 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1847, Invalid=4005, Unknown=0, NotChecked=0, Total=5852 [2018-01-28 22:01:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-01-28 22:01:23,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 750. [2018-01-28 22:01:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-01-28 22:01:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 778 transitions. [2018-01-28 22:01:23,186 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 778 transitions. Word has length 244 [2018-01-28 22:01:23,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:23,187 INFO L432 AbstractCegarLoop]: Abstraction has 750 states and 778 transitions. [2018-01-28 22:01:23,187 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-28 22:01:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 778 transitions. [2018-01-28 22:01:23,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-01-28 22:01:23,188 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:23,189 INFO L330 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-28 22:01:23,189 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-28 22:01:23,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1104023009, now seen corresponding path program 2 times [2018-01-28 22:01:23,189 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:23,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:23,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:23,190 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:23,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:23,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:23,956 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-28 22:01:23,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:23,956 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-28 22:01:23,961 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 22:01:23,986 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 22:01:23,990 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 22:01:23,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:24,161 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-28 22:01:24,298 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:24,307 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-28 22:01:24,315 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:24,317 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:24,318 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-28 22:01:24,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:24,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:24,335 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:24,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:24,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:24,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:24,337 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-28 22:01:24,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:24,344 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-28 22:01:24,345 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-01-28 22:01:24,565 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-28 22:01:24,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:01:24,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [41] total 49 [2018-01-28 22:01:24,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-28 22:01:24,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-28 22:01:24,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=1799, Unknown=2, NotChecked=92, Total=2352 [2018-01-28 22:01:24,586 INFO L87 Difference]: Start difference. First operand 750 states and 778 transitions. Second operand 49 states. [2018-01-28 22:01:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:27,024 INFO L93 Difference]: Finished difference Result 1539 states and 1607 transitions. [2018-01-28 22:01:27,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-01-28 22:01:27,025 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 254 [2018-01-28 22:01:27,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:27,028 INFO L225 Difference]: With dead ends: 1539 [2018-01-28 22:01:27,028 INFO L226 Difference]: Without dead ends: 808 [2018-01-28 22:01:27,031 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2784 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2881, Invalid=8856, Unknown=257, NotChecked=216, Total=12210 [2018-01-28 22:01:27,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-01-28 22:01:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 770. [2018-01-28 22:01:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-01-28 22:01:27,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 797 transitions. [2018-01-28 22:01:27,061 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 797 transitions. Word has length 254 [2018-01-28 22:01:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:27,062 INFO L432 AbstractCegarLoop]: Abstraction has 770 states and 797 transitions. [2018-01-28 22:01:27,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-28 22:01:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 797 transitions. [2018-01-28 22:01:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-01-28 22:01:27,063 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:27,064 INFO L330 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-28 22:01:27,064 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-28 22:01:27,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1538482900, now seen corresponding path program 1 times [2018-01-28 22:01:27,064 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:27,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:27,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:27,065 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 22:01:27,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:27,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:27,221 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-28 22:01:27,221 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:27,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:01:27,221 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:01:27,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:01:27,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:01:27,222 INFO L87 Difference]: Start difference. First operand 770 states and 797 transitions. Second operand 5 states. [2018-01-28 22:01:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:27,356 INFO L93 Difference]: Finished difference Result 770 states and 797 transitions. [2018-01-28 22:01:27,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 22:01:27,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 265 [2018-01-28 22:01:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:27,358 INFO L225 Difference]: With dead ends: 770 [2018-01-28 22:01:27,358 INFO L226 Difference]: Without dead ends: 769 [2018-01-28 22:01:27,358 INFO L533 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-28 22:01:27,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-01-28 22:01:27,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2018-01-28 22:01:27,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-01-28 22:01:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 796 transitions. [2018-01-28 22:01:27,385 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 796 transitions. Word has length 265 [2018-01-28 22:01:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:27,385 INFO L432 AbstractCegarLoop]: Abstraction has 769 states and 796 transitions. [2018-01-28 22:01:27,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:01:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 796 transitions. [2018-01-28 22:01:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-01-28 22:01:27,387 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:27,387 INFO L330 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-28 22:01:27,387 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-28 22:01:27,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1538482901, now seen corresponding path program 1 times [2018-01-28 22:01:27,388 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:27,388 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:27,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:27,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:27,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:27,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:27,720 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-28 22:01:27,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:27,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:01:27,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 22:01:27,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 22:01:27,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-28 22:01:27,754 INFO L87 Difference]: Start difference. First operand 769 states and 796 transitions. Second operand 6 states. [2018-01-28 22:01:27,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:27,978 INFO L93 Difference]: Finished difference Result 771 states and 798 transitions. [2018-01-28 22:01:27,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:01:27,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2018-01-28 22:01:27,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:27,981 INFO L225 Difference]: With dead ends: 771 [2018-01-28 22:01:27,981 INFO L226 Difference]: Without dead ends: 764 [2018-01-28 22:01:27,981 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:01:27,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-01-28 22:01:28,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2018-01-28 22:01:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2018-01-28 22:01:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 791 transitions. [2018-01-28 22:01:28,023 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 791 transitions. Word has length 265 [2018-01-28 22:01:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:28,023 INFO L432 AbstractCegarLoop]: Abstraction has 764 states and 791 transitions. [2018-01-28 22:01:28,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 22:01:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 791 transitions. [2018-01-28 22:01:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-01-28 22:01:28,024 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:28,024 INFO L330 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-28 22:01:28,024 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-28 22:01:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash -652515550, now seen corresponding path program 1 times [2018-01-28 22:01:28,025 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:28,025 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:28,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:28,025 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:28,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:28,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:28,745 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 24 DAG size of output 17 [2018-01-28 22:01:28,997 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-28 22:01:28,998 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:28,998 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 22:01:28,998 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:01:28,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:01:28,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:01:28,998 INFO L87 Difference]: Start difference. First operand 764 states and 791 transitions. Second operand 8 states. [2018-01-28 22:01:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:29,542 INFO L93 Difference]: Finished difference Result 785 states and 812 transitions. [2018-01-28 22:01:29,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:01:29,542 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 266 [2018-01-28 22:01:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:29,544 INFO L225 Difference]: With dead ends: 785 [2018-01-28 22:01:29,544 INFO L226 Difference]: Without dead ends: 784 [2018-01-28 22:01:29,544 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:01:29,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2018-01-28 22:01:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 777. [2018-01-28 22:01:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2018-01-28 22:01:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 808 transitions. [2018-01-28 22:01:29,579 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 808 transitions. Word has length 266 [2018-01-28 22:01:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:29,580 INFO L432 AbstractCegarLoop]: Abstraction has 777 states and 808 transitions. [2018-01-28 22:01:29,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:01:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 808 transitions. [2018-01-28 22:01:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-01-28 22:01:29,581 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:29,582 INFO L330 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-28 22:01:29,582 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-28 22:01:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash -652515549, now seen corresponding path program 1 times [2018-01-28 22:01:29,582 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:29,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:29,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:29,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:29,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:30,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:30,995 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-28 22:01:30,995 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:30,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-28 22:01:30,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:01:30,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:01:30,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:01:30,996 INFO L87 Difference]: Start difference. First operand 777 states and 808 transitions. Second operand 13 states. [2018-01-28 22:01:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:31,561 INFO L93 Difference]: Finished difference Result 784 states and 810 transitions. [2018-01-28 22:01:31,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:01:31,561 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 266 [2018-01-28 22:01:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:31,564 INFO L225 Difference]: With dead ends: 784 [2018-01-28 22:01:31,564 INFO L226 Difference]: Without dead ends: 783 [2018-01-28 22:01:31,565 INFO L533 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-28 22:01:31,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-01-28 22:01:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 757. [2018-01-28 22:01:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2018-01-28 22:01:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 785 transitions. [2018-01-28 22:01:31,607 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 785 transitions. Word has length 266 [2018-01-28 22:01:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:31,607 INFO L432 AbstractCegarLoop]: Abstraction has 757 states and 785 transitions. [2018-01-28 22:01:31,607 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:01:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 785 transitions. [2018-01-28 22:01:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-01-28 22:01:31,609 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:31,609 INFO L330 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-28 22:01:31,610 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-28 22:01:31,610 INFO L82 PathProgramCache]: Analyzing trace with hash 448329793, now seen corresponding path program 1 times [2018-01-28 22:01:31,610 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:31,610 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:31,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:31,611 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:31,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:31,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:31,804 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-28 22:01:31,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:31,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 22:01:31,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 22:01:31,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 22:01:31,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 22:01:31,805 INFO L87 Difference]: Start difference. First operand 757 states and 785 transitions. Second operand 7 states. [2018-01-28 22:01:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:32,032 INFO L93 Difference]: Finished difference Result 776 states and 806 transitions. [2018-01-28 22:01:32,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 22:01:32,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 266 [2018-01-28 22:01:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:32,034 INFO L225 Difference]: With dead ends: 776 [2018-01-28 22:01:32,034 INFO L226 Difference]: Without dead ends: 775 [2018-01-28 22:01:32,034 INFO L533 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-28 22:01:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-01-28 22:01:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 756. [2018-01-28 22:01:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 756 states. [2018-01-28 22:01:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 784 transitions. [2018-01-28 22:01:32,076 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 784 transitions. Word has length 266 [2018-01-28 22:01:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:32,076 INFO L432 AbstractCegarLoop]: Abstraction has 756 states and 784 transitions. [2018-01-28 22:01:32,076 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 22:01:32,076 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 784 transitions. [2018-01-28 22:01:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-01-28 22:01:32,077 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:32,078 INFO L330 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-28 22:01:32,078 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-28 22:01:32,078 INFO L82 PathProgramCache]: Analyzing trace with hash 448329794, now seen corresponding path program 1 times [2018-01-28 22:01:32,078 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:32,078 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:32,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:32,079 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:32,079 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:32,097 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:32,433 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-28 22:01:32,433 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:32,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:01:32,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:01:32,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:01:32,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:01:32,434 INFO L87 Difference]: Start difference. First operand 756 states and 784 transitions. Second operand 9 states. [2018-01-28 22:01:32,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:32,693 INFO L93 Difference]: Finished difference Result 786 states and 816 transitions. [2018-01-28 22:01:32,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:01:32,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 266 [2018-01-28 22:01:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:32,695 INFO L225 Difference]: With dead ends: 786 [2018-01-28 22:01:32,695 INFO L226 Difference]: Without dead ends: 785 [2018-01-28 22:01:32,695 INFO L533 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-28 22:01:32,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-01-28 22:01:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 755. [2018-01-28 22:01:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-01-28 22:01:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 783 transitions. [2018-01-28 22:01:32,765 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 783 transitions. Word has length 266 [2018-01-28 22:01:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:32,766 INFO L432 AbstractCegarLoop]: Abstraction has 755 states and 783 transitions. [2018-01-28 22:01:32,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:01:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 783 transitions. [2018-01-28 22:01:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-01-28 22:01:32,768 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:32,768 INFO L330 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-28 22:01:32,768 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-28 22:01:32,768 INFO L82 PathProgramCache]: Analyzing trace with hash 321458883, now seen corresponding path program 1 times [2018-01-28 22:01:32,768 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:32,768 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:32,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:32,769 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:32,769 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:32,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:33,867 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-28 22:01:33,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:33,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 22:01:33,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:01:33,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:01:33,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:01:33,868 INFO L87 Difference]: Start difference. First operand 755 states and 783 transitions. Second operand 12 states. [2018-01-28 22:01:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:34,495 INFO L93 Difference]: Finished difference Result 761 states and 789 transitions. [2018-01-28 22:01:34,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:01:34,496 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 269 [2018-01-28 22:01:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:34,498 INFO L225 Difference]: With dead ends: 761 [2018-01-28 22:01:34,498 INFO L226 Difference]: Without dead ends: 759 [2018-01-28 22:01:34,498 INFO L533 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-28 22:01:34,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-01-28 22:01:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 753. [2018-01-28 22:01:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-01-28 22:01:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 778 transitions. [2018-01-28 22:01:34,540 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 778 transitions. Word has length 269 [2018-01-28 22:01:34,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:34,541 INFO L432 AbstractCegarLoop]: Abstraction has 753 states and 778 transitions. [2018-01-28 22:01:34,541 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:01:34,541 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 778 transitions. [2018-01-28 22:01:34,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-01-28 22:01:34,542 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:34,543 INFO L330 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-28 22:01:34,543 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-28 22:01:34,543 INFO L82 PathProgramCache]: Analyzing trace with hash 321458884, now seen corresponding path program 1 times [2018-01-28 22:01:34,543 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:34,543 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:34,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:34,544 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:34,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:34,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:36,379 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-28 22:01:36,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:36,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-28 22:01:36,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 22:01:36,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 22:01:36,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-28 22:01:36,380 INFO L87 Difference]: Start difference. First operand 753 states and 778 transitions. Second operand 13 states. [2018-01-28 22:01:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:37,290 INFO L93 Difference]: Finished difference Result 759 states and 784 transitions. [2018-01-28 22:01:37,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 22:01:37,291 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 269 [2018-01-28 22:01:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:37,293 INFO L225 Difference]: With dead ends: 759 [2018-01-28 22:01:37,293 INFO L226 Difference]: Without dead ends: 757 [2018-01-28 22:01:37,293 INFO L533 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-28 22:01:37,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-01-28 22:01:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 728. [2018-01-28 22:01:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 728 states. [2018-01-28 22:01:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 748 transitions. [2018-01-28 22:01:37,341 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 748 transitions. Word has length 269 [2018-01-28 22:01:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:37,341 INFO L432 AbstractCegarLoop]: Abstraction has 728 states and 748 transitions. [2018-01-28 22:01:37,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 22:01:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 748 transitions. [2018-01-28 22:01:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-01-28 22:01:37,342 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:37,343 INFO L330 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-28 22:01:37,343 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-28 22:01:37,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1453825657, now seen corresponding path program 1 times [2018-01-28 22:01:37,343 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:37,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:37,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:37,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:37,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:37,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:37,437 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-28 22:01:37,437 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:37,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:01:37,438 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:01:37,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:01:37,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:01:37,438 INFO L87 Difference]: Start difference. First operand 728 states and 748 transitions. Second operand 5 states. [2018-01-28 22:01:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:37,606 INFO L93 Difference]: Finished difference Result 751 states and 773 transitions. [2018-01-28 22:01:37,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:01:37,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 270 [2018-01-28 22:01:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:37,608 INFO L225 Difference]: With dead ends: 751 [2018-01-28 22:01:37,608 INFO L226 Difference]: Without dead ends: 750 [2018-01-28 22:01:37,609 INFO L533 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-28 22:01:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-01-28 22:01:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 727. [2018-01-28 22:01:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-01-28 22:01:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 747 transitions. [2018-01-28 22:01:37,656 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 747 transitions. Word has length 270 [2018-01-28 22:01:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:37,657 INFO L432 AbstractCegarLoop]: Abstraction has 727 states and 747 transitions. [2018-01-28 22:01:37,657 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:01:37,657 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 747 transitions. [2018-01-28 22:01:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-01-28 22:01:37,658 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:37,658 INFO L330 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-28 22:01:37,658 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-28 22:01:37,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1453825656, now seen corresponding path program 1 times [2018-01-28 22:01:37,658 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:37,658 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:37,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:37,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:37,659 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:37,704 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:38,175 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-28 22:01:38,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:38,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 22:01:38,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 22:01:38,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 22:01:38,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-28 22:01:38,177 INFO L87 Difference]: Start difference. First operand 727 states and 747 transitions. Second operand 10 states. [2018-01-28 22:01:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:38,535 INFO L93 Difference]: Finished difference Result 761 states and 783 transitions. [2018-01-28 22:01:38,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-28 22:01:38,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 270 [2018-01-28 22:01:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:38,537 INFO L225 Difference]: With dead ends: 761 [2018-01-28 22:01:38,537 INFO L226 Difference]: Without dead ends: 760 [2018-01-28 22:01:38,538 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:01:38,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-01-28 22:01:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 726. [2018-01-28 22:01:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-01-28 22:01:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 746 transitions. [2018-01-28 22:01:38,587 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 746 transitions. Word has length 270 [2018-01-28 22:01:38,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:38,587 INFO L432 AbstractCegarLoop]: Abstraction has 726 states and 746 transitions. [2018-01-28 22:01:38,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 22:01:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 746 transitions. [2018-01-28 22:01:38,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-01-28 22:01:38,588 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:38,588 INFO L330 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-28 22:01:38,589 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-28 22:01:38,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2118922245, now seen corresponding path program 1 times [2018-01-28 22:01:38,589 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:38,589 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:38,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:38,590 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:38,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:38,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:39,195 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-28 22:01:39,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:39,195 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-28 22:01:39,195 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-28 22:01:39,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-28 22:01:39,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-01-28 22:01:39,196 INFO L87 Difference]: Start difference. First operand 726 states and 746 transitions. Second operand 16 states. [2018-01-28 22:01:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:39,982 INFO L93 Difference]: Finished difference Result 798 states and 826 transitions. [2018-01-28 22:01:39,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-28 22:01:39,982 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 271 [2018-01-28 22:01:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:39,985 INFO L225 Difference]: With dead ends: 798 [2018-01-28 22:01:39,985 INFO L226 Difference]: Without dead ends: 797 [2018-01-28 22:01:39,985 INFO L533 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-28 22:01:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2018-01-28 22:01:40,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 714. [2018-01-28 22:01:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-01-28 22:01:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 738 transitions. [2018-01-28 22:01:40,034 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 738 transitions. Word has length 271 [2018-01-28 22:01:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:40,034 INFO L432 AbstractCegarLoop]: Abstraction has 714 states and 738 transitions. [2018-01-28 22:01:40,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-28 22:01:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 738 transitions. [2018-01-28 22:01:40,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-01-28 22:01:40,035 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:40,035 INFO L330 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-28 22:01:40,035 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-28 22:01:40,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2118922244, now seen corresponding path program 1 times [2018-01-28 22:01:40,036 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:40,036 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:40,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:40,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:40,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:40,060 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:40,744 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-28 22:01:40,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:40,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-28 22:01:40,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-28 22:01:40,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-28 22:01:40,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-01-28 22:01:40,746 INFO L87 Difference]: Start difference. First operand 714 states and 738 transitions. Second operand 18 states. [2018-01-28 22:01:41,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:41,743 INFO L93 Difference]: Finished difference Result 776 states and 802 transitions. [2018-01-28 22:01:41,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 22:01:41,743 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 271 [2018-01-28 22:01:41,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:41,746 INFO L225 Difference]: With dead ends: 776 [2018-01-28 22:01:41,747 INFO L226 Difference]: Without dead ends: 775 [2018-01-28 22:01:41,747 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2018-01-28 22:01:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2018-01-28 22:01:41,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 714. [2018-01-28 22:01:41,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2018-01-28 22:01:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 737 transitions. [2018-01-28 22:01:41,816 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 737 transitions. Word has length 271 [2018-01-28 22:01:41,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:41,817 INFO L432 AbstractCegarLoop]: Abstraction has 714 states and 737 transitions. [2018-01-28 22:01:41,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-28 22:01:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 737 transitions. [2018-01-28 22:01:41,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-01-28 22:01:41,819 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:41,819 INFO L330 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-28 22:01:41,819 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-28 22:01:41,819 INFO L82 PathProgramCache]: Analyzing trace with hash -315649547, now seen corresponding path program 1 times [2018-01-28 22:01:41,819 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:41,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:41,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:41,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:41,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:42,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:42,729 WARN L143 SmtUtils]: Spent 119ms on a formula simplification that was a NOOP. DAG size: 31 [2018-01-28 22:01:43,358 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-28 22:01:43,358 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:43,398 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 22:01:43,398 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:01:43,398 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:01:43,398 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:01:43,399 INFO L87 Difference]: Start difference. First operand 714 states and 737 transitions. Second operand 12 states. [2018-01-28 22:01:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:44,112 INFO L93 Difference]: Finished difference Result 723 states and 746 transitions. [2018-01-28 22:01:44,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:01:44,112 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 271 [2018-01-28 22:01:44,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:44,114 INFO L225 Difference]: With dead ends: 723 [2018-01-28 22:01:44,114 INFO L226 Difference]: Without dead ends: 722 [2018-01-28 22:01:44,114 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:01:44,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-01-28 22:01:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 713. [2018-01-28 22:01:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-01-28 22:01:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 735 transitions. [2018-01-28 22:01:44,162 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 735 transitions. Word has length 271 [2018-01-28 22:01:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:44,162 INFO L432 AbstractCegarLoop]: Abstraction has 713 states and 735 transitions. [2018-01-28 22:01:44,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:01:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 735 transitions. [2018-01-28 22:01:44,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-01-28 22:01:44,163 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:44,163 INFO L330 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-28 22:01:44,164 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-28 22:01:44,164 INFO L82 PathProgramCache]: Analyzing trace with hash -315649546, now seen corresponding path program 1 times [2018-01-28 22:01:44,164 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:44,164 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:44,164 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:44,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:44,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:44,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:45,113 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-28 22:01:45,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:45,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-28 22:01:45,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-28 22:01:45,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-28 22:01:45,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-28 22:01:45,115 INFO L87 Difference]: Start difference. First operand 713 states and 735 transitions. Second operand 14 states. [2018-01-28 22:01:46,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:46,089 INFO L93 Difference]: Finished difference Result 726 states and 749 transitions. [2018-01-28 22:01:46,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 22:01:46,089 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 271 [2018-01-28 22:01:46,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:46,091 INFO L225 Difference]: With dead ends: 726 [2018-01-28 22:01:46,091 INFO L226 Difference]: Without dead ends: 725 [2018-01-28 22:01:46,092 INFO L533 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-28 22:01:46,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-01-28 22:01:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 698. [2018-01-28 22:01:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-01-28 22:01:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 719 transitions. [2018-01-28 22:01:46,143 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 719 transitions. Word has length 271 [2018-01-28 22:01:46,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:46,143 INFO L432 AbstractCegarLoop]: Abstraction has 698 states and 719 transitions. [2018-01-28 22:01:46,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-28 22:01:46,143 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 719 transitions. [2018-01-28 22:01:46,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-01-28 22:01:46,144 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:46,144 INFO L330 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-28 22:01:46,145 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-28 22:01:46,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1552001514, now seen corresponding path program 1 times [2018-01-28 22:01:46,145 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:46,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:46,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:46,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:46,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:46,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:46,296 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-28 22:01:46,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:46,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 22:01:46,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:01:46,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:01:46,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:01:46,298 INFO L87 Difference]: Start difference. First operand 698 states and 719 transitions. Second operand 5 states. [2018-01-28 22:01:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:46,363 INFO L93 Difference]: Finished difference Result 1446 states and 1495 transitions. [2018-01-28 22:01:46,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:01:46,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 286 [2018-01-28 22:01:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:46,365 INFO L225 Difference]: With dead ends: 1446 [2018-01-28 22:01:46,365 INFO L226 Difference]: Without dead ends: 768 [2018-01-28 22:01:46,366 INFO L533 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-28 22:01:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-01-28 22:01:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 707. [2018-01-28 22:01:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2018-01-28 22:01:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 728 transitions. [2018-01-28 22:01:46,415 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 728 transitions. Word has length 286 [2018-01-28 22:01:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:46,415 INFO L432 AbstractCegarLoop]: Abstraction has 707 states and 728 transitions. [2018-01-28 22:01:46,415 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:01:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 728 transitions. [2018-01-28 22:01:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-01-28 22:01:46,416 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:46,416 INFO L330 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-28 22:01:46,416 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-28 22:01:46,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1480145241, now seen corresponding path program 1 times [2018-01-28 22:01:46,416 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:46,416 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:46,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:46,417 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:46,417 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:46,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:46,877 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-28 22:01:46,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:46,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-28 22:01:46,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 22:01:46,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 22:01:46,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-01-28 22:01:46,878 INFO L87 Difference]: Start difference. First operand 707 states and 728 transitions. Second operand 17 states. [2018-01-28 22:01:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:47,725 INFO L93 Difference]: Finished difference Result 1452 states and 1498 transitions. [2018-01-28 22:01:47,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-28 22:01:47,726 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 288 [2018-01-28 22:01:47,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:47,728 INFO L225 Difference]: With dead ends: 1452 [2018-01-28 22:01:47,728 INFO L226 Difference]: Without dead ends: 765 [2018-01-28 22:01:47,729 INFO L533 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-28 22:01:47,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2018-01-28 22:01:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 707. [2018-01-28 22:01:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2018-01-28 22:01:47,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 727 transitions. [2018-01-28 22:01:47,786 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 727 transitions. Word has length 288 [2018-01-28 22:01:47,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:47,786 INFO L432 AbstractCegarLoop]: Abstraction has 707 states and 727 transitions. [2018-01-28 22:01:47,786 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 22:01:47,786 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 727 transitions. [2018-01-28 22:01:47,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-01-28 22:01:47,787 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:47,787 INFO L330 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-28 22:01:47,787 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-28 22:01:47,788 INFO L82 PathProgramCache]: Analyzing trace with hash 86200420, now seen corresponding path program 1 times [2018-01-28 22:01:47,788 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:47,788 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:47,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:47,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:47,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:47,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:48,245 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-28 22:01:48,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:48,245 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-28 22:01:48,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:48,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:48,385 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:48,386 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-28 22:01:48,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:48,441 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:48,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:48,443 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-28 22:01:48,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:48,448 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-28 22:01:48,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-01-28 22:01:48,502 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-28 22:01:48,524 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:01:48,525 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 17 [2018-01-28 22:01:48,525 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-28 22:01:48,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-28 22:01:48,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-01-28 22:01:48,525 INFO L87 Difference]: Start difference. First operand 707 states and 727 transitions. Second operand 18 states. [2018-01-28 22:01:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:48,933 INFO L93 Difference]: Finished difference Result 726 states and 748 transitions. [2018-01-28 22:01:48,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 22:01:48,933 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 290 [2018-01-28 22:01:48,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:48,935 INFO L225 Difference]: With dead ends: 726 [2018-01-28 22:01:48,935 INFO L226 Difference]: Without dead ends: 724 [2018-01-28 22:01:48,935 INFO L533 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-28 22:01:48,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2018-01-28 22:01:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 704. [2018-01-28 22:01:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-01-28 22:01:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 723 transitions. [2018-01-28 22:01:48,987 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 723 transitions. Word has length 290 [2018-01-28 22:01:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:48,988 INFO L432 AbstractCegarLoop]: Abstraction has 704 states and 723 transitions. [2018-01-28 22:01:48,988 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-28 22:01:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 723 transitions. [2018-01-28 22:01:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-01-28 22:01:48,989 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:48,989 INFO L330 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-28 22:01:48,990 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-28 22:01:48,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1702545986, now seen corresponding path program 1 times [2018-01-28 22:01:48,990 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:48,990 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:48,990 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:48,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:48,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:49,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:49,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-28 22:01:49,059 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:49,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 22:01:49,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 22:01:49,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 22:01:49,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 22:01:49,060 INFO L87 Difference]: Start difference. First operand 704 states and 723 transitions. Second operand 3 states. [2018-01-28 22:01:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:49,116 INFO L93 Difference]: Finished difference Result 752 states and 772 transitions. [2018-01-28 22:01:49,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 22:01:49,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2018-01-28 22:01:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:49,118 INFO L225 Difference]: With dead ends: 752 [2018-01-28 22:01:49,118 INFO L226 Difference]: Without dead ends: 705 [2018-01-28 22:01:49,118 INFO L533 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-28 22:01:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-01-28 22:01:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 705. [2018-01-28 22:01:49,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-01-28 22:01:49,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 724 transitions. [2018-01-28 22:01:49,169 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 724 transitions. Word has length 290 [2018-01-28 22:01:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:49,170 INFO L432 AbstractCegarLoop]: Abstraction has 705 states and 724 transitions. [2018-01-28 22:01:49,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 22:01:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 724 transitions. [2018-01-28 22:01:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-01-28 22:01:49,171 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:49,171 INFO L330 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-28 22:01:49,171 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-28 22:01:49,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1140497403, now seen corresponding path program 1 times [2018-01-28 22:01:49,172 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:49,172 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:49,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:49,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:49,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:49,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:49,283 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-28 22:01:49,283 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:49,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:01:49,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:01:49,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:01:49,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:01:49,284 INFO L87 Difference]: Start difference. First operand 705 states and 724 transitions. Second operand 5 states. [2018-01-28 22:01:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:49,462 INFO L93 Difference]: Finished difference Result 724 states and 745 transitions. [2018-01-28 22:01:49,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:01:49,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 292 [2018-01-28 22:01:49,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:49,464 INFO L225 Difference]: With dead ends: 724 [2018-01-28 22:01:49,465 INFO L226 Difference]: Without dead ends: 723 [2018-01-28 22:01:49,465 INFO L533 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-28 22:01:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2018-01-28 22:01:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 711. [2018-01-28 22:01:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2018-01-28 22:01:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 732 transitions. [2018-01-28 22:01:49,521 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 732 transitions. Word has length 292 [2018-01-28 22:01:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:49,521 INFO L432 AbstractCegarLoop]: Abstraction has 711 states and 732 transitions. [2018-01-28 22:01:49,521 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:01:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 732 transitions. [2018-01-28 22:01:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-01-28 22:01:49,522 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:49,523 INFO L330 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-28 22:01:49,523 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-28 22:01:49,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1140497404, now seen corresponding path program 1 times [2018-01-28 22:01:49,523 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:49,523 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:49,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:49,524 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:49,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:49,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:50,894 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-28 22:01:50,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:50,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-28 22:01:50,895 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-28 22:01:50,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-28 22:01:50,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-01-28 22:01:50,896 INFO L87 Difference]: Start difference. First operand 711 states and 732 transitions. Second operand 18 states. [2018-01-28 22:01:51,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:51,918 INFO L93 Difference]: Finished difference Result 817 states and 849 transitions. [2018-01-28 22:01:51,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-28 22:01:51,918 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 292 [2018-01-28 22:01:51,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:51,920 INFO L225 Difference]: With dead ends: 817 [2018-01-28 22:01:51,920 INFO L226 Difference]: Without dead ends: 816 [2018-01-28 22:01:51,921 INFO L533 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-28 22:01:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2018-01-28 22:01:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 773. [2018-01-28 22:01:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2018-01-28 22:01:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 801 transitions. [2018-01-28 22:01:51,972 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 801 transitions. Word has length 292 [2018-01-28 22:01:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:51,972 INFO L432 AbstractCegarLoop]: Abstraction has 773 states and 801 transitions. [2018-01-28 22:01:51,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-28 22:01:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 801 transitions. [2018-01-28 22:01:51,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-01-28 22:01:51,973 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:51,974 INFO L330 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-28 22:01:51,974 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-28 22:01:51,974 INFO L82 PathProgramCache]: Analyzing trace with hash 713645018, now seen corresponding path program 1 times [2018-01-28 22:01:51,974 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:51,974 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:51,974 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:51,975 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:51,975 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:51,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:52,135 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-28 22:01:52,135 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:01:52,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:01:52,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 22:01:52,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 22:01:52,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-28 22:01:52,136 INFO L87 Difference]: Start difference. First operand 773 states and 801 transitions. Second operand 8 states. [2018-01-28 22:01:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:52,330 INFO L93 Difference]: Finished difference Result 798 states and 825 transitions. [2018-01-28 22:01:52,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 22:01:52,330 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 294 [2018-01-28 22:01:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:52,332 INFO L225 Difference]: With dead ends: 798 [2018-01-28 22:01:52,332 INFO L226 Difference]: Without dead ends: 792 [2018-01-28 22:01:52,332 INFO L533 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-28 22:01:52,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-01-28 22:01:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 773. [2018-01-28 22:01:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2018-01-28 22:01:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 799 transitions. [2018-01-28 22:01:52,382 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 799 transitions. Word has length 294 [2018-01-28 22:01:52,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:52,382 INFO L432 AbstractCegarLoop]: Abstraction has 773 states and 799 transitions. [2018-01-28 22:01:52,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 22:01:52,382 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 799 transitions. [2018-01-28 22:01:52,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-01-28 22:01:52,383 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:52,383 INFO L330 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-28 22:01:52,384 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-28 22:01:52,384 INFO L82 PathProgramCache]: Analyzing trace with hash 557043058, now seen corresponding path program 1 times [2018-01-28 22:01:52,384 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:52,384 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:52,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:52,384 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:52,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:52,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:52,741 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-28 22:01:52,741 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:52,742 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-28 22:01:52,748 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:52,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:52,911 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-28 22:01:52,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:52,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:52,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-01-28 22:01:52,969 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-28 22:01:52,972 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-28 22:01:52,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:52,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:52,992 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-28 22:01:52,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-01-28 22:01:53,023 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-28 22:01:53,026 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-28 22:01:53,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:53,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:53,034 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-28 22:01:53,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:11 [2018-01-28 22:01:53,085 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-28 22:01:53,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 22:01:53,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2018-01-28 22:01:53,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 22:01:53,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 22:01:53,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-01-28 22:01:53,106 INFO L87 Difference]: Start difference. First operand 773 states and 799 transitions. Second operand 21 states. [2018-01-28 22:01:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:01:53,846 INFO L93 Difference]: Finished difference Result 784 states and 812 transitions. [2018-01-28 22:01:53,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-28 22:01:53,846 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 297 [2018-01-28 22:01:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:01:53,848 INFO L225 Difference]: With dead ends: 784 [2018-01-28 22:01:53,848 INFO L226 Difference]: Without dead ends: 783 [2018-01-28 22:01:53,849 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2018-01-28 22:01:53,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2018-01-28 22:01:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 772. [2018-01-28 22:01:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-01-28 22:01:53,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 798 transitions. [2018-01-28 22:01:53,899 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 798 transitions. Word has length 297 [2018-01-28 22:01:53,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:01:53,900 INFO L432 AbstractCegarLoop]: Abstraction has 772 states and 798 transitions. [2018-01-28 22:01:53,900 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 22:01:53,900 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 798 transitions. [2018-01-28 22:01:53,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-01-28 22:01:53,901 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:01:53,901 INFO L330 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-28 22:01:53,901 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-28 22:01:53,902 INFO L82 PathProgramCache]: Analyzing trace with hash 557043059, now seen corresponding path program 1 times [2018-01-28 22:01:53,902 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:01:53,902 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:01:53,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:53,902 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:53,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:01:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:53,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:01:54,553 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-28 22:01:54,553 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:01:54,553 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-28 22:01:54,558 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:01:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:01:54,652 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:01:54,663 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-28 22:01:54,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:54,669 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:54,670 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-28 22:01:54,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:54,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:54,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-01-28 22:01:54,747 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-28 22:01:54,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:54,916 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:54,917 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:54,917 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-28 22:01:54,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:54,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:54,928 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-28 22:01:54,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:54,930 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:54,931 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-28 22:01:54,931 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:54,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:54,951 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-28 22:01:54,951 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:22 [2018-01-28 22:01:54,983 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-28 22:01:54,995 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-28 22:01:54,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:54,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:55,004 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-28 22:01:55,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:20 [2018-01-28 22:01:55,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:55,704 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:55,706 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:55,717 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:55,718 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:55,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:01:55,733 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-28 22:01:55,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-01-28 22:01:55,785 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-28 22:01:55,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:133 [2018-01-28 22:01:56,043 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-28 22:01:56,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-01-28 22:01:56,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,196 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-28 22:01:56,198 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-28 22:01:56,199 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,314 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-28 22:01:56,316 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-28 22:01:56,316 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,366 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,427 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-28 22:01:56,430 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-28 22:01:56,431 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,465 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,519 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-28 22:01:56,522 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-28 22:01:56,522 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-28 22:01:56,557 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,575 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,626 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-28 22:01:56,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2018-01-28 22:01:56,629 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,679 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,712 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-28 22:01:56,712 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 13 variables, input treesize:226, output treesize:202 [2018-01-28 22:01:56,809 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-28 22:01:56,812 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-28 22:01:56,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,890 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-28 22:01:56,892 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-28 22:01:56,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,924 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-28 22:01:56,924 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,954 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-28 22:01:56,954 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:56,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,011 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-28 22:01:57,013 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-28 22:01:57,013 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,036 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-28 22:01:57,036 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,052 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,089 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-28 22:01:57,091 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-28 22:01:57,092 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,114 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-28 22:01:57,115 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,139 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-28 22:01:57,140 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,154 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,195 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-28 22:01:57,198 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-28 22:01:57,198 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,234 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-28 22:01:57,235 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,264 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,299 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-28 22:01:57,301 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-28 22:01:57,301 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,327 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-28 22:01:57,328 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,353 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-28 22:01:57,353 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,368 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:01:57,392 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-28 22:01:57,393 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 19 variables, input treesize:256, output treesize:80 [2018-01-28 22:01:57,836 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-28 22:01:57,857 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:01:57,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 22] total 32 [2018-01-28 22:01:57,857 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 22:01:57,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 22:01:57,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=906, Unknown=7, NotChecked=60, Total=1056 [2018-01-28 22:01:57,858 INFO L87 Difference]: Start difference. First operand 772 states and 798 transitions. Second operand 33 states. [2018-01-28 22:01:59,238 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 81 DAG size of output 65 [2018-01-28 22:01:59,499 WARN L146 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 122 DAG size of output 99 [2018-01-28 22:01:59,878 WARN L146 SmtUtils]: Spent 271ms on a formula simplification. DAG size of input: 148 DAG size of output 117 [2018-01-28 22:02:00,175 WARN L146 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 125 DAG size of output 102 [2018-01-28 22:02:00,730 WARN L146 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 148 DAG size of output 107 [2018-01-28 22:02:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:02:01,659 INFO L93 Difference]: Finished difference Result 981 states and 1047 transitions. [2018-01-28 22:02:01,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-28 22:02:01,659 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 297 [2018-01-28 22:02:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:02:01,661 INFO L225 Difference]: With dead ends: 981 [2018-01-28 22:02:01,661 INFO L226 Difference]: Without dead ends: 980 [2018-01-28 22:02:01,662 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 272 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=468, Invalid=3305, Unknown=13, NotChecked=120, Total=3906 [2018-01-28 22:02:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2018-01-28 22:02:01,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 840. [2018-01-28 22:02:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-01-28 22:02:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 878 transitions. [2018-01-28 22:02:01,718 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 878 transitions. Word has length 297 [2018-01-28 22:02:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:02:01,718 INFO L432 AbstractCegarLoop]: Abstraction has 840 states and 878 transitions. [2018-01-28 22:02:01,718 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 22:02:01,718 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 878 transitions. [2018-01-28 22:02:01,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-01-28 22:02:01,719 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:02:01,719 INFO L330 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-28 22:02:01,720 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-28 22:02:01,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1613074308, now seen corresponding path program 1 times [2018-01-28 22:02:01,720 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:02:01,720 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:02:01,720 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:02:01,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:02:01,721 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:02:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:02:01,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:02:02,196 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-28 22:02:02,196 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:02:02,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-28 22:02:02,197 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-28 22:02:02,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-28 22:02:02,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-28 22:02:02,197 INFO L87 Difference]: Start difference. First operand 840 states and 878 transitions. Second operand 12 states. [2018-01-28 22:02:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:02:02,635 INFO L93 Difference]: Finished difference Result 893 states and 944 transitions. [2018-01-28 22:02:02,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 22:02:02,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 297 [2018-01-28 22:02:02,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:02:02,637 INFO L225 Difference]: With dead ends: 893 [2018-01-28 22:02:02,637 INFO L226 Difference]: Without dead ends: 892 [2018-01-28 22:02:02,637 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2018-01-28 22:02:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2018-01-28 22:02:02,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 845. [2018-01-28 22:02:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-01-28 22:02:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 884 transitions. [2018-01-28 22:02:02,696 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 884 transitions. Word has length 297 [2018-01-28 22:02:02,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:02:02,696 INFO L432 AbstractCegarLoop]: Abstraction has 845 states and 884 transitions. [2018-01-28 22:02:02,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-28 22:02:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 884 transitions. [2018-01-28 22:02:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-01-28 22:02:02,698 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:02:02,698 INFO L330 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-28 22:02:02,698 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-28 22:02:02,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1613074307, now seen corresponding path program 1 times [2018-01-28 22:02:02,698 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:02:02,698 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:02:02,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:02:02,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:02:02,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:02:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:02:02,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:02:02,836 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-28 22:02:02,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:02:02,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 22:02:02,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 22:02:02,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 22:02:02,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 22:02:02,837 INFO L87 Difference]: Start difference. First operand 845 states and 884 transitions. Second operand 5 states. [2018-01-28 22:02:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:02:03,011 INFO L93 Difference]: Finished difference Result 848 states and 886 transitions. [2018-01-28 22:02:03,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 22:02:03,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 297 [2018-01-28 22:02:03,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:02:03,013 INFO L225 Difference]: With dead ends: 848 [2018-01-28 22:02:03,013 INFO L226 Difference]: Without dead ends: 847 [2018-01-28 22:02:03,013 INFO L533 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-28 22:02:03,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-01-28 22:02:03,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 845. [2018-01-28 22:02:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-01-28 22:02:03,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 883 transitions. [2018-01-28 22:02:03,066 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 883 transitions. Word has length 297 [2018-01-28 22:02:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:02:03,066 INFO L432 AbstractCegarLoop]: Abstraction has 845 states and 883 transitions. [2018-01-28 22:02:03,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 22:02:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 883 transitions. [2018-01-28 22:02:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-01-28 22:02:03,067 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:02:03,068 INFO L330 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-28 22:02:03,068 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-28 22:02:03,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1292088299, now seen corresponding path program 1 times [2018-01-28 22:02:03,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:02:03,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:02:03,068 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:02:03,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:02:03,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:02:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:02:03,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:02:03,237 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-28 22:02:03,237 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:02:03,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 22:02:03,237 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 22:02:03,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 22:02:03,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-28 22:02:03,238 INFO L87 Difference]: Start difference. First operand 845 states and 883 transitions. Second operand 9 states. [2018-01-28 22:02:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:02:03,586 INFO L93 Difference]: Finished difference Result 892 states and 944 transitions. [2018-01-28 22:02:03,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 22:02:03,587 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 300 [2018-01-28 22:02:03,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:02:03,588 INFO L225 Difference]: With dead ends: 892 [2018-01-28 22:02:03,588 INFO L226 Difference]: Without dead ends: 891 [2018-01-28 22:02:03,589 INFO L533 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-28 22:02:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2018-01-28 22:02:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 878. [2018-01-28 22:02:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 878 states. [2018-01-28 22:02:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 922 transitions. [2018-01-28 22:02:03,644 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 922 transitions. Word has length 300 [2018-01-28 22:02:03,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:02:03,645 INFO L432 AbstractCegarLoop]: Abstraction has 878 states and 922 transitions. [2018-01-28 22:02:03,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 22:02:03,645 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 922 transitions. [2018-01-28 22:02:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-01-28 22:02:03,647 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:02:03,647 INFO L330 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-28 22:02:03,647 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-28 22:02:03,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1292088298, now seen corresponding path program 1 times [2018-01-28 22:02:03,648 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:02:03,648 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:02:03,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:02:03,649 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:02:03,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:02:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:02:03,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:02:04,485 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-28 22:02:04,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 22:02:04,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-01-28 22:02:04,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-28 22:02:04,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-28 22:02:04,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2018-01-28 22:02:04,486 INFO L87 Difference]: Start difference. First operand 878 states and 922 transitions. Second operand 24 states. [2018-01-28 22:02:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:02:05,682 INFO L93 Difference]: Finished difference Result 961 states and 1014 transitions. [2018-01-28 22:02:05,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-28 22:02:05,682 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 300 [2018-01-28 22:02:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:02:05,684 INFO L225 Difference]: With dead ends: 961 [2018-01-28 22:02:05,684 INFO L226 Difference]: Without dead ends: 959 [2018-01-28 22:02:05,684 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=2203, Unknown=0, NotChecked=0, Total=2450 [2018-01-28 22:02:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2018-01-28 22:02:05,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 933. [2018-01-28 22:02:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-01-28 22:02:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 985 transitions. [2018-01-28 22:02:05,740 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 985 transitions. Word has length 300 [2018-01-28 22:02:05,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:02:05,740 INFO L432 AbstractCegarLoop]: Abstraction has 933 states and 985 transitions. [2018-01-28 22:02:05,740 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-28 22:02:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 985 transitions. [2018-01-28 22:02:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-01-28 22:02:05,741 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:02:05,742 INFO L330 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-28 22:02:05,742 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-28 22:02:05,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1278083151, now seen corresponding path program 1 times [2018-01-28 22:02:05,742 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:02:05,742 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:02:05,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:02:05,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:02:05,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:02:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:02:05,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:02:06,552 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-28 22:02:06,553 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:02:06,553 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-28 22:02:06,559 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:02:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:02:06,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:02:06,666 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-28 22:02:06,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:06,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:06,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 22:02:06,838 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-28 22:02:06,840 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-28 22:02:06,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:06,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:06,847 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-28 22:02:06,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-01-28 22:02:06,886 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-28 22:02:06,888 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-28 22:02:06,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:06,909 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-28 22:02:06,909 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-28 22:02:06,922 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-28 22:02:06,935 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-28 22:02:06,937 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-28 22:02:06,937 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:06,938 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:06,949 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-28 22:02:06,949 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:37, output treesize:57 [2018-01-28 22:02:06,989 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-28 22:02:06,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:06,995 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:02:06,996 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:02:06,996 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-28 22:02:06,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:07,000 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-28 22:02:07,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:29 [2018-01-28 22:02:07,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:02:07,160 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:02:07,161 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:02:07,162 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-28 22:02:07,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:07,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:07,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:67 [2018-01-28 22:02:07,309 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-28 22:02:07,312 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-28 22:02:07,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:07,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:07,362 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-28 22:02:07,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-01-28 22:02:07,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:07,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:07,397 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-28 22:02:07,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:98, output treesize:90 [2018-01-28 22:02:07,453 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-28 22:02:07,455 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-28 22:02:07,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:07,467 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-28 22:02:07,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:07,478 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-28 22:02:07,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:07,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:07,494 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-28 22:02:07,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:108, output treesize:78 [2018-01-28 22:02:07,553 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-28 22:02:07,555 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-28 22:02:07,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:07,577 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-28 22:02:07,577 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:07,593 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-28 22:02:07,594 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:07,611 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-28 22:02:07,611 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-28 22:02:07,626 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-28 22:02:07,626 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-28 22:02:07,639 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-28 22:02:07,653 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-28 22:02:07,654 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:82, output treesize:49 [2018-01-28 22:02:07,902 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-28 22:02:07,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:02:07,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 45 [2018-01-28 22:02:07,923 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-28 22:02:07,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-28 22:02:07,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1943, Unknown=1, NotChecked=0, Total=2070 [2018-01-28 22:02:07,924 INFO L87 Difference]: Start difference. First operand 933 states and 985 transitions. Second operand 46 states. [2018-01-28 22:02:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:02:12,171 INFO L93 Difference]: Finished difference Result 1726 states and 1828 transitions. [2018-01-28 22:02:12,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-01-28 22:02:12,171 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 302 [2018-01-28 22:02:12,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:02:12,174 INFO L225 Difference]: With dead ends: 1726 [2018-01-28 22:02:12,174 INFO L226 Difference]: Without dead ends: 1724 [2018-01-28 22:02:12,175 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3592 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=932, Invalid=11276, Unknown=2, NotChecked=0, Total=12210 [2018-01-28 22:02:12,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2018-01-28 22:02:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1268. [2018-01-28 22:02:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2018-01-28 22:02:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 1344 transitions. [2018-01-28 22:02:12,274 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 1344 transitions. Word has length 302 [2018-01-28 22:02:12,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:02:12,274 INFO L432 AbstractCegarLoop]: Abstraction has 1268 states and 1344 transitions. [2018-01-28 22:02:12,274 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-28 22:02:12,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 1344 transitions. [2018-01-28 22:02:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-01-28 22:02:12,275 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:02:12,276 INFO L330 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-28 22:02:12,276 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-28 22:02:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1278083152, now seen corresponding path program 1 times [2018-01-28 22:02:12,276 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:02:12,276 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:02:12,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:02:12,277 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:02:12,277 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:02:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:02:12,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 22:02:13,846 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-28 22:02:13,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 22:02:13,847 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-28 22:02:13,851 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:02:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:02:13,941 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 22:02:13,945 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-28 22:02:13,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:13,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:13,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 22:02:14,168 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-28 22:02:14,169 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-28 22:02:14,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:14,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:14,180 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-28 22:02:14,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-28 22:02:14,182 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:14,183 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:14,190 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-28 22:02:14,191 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:37 [2018-01-28 22:02:14,242 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-28 22:02:14,244 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-28 22:02:14,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:14,266 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-28 22:02:14,267 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-28 22:02:14,281 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-28 22:02:14,309 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-28 22:02:14,317 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-28 22:02:14,317 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-28 22:02:14,333 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-28 22:02:14,333 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:14,343 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 22:02:14,364 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-28 22:02:14,365 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:53, output treesize:201 [2018-01-28 22:02:14,445 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:02:14,446 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:02:14,446 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-28 22:02:14,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:14,463 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-28 22:02:14,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:110, output treesize:61 [2018-01-28 22:02:14,689 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:02:14,690 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:02:14,691 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:02:14,692 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-28 22:02:14,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:14,703 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 22:02:14,703 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-28 22:02:14,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:14,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:14,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:57 [2018-01-28 22:02:14,875 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-28 22:02:14,878 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-28 22:02:14,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:14,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:14,930 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-28 22:02:14,932 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-28 22:02:14,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:14,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:14,968 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-28 22:02:14,968 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:88, output treesize:82 [2018-01-28 22:02:15,097 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-28 22:02:15,099 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-28 22:02:15,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:15,121 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-28 22:02:15,121 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:15,140 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-28 22:02:15,140 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-28 22:02:15,158 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-28 22:02:15,158 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:15,176 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 59 treesize of output 41 [2018-01-28 22:02:15,177 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-28 22:02:15,191 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-28 22:02:15,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2018-01-28 22:02:15,217 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-01-28 22:02:15,217 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 22:02:15,234 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 24 treesize of output 17 [2018-01-28 22:02:15,234 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:15,253 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:15,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-01-28 22:02:15,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-01-28 22:02:15,258 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:15,265 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-28 22:02:15,265 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-28 22:02:15,275 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 22:02:15,287 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-28 22:02:15,287 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:120, output treesize:14 [2018-01-28 22:02:15,579 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-28 22:02:15,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 22:02:15,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 52 [2018-01-28 22:02:15,600 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-28 22:02:15,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-28 22:02:15,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2613, Unknown=0, NotChecked=0, Total=2756 [2018-01-28 22:02:15,600 INFO L87 Difference]: Start difference. First operand 1268 states and 1344 transitions. Second operand 53 states. [2018-01-28 22:02:16,544 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 75 DAG size of output 72 [2018-01-28 22:02:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 22:02:20,720 INFO L93 Difference]: Finished difference Result 1748 states and 1860 transitions. [2018-01-28 22:02:20,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-01-28 22:02:20,720 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 302 [2018-01-28 22:02:20,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 22:02:20,723 INFO L225 Difference]: With dead ends: 1748 [2018-01-28 22:02:20,723 INFO L226 Difference]: Without dead ends: 1746 [2018-01-28 22:02:20,724 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 280 SyntacticMatches, 5 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3641 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=877, Invalid=11779, Unknown=0, NotChecked=0, Total=12656 [2018-01-28 22:02:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2018-01-28 22:02:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1590. [2018-01-28 22:02:20,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1590 states. [2018-01-28 22:02:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 1681 transitions. [2018-01-28 22:02:20,863 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 1681 transitions. Word has length 302 [2018-01-28 22:02:20,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 22:02:20,863 INFO L432 AbstractCegarLoop]: Abstraction has 1590 states and 1681 transitions. [2018-01-28 22:02:20,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-28 22:02:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 1681 transitions. [2018-01-28 22:02:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-01-28 22:02:20,865 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 22:02:20,865 INFO L330 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, 1] [2018-01-28 22:02:20,865 INFO L371 AbstractCegarLoop]: === Iteration 64 === [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-28 22:02:20,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1400031353, now seen corresponding path program 1 times [2018-01-28 22:02:20,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 22:02:20,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 22:02:20,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:02:20,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 22:02:20,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 22:02:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 22:02:21,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-28 22:02:22,564 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackTraceAbstractionRefinementStrategy.getTraceCheck(MultiTrackTraceAbstractionRefinementStrategy.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-28 22:02:22,569 INFO L168 Benchmark]: Toolchain (without parser) took 97181.33 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 264.7 MB in the beginning and 352.6 MB in the end (delta: -87.9 MB). Peak memory consumption was 1.9 GB. Max. memory is 5.3 GB. [2018-01-28 22:02:22,570 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 305.7 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 22:02:22,570 INFO L168 Benchmark]: CACSL2BoogieTranslator took 231.40 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 252.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:02:22,571 INFO L168 Benchmark]: Boogie Preprocessor took 45.41 ms. Allocated memory is still 305.7 MB. Free memory was 252.7 MB in the beginning and 250.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 22:02:22,571 INFO L168 Benchmark]: RCFGBuilder took 772.31 ms. Allocated memory is still 305.7 MB. Free memory was 250.8 MB in the beginning and 195.8 MB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 5.3 GB. [2018-01-28 22:02:22,572 INFO L168 Benchmark]: TraceAbstraction took 96123.76 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 195.8 MB in the beginning and 352.6 MB in the end (delta: -156.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-01-28 22:02:22,574 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.13 ms. Allocated memory is still 305.7 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 231.40 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 252.7 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.41 ms. Allocated memory is still 305.7 MB. Free memory was 252.7 MB in the beginning and 250.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 772.31 ms. Allocated memory is still 305.7 MB. Free memory was 250.8 MB in the beginning and 195.8 MB in the end (delta: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 96123.76 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 195.8 MB in the beginning and 352.6 MB in the end (delta: -156.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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-28_22-02-22-582.csv Completed graceful shutdown