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 --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 16:25:32,558 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 16:25:32,559 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 16:25:32,569 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 16:25:32,569 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 16:25:32,569 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 16:25:32,570 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 16:25:32,572 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 16:25:32,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 16:25:32,574 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 16:25:32,575 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 16:25:32,575 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 16:25:32,575 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 16:25:32,576 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 16:25:32,577 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 16:25:32,578 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 16:25:32,580 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 16:25:32,581 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 16:25:32,582 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 16:25:32,583 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 16:25:32,584 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 16:25:32,584 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 16:25:32,585 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 16:25:32,585 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 16:25:32,586 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 16:25:32,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 16:25:32,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 16:25:32,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 16:25:32,588 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 16:25:32,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 16:25:32,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 16:25:32,589 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 16:25:32,609 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 16:25:32,609 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 16:25:32,610 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 16:25:32,610 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 16:25:32,610 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 16:25:32,610 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 16:25:32,611 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 16:25:32,611 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 16:25:32,611 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 16:25:32,611 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 16:25:32,611 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 16:25:32,611 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 16:25:32,611 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 16:25:32,612 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 16:25:32,612 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 16:25:32,612 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 16:25:32,612 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 16:25:32,612 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 16:25:32,612 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 16:25:32,612 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 16:25:32,613 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 16:25:32,613 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 16:25:32,613 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 16:25:32,613 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 16:25:32,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 16:25:32,650 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 16:25:32,653 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 16:25:32,654 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 16:25:32,655 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 16:25:32,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-11 16:25:32,938 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG80ecbc12e [2018-04-11 16:25:33,046 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 16:25:33,046 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 16:25:33,046 INFO L168 CDTParser]: Scanning ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-11 16:25:33,047 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 16:25:33,047 INFO L215 ultiparseSymbolTable]: [2018-04-11 16:25:33,047 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 16:25:33,048 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo ('foo') in ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-11 16:25:33,048 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-11 16:25:33,048 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 16:25:33,048 INFO L233 ultiparseSymbolTable]: [2018-04-11 16:25:33,059 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG80ecbc12e [2018-04-11 16:25:33,062 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 16:25:33,063 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 16:25:33,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 16:25:33,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 16:25:33,069 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 16:25:33,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 04:25:33" (1/1) ... [2018-04-11 16:25:33,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71250ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:25:33, skipping insertion in model container [2018-04-11 16:25:33,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 04:25:33" (1/1) ... [2018-04-11 16:25:33,082 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 16:25:33,090 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 16:25:33,184 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 16:25:33,206 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 16:25:33,210 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-11 16:25:33,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:25:33 WrapperNode [2018-04-11 16:25:33,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 16:25:33,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 16:25:33,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 16:25:33,217 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 16:25:33,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:25:33" (1/1) ... [2018-04-11 16:25:33,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:25:33" (1/1) ... [2018-04-11 16:25:33,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:25:33" (1/1) ... [2018-04-11 16:25:33,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:25:33" (1/1) ... [2018-04-11 16:25:33,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:25:33" (1/1) ... [2018-04-11 16:25:33,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:25:33" (1/1) ... [2018-04-11 16:25:33,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:25:33" (1/1) ... [2018-04-11 16:25:33,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 16:25:33,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 16:25:33,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 16:25:33,242 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 16:25:33,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:25:33" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 16:25:33,280 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 16:25:33,280 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 16:25:33,280 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo [2018-04-11 16:25:33,280 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 16:25:33,280 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__foo [2018-04-11 16:25:33,280 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 16:25:33,281 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 16:25:33,281 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 16:25:33,281 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 16:25:33,281 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 16:25:33,281 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 16:25:33,281 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 16:25:33,281 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 16:25:33,465 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 16:25:33,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 04:25:33 BoogieIcfgContainer [2018-04-11 16:25:33,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 16:25:33,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 16:25:33,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 16:25:33,468 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 16:25:33,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 04:25:33" (1/3) ... [2018-04-11 16:25:33,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13103400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 04:25:33, skipping insertion in model container [2018-04-11 16:25:33,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 04:25:33" (2/3) ... [2018-04-11 16:25:33,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13103400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 04:25:33, skipping insertion in model container [2018-04-11 16:25:33,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 04:25:33" (3/3) ... [2018-04-11 16:25:33,470 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-write.c [2018-04-11 16:25:33,478 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 16:25:33,483 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-11 16:25:33,514 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 16:25:33,515 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 16:25:33,515 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 16:25:33,515 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 16:25:33,515 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 16:25:33,515 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 16:25:33,516 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 16:25:33,516 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 16:25:33,516 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 16:25:33,516 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 16:25:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-04-11 16:25:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 16:25:33,531 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:33,532 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:33,532 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:33,534 INFO L82 PathProgramCache]: Analyzing trace with hash -895474378, now seen corresponding path program 1 times [2018-04-11 16:25:33,535 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:33,536 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:33,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:33,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:33,564 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:33,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:25:33,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:25:33,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 16:25:33,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 16:25:33,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 16:25:33,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 16:25:33,662 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-04-11 16:25:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:33,710 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-04-11 16:25:33,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 16:25:33,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-11 16:25:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:33,719 INFO L225 Difference]: With dead ends: 63 [2018-04-11 16:25:33,720 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 16:25:33,721 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 16:25:33,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 16:25:33,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-04-11 16:25:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-11 16:25:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-04-11 16:25:33,749 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-04-11 16:25:33,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:33,749 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-04-11 16:25:33,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 16:25:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-04-11 16:25:33,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 16:25:33,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:33,750 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:33,750 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:33,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1597342241, now seen corresponding path program 1 times [2018-04-11 16:25:33,750 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:33,751 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:33,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:33,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:33,752 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:33,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:25:33,800 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:25:33,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 16:25:33,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 16:25:33,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 16:25:33,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 16:25:33,802 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-04-11 16:25:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:33,837 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-04-11 16:25:33,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 16:25:33,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-11 16:25:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:33,839 INFO L225 Difference]: With dead ends: 60 [2018-04-11 16:25:33,839 INFO L226 Difference]: Without dead ends: 60 [2018-04-11 16:25:33,840 INFO L567 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-04-11 16:25:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-11 16:25:33,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-04-11 16:25:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 16:25:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-04-11 16:25:33,845 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-04-11 16:25:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:33,846 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-04-11 16:25:33,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 16:25:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-04-11 16:25:33,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 16:25:33,846 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:33,846 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:33,847 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:33,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2021997981, now seen corresponding path program 1 times [2018-04-11 16:25:33,847 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:33,847 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:33,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:33,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:33,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:33,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:25:33,902 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:25:33,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:25:33,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:25:33,903 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:25:33,903 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:25:33,903 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 5 states. [2018-04-11 16:25:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:33,946 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-04-11 16:25:33,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:25:33,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-11 16:25:33,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:33,947 INFO L225 Difference]: With dead ends: 51 [2018-04-11 16:25:33,947 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 16:25:33,947 INFO L567 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-04-11 16:25:33,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 16:25:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-11 16:25:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 16:25:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-04-11 16:25:33,950 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 17 [2018-04-11 16:25:33,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:33,950 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-04-11 16:25:33,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:25:33,950 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-04-11 16:25:33,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-11 16:25:33,951 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:33,951 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:33,951 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:33,951 INFO L82 PathProgramCache]: Analyzing trace with hash -2021997980, now seen corresponding path program 1 times [2018-04-11 16:25:33,951 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:33,951 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:33,952 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:33,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:33,952 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:33,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:25:34,025 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:25:34,026 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 16:25:34,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 16:25:34,026 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 16:25:34,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:25:34,026 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-04-11 16:25:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:34,094 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-04-11 16:25:34,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 16:25:34,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-04-11 16:25:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:34,095 INFO L225 Difference]: With dead ends: 53 [2018-04-11 16:25:34,095 INFO L226 Difference]: Without dead ends: 53 [2018-04-11 16:25:34,095 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-11 16:25:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-04-11 16:25:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-04-11 16:25:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 16:25:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-04-11 16:25:34,098 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-04-11 16:25:34,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:34,099 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-04-11 16:25:34,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 16:25:34,099 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-04-11 16:25:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 16:25:34,099 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:34,099 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:34,099 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:34,099 INFO L82 PathProgramCache]: Analyzing trace with hash -869005287, now seen corresponding path program 1 times [2018-04-11 16:25:34,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:34,099 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:34,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:34,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:34,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:34,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:25:34,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:34,150 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:34,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:34,174 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:25:34,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:34,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-04-11 16:25:34,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 16:25:34,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 16:25:34,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:25:34,188 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 4 states. [2018-04-11 16:25:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:34,211 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-04-11 16:25:34,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 16:25:34,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-04-11 16:25:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:34,213 INFO L225 Difference]: With dead ends: 65 [2018-04-11 16:25:34,213 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 16:25:34,213 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 16:25:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 16:25:34,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-04-11 16:25:34,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 16:25:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-04-11 16:25:34,216 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 22 [2018-04-11 16:25:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:34,217 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-04-11 16:25:34,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 16:25:34,217 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-04-11 16:25:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 16:25:34,217 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:34,217 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:34,217 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash -994035242, now seen corresponding path program 1 times [2018-04-11 16:25:34,217 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:34,217 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:34,218 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:34,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:34,218 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:34,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:25:34,252 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:25:34,252 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 16:25:34,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:25:34,252 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:25:34,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:25:34,253 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 5 states. [2018-04-11 16:25:34,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:34,286 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-04-11 16:25:34,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:25:34,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-11 16:25:34,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:34,287 INFO L225 Difference]: With dead ends: 66 [2018-04-11 16:25:34,287 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 16:25:34,288 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:25:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 16:25:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2018-04-11 16:25:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 16:25:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-04-11 16:25:34,291 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 23 [2018-04-11 16:25:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:34,292 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-04-11 16:25:34,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:25:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-04-11 16:25:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 16:25:34,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:34,293 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:34,293 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:34,293 INFO L82 PathProgramCache]: Analyzing trace with hash -561761263, now seen corresponding path program 2 times [2018-04-11 16:25:34,293 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:34,293 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:34,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:34,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:34,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:34,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:34,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:25:34,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:34,373 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:34,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:25:34,390 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:25:34,390 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:34,392 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:25:34,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 16:25:34,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 12 [2018-04-11 16:25:34,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 16:25:34,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 16:25:34,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-11 16:25:34,464 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 12 states. [2018-04-11 16:25:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:34,587 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2018-04-11 16:25:34,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 16:25:34,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-04-11 16:25:34,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:34,588 INFO L225 Difference]: With dead ends: 88 [2018-04-11 16:25:34,588 INFO L226 Difference]: Without dead ends: 88 [2018-04-11 16:25:34,589 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-04-11 16:25:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-04-11 16:25:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2018-04-11 16:25:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-11 16:25:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-04-11 16:25:34,592 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 28 [2018-04-11 16:25:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:34,592 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-04-11 16:25:34,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 16:25:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-04-11 16:25:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 16:25:34,593 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:34,593 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:34,593 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:34,593 INFO L82 PathProgramCache]: Analyzing trace with hash 701046357, now seen corresponding path program 1 times [2018-04-11 16:25:34,593 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:34,593 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:34,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:34,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:34,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:34,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:25:34,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:34,619 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:34,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:34,632 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 16:25:34,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:34,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-04-11 16:25:34,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 16:25:34,644 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 16:25:34,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:25:34,644 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 5 states. [2018-04-11 16:25:34,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:34,680 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-04-11 16:25:34,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 16:25:34,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-11 16:25:34,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:34,681 INFO L225 Difference]: With dead ends: 98 [2018-04-11 16:25:34,681 INFO L226 Difference]: Without dead ends: 98 [2018-04-11 16:25:34,681 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-11 16:25:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-11 16:25:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2018-04-11 16:25:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-11 16:25:34,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2018-04-11 16:25:34,686 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 31 [2018-04-11 16:25:34,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:34,687 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2018-04-11 16:25:34,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 16:25:34,687 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2018-04-11 16:25:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 16:25:34,688 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:34,688 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:34,688 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:34,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1455688847, now seen corresponding path program 1 times [2018-04-11 16:25:34,688 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:34,688 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:34,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:34,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:34,689 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:34,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 16:25:34,734 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 16:25:34,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 16:25:34,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 16:25:34,734 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 16:25:34,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 16:25:34,735 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 6 states. [2018-04-11 16:25:34,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:34,805 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2018-04-11 16:25:34,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 16:25:34,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-04-11 16:25:34,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:34,806 INFO L225 Difference]: With dead ends: 87 [2018-04-11 16:25:34,806 INFO L226 Difference]: Without dead ends: 81 [2018-04-11 16:25:34,806 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 16:25:34,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-11 16:25:34,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-04-11 16:25:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-11 16:25:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2018-04-11 16:25:34,811 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 40 [2018-04-11 16:25:34,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:34,811 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2018-04-11 16:25:34,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 16:25:34,811 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2018-04-11 16:25:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 16:25:34,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:34,812 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:34,812 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:34,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1559883415, now seen corresponding path program 2 times [2018-04-11 16:25:34,813 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:34,813 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:34,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:34,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:34,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:34,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 16:25:34,872 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:34,872 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:34,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:25:34,889 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:25:34,890 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:34,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 16:25:34,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:34,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-04-11 16:25:34,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 16:25:34,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 16:25:34,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 16:25:34,921 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 8 states. [2018-04-11 16:25:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:34,998 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-04-11 16:25:34,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 16:25:34,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-04-11 16:25:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:35,000 INFO L225 Difference]: With dead ends: 90 [2018-04-11 16:25:35,000 INFO L226 Difference]: Without dead ends: 84 [2018-04-11 16:25:35,000 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-04-11 16:25:35,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-11 16:25:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-04-11 16:25:35,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-11 16:25:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-04-11 16:25:35,004 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 46 [2018-04-11 16:25:35,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:35,005 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-04-11 16:25:35,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 16:25:35,005 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-04-11 16:25:35,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 16:25:35,005 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:35,005 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:35,006 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:35,006 INFO L82 PathProgramCache]: Analyzing trace with hash -250620575, now seen corresponding path program 3 times [2018-04-11 16:25:35,006 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:35,006 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:35,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:35,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:35,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:35,021 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-11 16:25:35,071 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:35,071 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:35,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:25:35,083 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-04-11 16:25:35,083 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:35,085 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 37 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 16:25:35,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:35,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 11 [2018-04-11 16:25:35,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 16:25:35,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 16:25:35,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-04-11 16:25:35,161 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 12 states. [2018-04-11 16:25:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:35,360 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-04-11 16:25:35,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 16:25:35,360 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-04-11 16:25:35,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:35,361 INFO L225 Difference]: With dead ends: 150 [2018-04-11 16:25:35,361 INFO L226 Difference]: Without dead ends: 150 [2018-04-11 16:25:35,361 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-04-11 16:25:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-11 16:25:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 113. [2018-04-11 16:25:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-11 16:25:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2018-04-11 16:25:35,366 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 52 [2018-04-11 16:25:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:35,367 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2018-04-11 16:25:35,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 16:25:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2018-04-11 16:25:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 16:25:35,368 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:35,368 INFO L355 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 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] [2018-04-11 16:25:35,368 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:35,368 INFO L82 PathProgramCache]: Analyzing trace with hash 404087573, now seen corresponding path program 1 times [2018-04-11 16:25:35,369 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:35,369 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:35,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:35,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:35,370 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:35,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 43 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-04-11 16:25:35,446 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:35,446 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:35,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:35,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:35,494 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-04-11 16:25:35,494 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:35,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-04-11 16:25:35,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 16:25:35,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 16:25:35,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-04-11 16:25:35,496 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 11 states. [2018-04-11 16:25:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:35,595 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2018-04-11 16:25:35,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 16:25:35,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-04-11 16:25:35,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:35,596 INFO L225 Difference]: With dead ends: 133 [2018-04-11 16:25:35,596 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 16:25:35,597 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-04-11 16:25:35,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 16:25:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 92. [2018-04-11 16:25:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-11 16:25:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-04-11 16:25:35,602 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 67 [2018-04-11 16:25:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:35,602 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-04-11 16:25:35,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 16:25:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-04-11 16:25:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-11 16:25:35,603 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:35,603 INFO L355 BasicCegarLoop]: trace histogram [11, 9, 8, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:35,604 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:35,604 INFO L82 PathProgramCache]: Analyzing trace with hash 784130209, now seen corresponding path program 4 times [2018-04-11 16:25:35,604 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:35,604 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:35,604 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:35,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:35,605 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:35,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 181 proven. 10 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-04-11 16:25:35,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:35,683 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:35,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:25:35,696 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:25:35,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:35,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 178 proven. 14 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-04-11 16:25:35,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:35,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2018-04-11 16:25:35,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 16:25:35,809 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 16:25:35,809 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-04-11 16:25:35,809 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 17 states. [2018-04-11 16:25:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:36,045 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-04-11 16:25:36,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 16:25:36,045 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-04-11 16:25:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:36,046 INFO L225 Difference]: With dead ends: 157 [2018-04-11 16:25:36,046 INFO L226 Difference]: Without dead ends: 148 [2018-04-11 16:25:36,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2018-04-11 16:25:36,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-11 16:25:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2018-04-11 16:25:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-11 16:25:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-04-11 16:25:36,051 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 88 [2018-04-11 16:25:36,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:36,052 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-04-11 16:25:36,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 16:25:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-04-11 16:25:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-11 16:25:36,053 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:36,053 INFO L355 BasicCegarLoop]: trace histogram [16, 13, 12, 12, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:36,053 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:36,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1650581535, now seen corresponding path program 5 times [2018-04-11 16:25:36,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:36,054 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:36,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:36,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:36,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:36,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-04-11 16:25:36,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:36,169 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:36,170 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 16:25:36,208 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-04-11 16:25:36,209 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:36,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 401 proven. 24 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-04-11 16:25:36,280 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:36,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-04-11 16:25:36,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 16:25:36,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 16:25:36,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-04-11 16:25:36,281 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 14 states. [2018-04-11 16:25:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:36,378 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-04-11 16:25:36,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 16:25:36,378 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 124 [2018-04-11 16:25:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:36,379 INFO L225 Difference]: With dead ends: 152 [2018-04-11 16:25:36,379 INFO L226 Difference]: Without dead ends: 146 [2018-04-11 16:25:36,379 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-04-11 16:25:36,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-11 16:25:36,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 140. [2018-04-11 16:25:36,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-11 16:25:36,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-04-11 16:25:36,383 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 124 [2018-04-11 16:25:36,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:36,383 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-04-11 16:25:36,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 16:25:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-04-11 16:25:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-04-11 16:25:36,384 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:36,385 INFO L355 BasicCegarLoop]: trace histogram [17, 14, 13, 13, 13, 13, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:36,385 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:36,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1018374617, now seen corresponding path program 6 times [2018-04-11 16:25:36,385 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:36,385 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:36,386 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:36,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:36,386 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:36,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 273 proven. 48 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2018-04-11 16:25:36,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:36,474 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:36,475 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 16:25:36,509 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-04-11 16:25:36,509 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:36,514 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 276 proven. 48 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-04-11 16:25:36,653 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:36,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 16 [2018-04-11 16:25:36,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 16:25:36,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 16:25:36,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-04-11 16:25:36,654 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 17 states. [2018-04-11 16:25:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:37,012 INFO L93 Difference]: Finished difference Result 206 states and 211 transitions. [2018-04-11 16:25:37,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 16:25:37,012 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2018-04-11 16:25:37,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:37,013 INFO L225 Difference]: With dead ends: 206 [2018-04-11 16:25:37,014 INFO L226 Difference]: Without dead ends: 206 [2018-04-11 16:25:37,014 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2018-04-11 16:25:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-04-11 16:25:37,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2018-04-11 16:25:37,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-11 16:25:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 186 transitions. [2018-04-11 16:25:37,019 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 186 transitions. Word has length 130 [2018-04-11 16:25:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:37,019 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 186 transitions. [2018-04-11 16:25:37,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 16:25:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 186 transitions. [2018-04-11 16:25:37,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-04-11 16:25:37,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:37,021 INFO L355 BasicCegarLoop]: trace histogram [23, 19, 18, 18, 18, 18, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:37,021 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:37,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1774140143, now seen corresponding path program 7 times [2018-04-11 16:25:37,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:37,022 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:37,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:37,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:37,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:37,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 806 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-04-11 16:25:37,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:37,157 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:37,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:37,185 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 806 proven. 44 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-04-11 16:25:37,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:37,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-04-11 16:25:37,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 16:25:37,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 16:25:37,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-04-11 16:25:37,280 INFO L87 Difference]: Start difference. First operand 182 states and 186 transitions. Second operand 17 states. [2018-04-11 16:25:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:37,453 INFO L93 Difference]: Finished difference Result 204 states and 207 transitions. [2018-04-11 16:25:37,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 16:25:37,453 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 172 [2018-04-11 16:25:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:37,454 INFO L225 Difference]: With dead ends: 204 [2018-04-11 16:25:37,454 INFO L226 Difference]: Without dead ends: 198 [2018-04-11 16:25:37,454 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-04-11 16:25:37,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-11 16:25:37,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2018-04-11 16:25:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-11 16:25:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 191 transitions. [2018-04-11 16:25:37,457 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 191 transitions. Word has length 172 [2018-04-11 16:25:37,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:37,457 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 191 transitions. [2018-04-11 16:25:37,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 16:25:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 191 transitions. [2018-04-11 16:25:37,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-04-11 16:25:37,458 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:37,458 INFO L355 BasicCegarLoop]: trace histogram [24, 20, 19, 19, 19, 19, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:37,458 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:37,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1375873801, now seen corresponding path program 8 times [2018-04-11 16:25:37,458 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:37,458 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:37,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:37,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:37,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:37,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:37,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 510 proven. 75 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-04-11 16:25:37,548 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:37,548 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:37,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:25:37,575 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:25:37,576 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:37,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 510 proven. 75 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-04-11 16:25:37,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:37,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-04-11 16:25:37,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 16:25:37,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 16:25:37,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-11 16:25:37,622 INFO L87 Difference]: Start difference. First operand 188 states and 191 transitions. Second operand 10 states. [2018-04-11 16:25:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:37,708 INFO L93 Difference]: Finished difference Result 216 states and 221 transitions. [2018-04-11 16:25:37,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 16:25:37,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 178 [2018-04-11 16:25:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:37,709 INFO L225 Difference]: With dead ends: 216 [2018-04-11 16:25:37,710 INFO L226 Difference]: Without dead ends: 216 [2018-04-11 16:25:37,710 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-04-11 16:25:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-11 16:25:37,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 194. [2018-04-11 16:25:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 16:25:37,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 198 transitions. [2018-04-11 16:25:37,715 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 198 transitions. Word has length 178 [2018-04-11 16:25:37,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:37,716 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 198 transitions. [2018-04-11 16:25:37,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 16:25:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 198 transitions. [2018-04-11 16:25:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-11 16:25:37,718 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:37,718 INFO L355 BasicCegarLoop]: trace histogram [25, 21, 20, 20, 20, 20, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:37,718 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:37,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2106090241, now seen corresponding path program 9 times [2018-04-11 16:25:37,718 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:37,719 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:37,719 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:37,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:37,719 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:37,740 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 697 proven. 69 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-04-11 16:25:37,930 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:37,930 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:37,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:25:37,955 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-11 16:25:37,956 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:37,960 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1460 backedges. 633 proven. 58 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2018-04-11 16:25:38,041 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:38,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 20 [2018-04-11 16:25:38,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 16:25:38,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 16:25:38,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-04-11 16:25:38,042 INFO L87 Difference]: Start difference. First operand 194 states and 198 transitions. Second operand 20 states. [2018-04-11 16:25:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:38,286 INFO L93 Difference]: Finished difference Result 250 states and 255 transitions. [2018-04-11 16:25:38,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 16:25:38,287 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 184 [2018-04-11 16:25:38,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:38,288 INFO L225 Difference]: With dead ends: 250 [2018-04-11 16:25:38,288 INFO L226 Difference]: Without dead ends: 250 [2018-04-11 16:25:38,288 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2018-04-11 16:25:38,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-04-11 16:25:38,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-04-11 16:25:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-11 16:25:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 253 transitions. [2018-04-11 16:25:38,292 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 253 transitions. Word has length 184 [2018-04-11 16:25:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:38,293 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 253 transitions. [2018-04-11 16:25:38,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 16:25:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 253 transitions. [2018-04-11 16:25:38,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-04-11 16:25:38,296 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:38,296 INFO L355 BasicCegarLoop]: trace histogram [31, 26, 25, 25, 25, 25, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:38,296 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:38,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1356019769, now seen corresponding path program 10 times [2018-04-11 16:25:38,296 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:38,296 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:38,297 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:38,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:38,297 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:38,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1404 proven. 70 refuted. 0 times theorem prover too weak. 806 trivial. 0 not checked. [2018-04-11 16:25:38,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:38,519 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:38,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:25:38,545 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:25:38,545 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:38,550 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 1256 proven. 274 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2018-04-11 16:25:38,779 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:38,779 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 30 [2018-04-11 16:25:38,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 16:25:38,780 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 16:25:38,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=724, Unknown=0, NotChecked=0, Total=870 [2018-04-11 16:25:38,780 INFO L87 Difference]: Start difference. First operand 248 states and 253 transitions. Second operand 30 states. [2018-04-11 16:25:39,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:39,242 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2018-04-11 16:25:39,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 16:25:39,243 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 226 [2018-04-11 16:25:39,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:39,243 INFO L225 Difference]: With dead ends: 316 [2018-04-11 16:25:39,244 INFO L226 Difference]: Without dead ends: 307 [2018-04-11 16:25:39,244 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=412, Invalid=2240, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 16:25:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-11 16:25:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 248. [2018-04-11 16:25:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-11 16:25:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 251 transitions. [2018-04-11 16:25:39,247 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 251 transitions. Word has length 226 [2018-04-11 16:25:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:39,247 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 251 transitions. [2018-04-11 16:25:39,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 16:25:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 251 transitions. [2018-04-11 16:25:39,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-04-11 16:25:39,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:39,248 INFO L355 BasicCegarLoop]: trace histogram [32, 27, 26, 26, 26, 26, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:39,248 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:39,248 INFO L82 PathProgramCache]: Analyzing trace with hash 901554225, now seen corresponding path program 11 times [2018-04-11 16:25:39,248 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:39,248 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:39,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:39,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:39,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:39,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:39,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 850 proven. 108 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-04-11 16:25:39,354 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:39,354 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:39,355 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 16:25:39,433 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-04-11 16:25:39,434 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:39,455 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:39,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2443 backedges. 1009 proven. 285 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2018-04-11 16:25:39,540 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:39,540 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-11 16:25:39,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 16:25:39,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 16:25:39,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-04-11 16:25:39,541 INFO L87 Difference]: Start difference. First operand 248 states and 251 transitions. Second operand 17 states. [2018-04-11 16:25:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:39,691 INFO L93 Difference]: Finished difference Result 266 states and 270 transitions. [2018-04-11 16:25:39,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 16:25:39,691 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 232 [2018-04-11 16:25:39,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:39,692 INFO L225 Difference]: With dead ends: 266 [2018-04-11 16:25:39,692 INFO L226 Difference]: Without dead ends: 266 [2018-04-11 16:25:39,692 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 223 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-04-11 16:25:39,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-11 16:25:39,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2018-04-11 16:25:39,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-11 16:25:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 258 transitions. [2018-04-11 16:25:39,700 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 258 transitions. Word has length 232 [2018-04-11 16:25:39,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:39,700 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 258 transitions. [2018-04-11 16:25:39,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 16:25:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 258 transitions. [2018-04-11 16:25:39,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-04-11 16:25:39,701 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:39,701 INFO L355 BasicCegarLoop]: trace histogram [33, 28, 27, 27, 27, 27, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:39,701 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:39,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1429186007, now seen corresponding path program 12 times [2018-04-11 16:25:39,701 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:39,701 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:39,702 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:39,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:39,702 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:39,728 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 1112 proven. 100 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2018-04-11 16:25:39,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:39,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:39,959 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 16:25:40,065 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-04-11 16:25:40,065 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:40,072 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 980 proven. 147 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-04-11 16:25:40,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:40,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 27 [2018-04-11 16:25:40,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 16:25:40,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 16:25:40,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2018-04-11 16:25:40,231 INFO L87 Difference]: Start difference. First operand 254 states and 258 transitions. Second operand 27 states. [2018-04-11 16:25:40,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:40,794 INFO L93 Difference]: Finished difference Result 334 states and 340 transitions. [2018-04-11 16:25:40,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 16:25:40,794 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 238 [2018-04-11 16:25:40,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:40,795 INFO L225 Difference]: With dead ends: 334 [2018-04-11 16:25:40,795 INFO L226 Difference]: Without dead ends: 334 [2018-04-11 16:25:40,796 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=487, Invalid=1865, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 16:25:40,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-11 16:25:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 314. [2018-04-11 16:25:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-04-11 16:25:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 320 transitions. [2018-04-11 16:25:40,801 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 320 transitions. Word has length 238 [2018-04-11 16:25:40,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:40,802 INFO L459 AbstractCegarLoop]: Abstraction has 314 states and 320 transitions. [2018-04-11 16:25:40,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 16:25:40,802 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 320 transitions. [2018-04-11 16:25:40,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-04-11 16:25:40,803 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:40,803 INFO L355 BasicCegarLoop]: trace histogram [41, 35, 34, 34, 34, 34, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:40,804 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:40,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1258320047, now seen corresponding path program 13 times [2018-04-11 16:25:40,804 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:40,804 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:40,805 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:40,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:40,805 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:40,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 2399 proven. 102 refuted. 0 times theorem prover too weak. 1597 trivial. 0 not checked. [2018-04-11 16:25:41,098 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:41,098 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:41,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:41,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4098 backedges. 1632 proven. 114 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-04-11 16:25:41,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:41,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 33 [2018-04-11 16:25:41,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 16:25:41,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 16:25:41,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 16:25:41,461 INFO L87 Difference]: Start difference. First operand 314 states and 320 transitions. Second operand 33 states. [2018-04-11 16:25:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:42,263 INFO L93 Difference]: Finished difference Result 394 states and 399 transitions. [2018-04-11 16:25:42,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 16:25:42,265 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 292 [2018-04-11 16:25:42,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:42,267 INFO L225 Difference]: With dead ends: 394 [2018-04-11 16:25:42,267 INFO L226 Difference]: Without dead ends: 385 [2018-04-11 16:25:42,268 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=431, Invalid=2761, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 16:25:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-04-11 16:25:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 374. [2018-04-11 16:25:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-11 16:25:42,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 379 transitions. [2018-04-11 16:25:42,274 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 379 transitions. Word has length 292 [2018-04-11 16:25:42,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:42,274 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 379 transitions. [2018-04-11 16:25:42,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 16:25:42,275 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 379 transitions. [2018-04-11 16:25:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-04-11 16:25:42,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:42,276 INFO L355 BasicCegarLoop]: trace histogram [50, 43, 42, 42, 42, 42, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:42,276 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:42,277 INFO L82 PathProgramCache]: Analyzing trace with hash -604052879, now seen corresponding path program 14 times [2018-04-11 16:25:42,277 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:42,277 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:42,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:42,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:42,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:42,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6181 backedges. 3323 proven. 140 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2018-04-11 16:25:42,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:42,664 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:42,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:25:42,699 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:25:42,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:42,704 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6181 backedges. 3323 proven. 140 refuted. 0 times theorem prover too weak. 2718 trivial. 0 not checked. [2018-04-11 16:25:42,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:42,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-04-11 16:25:42,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 16:25:42,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 16:25:42,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-04-11 16:25:42,936 INFO L87 Difference]: Start difference. First operand 374 states and 379 transitions. Second operand 26 states. [2018-04-11 16:25:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:43,269 INFO L93 Difference]: Finished difference Result 389 states and 392 transitions. [2018-04-11 16:25:43,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 16:25:43,269 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 352 [2018-04-11 16:25:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:43,270 INFO L225 Difference]: With dead ends: 389 [2018-04-11 16:25:43,270 INFO L226 Difference]: Without dead ends: 383 [2018-04-11 16:25:43,270 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=244, Invalid=748, Unknown=0, NotChecked=0, Total=992 [2018-04-11 16:25:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-04-11 16:25:43,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 374. [2018-04-11 16:25:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-11 16:25:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 377 transitions. [2018-04-11 16:25:43,275 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 377 transitions. Word has length 352 [2018-04-11 16:25:43,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:43,275 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 377 transitions. [2018-04-11 16:25:43,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 16:25:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 377 transitions. [2018-04-11 16:25:43,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-04-11 16:25:43,277 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:43,277 INFO L355 BasicCegarLoop]: trace histogram [51, 44, 43, 43, 43, 43, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:43,277 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:43,277 INFO L82 PathProgramCache]: Analyzing trace with hash 608157801, now seen corresponding path program 15 times [2018-04-11 16:25:43,277 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:43,277 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:43,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:43,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:43,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:43,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6450 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2018-04-11 16:25:43,560 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:43,560 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:43,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:25:43,626 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-04-11 16:25:43,627 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:43,637 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6450 backedges. 1911 proven. 192 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2018-04-11 16:25:43,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:43,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-04-11 16:25:43,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 16:25:43,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 16:25:43,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-11 16:25:43,717 INFO L87 Difference]: Start difference. First operand 374 states and 377 transitions. Second operand 11 states. [2018-04-11 16:25:43,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:43,994 INFO L93 Difference]: Finished difference Result 392 states and 396 transitions. [2018-04-11 16:25:43,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 16:25:43,994 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 358 [2018-04-11 16:25:43,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:43,996 INFO L225 Difference]: With dead ends: 392 [2018-04-11 16:25:43,996 INFO L226 Difference]: Without dead ends: 392 [2018-04-11 16:25:43,996 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 357 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-04-11 16:25:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-04-11 16:25:44,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 380. [2018-04-11 16:25:44,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-04-11 16:25:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 384 transitions. [2018-04-11 16:25:44,002 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 384 transitions. Word has length 358 [2018-04-11 16:25:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:44,003 INFO L459 AbstractCegarLoop]: Abstraction has 380 states and 384 transitions. [2018-04-11 16:25:44,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 16:25:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 384 transitions. [2018-04-11 16:25:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-04-11 16:25:44,005 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:44,005 INFO L355 BasicCegarLoop]: trace histogram [52, 45, 44, 44, 44, 44, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:44,005 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash -992448415, now seen corresponding path program 16 times [2018-04-11 16:25:44,005 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:44,005 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:44,006 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:44,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:44,006 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:44,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 2359 proven. 180 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-04-11 16:25:44,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:44,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:44,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:25:44,494 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:25:44,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:44,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:44,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6725 backedges. 3433 proven. 652 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2018-04-11 16:25:44,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:44,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 42 [2018-04-11 16:25:44,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 16:25:44,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 16:25:44,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1421, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 16:25:44,915 INFO L87 Difference]: Start difference. First operand 380 states and 384 transitions. Second operand 42 states. [2018-04-11 16:25:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:45,891 INFO L93 Difference]: Finished difference Result 463 states and 468 transitions. [2018-04-11 16:25:45,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 16:25:45,892 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 364 [2018-04-11 16:25:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:45,893 INFO L225 Difference]: With dead ends: 463 [2018-04-11 16:25:45,893 INFO L226 Difference]: Without dead ends: 463 [2018-04-11 16:25:45,894 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=879, Invalid=3677, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 16:25:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-04-11 16:25:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 452. [2018-04-11 16:25:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-04-11 16:25:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 457 transitions. [2018-04-11 16:25:45,901 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 457 transitions. Word has length 364 [2018-04-11 16:25:45,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:45,901 INFO L459 AbstractCegarLoop]: Abstraction has 452 states and 457 transitions. [2018-04-11 16:25:45,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 16:25:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 457 transitions. [2018-04-11 16:25:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-04-11 16:25:45,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:45,904 INFO L355 BasicCegarLoop]: trace histogram [62, 54, 53, 53, 53, 53, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:45,904 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:45,905 INFO L82 PathProgramCache]: Analyzing trace with hash 64648569, now seen corresponding path program 17 times [2018-04-11 16:25:45,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:45,905 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:45,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:45,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:45,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:45,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 2668 proven. 243 refuted. 0 times theorem prover too weak. 6756 trivial. 0 not checked. [2018-04-11 16:25:46,271 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:46,271 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:46,271 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 16:25:46,499 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2018-04-11 16:25:46,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:46,543 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:46,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9667 backedges. 2696 proven. 1638 refuted. 0 times theorem prover too weak. 5333 trivial. 0 not checked. [2018-04-11 16:25:46,728 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:46,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 25 [2018-04-11 16:25:46,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 16:25:46,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 16:25:46,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-04-11 16:25:46,729 INFO L87 Difference]: Start difference. First operand 452 states and 457 transitions. Second operand 26 states. [2018-04-11 16:25:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:46,873 INFO L93 Difference]: Finished difference Result 470 states and 476 transitions. [2018-04-11 16:25:46,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 16:25:46,874 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 430 [2018-04-11 16:25:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:46,875 INFO L225 Difference]: With dead ends: 470 [2018-04-11 16:25:46,875 INFO L226 Difference]: Without dead ends: 470 [2018-04-11 16:25:46,875 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2018-04-11 16:25:46,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-11 16:25:46,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 458. [2018-04-11 16:25:46,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-11 16:25:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 464 transitions. [2018-04-11 16:25:46,880 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 464 transitions. Word has length 430 [2018-04-11 16:25:46,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:46,880 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 464 transitions. [2018-04-11 16:25:46,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 16:25:46,880 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 464 transitions. [2018-04-11 16:25:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2018-04-11 16:25:46,882 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:46,882 INFO L355 BasicCegarLoop]: trace histogram [63, 55, 54, 54, 54, 54, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:46,882 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:46,882 INFO L82 PathProgramCache]: Analyzing trace with hash 523966833, now seen corresponding path program 18 times [2018-04-11 16:25:46,882 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:46,882 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:46,883 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:46,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:46,883 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:46,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 3227 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-04-11 16:25:47,386 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:47,386 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:47,386 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 16:25:47,484 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-04-11 16:25:47,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:47,505 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10004 backedges. 4033 proven. 1197 refuted. 0 times theorem prover too weak. 4774 trivial. 0 not checked. [2018-04-11 16:25:47,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:47,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19] total 37 [2018-04-11 16:25:47,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 16:25:47,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 16:25:47,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1127, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 16:25:47,929 INFO L87 Difference]: Start difference. First operand 458 states and 464 transitions. Second operand 37 states. [2018-04-11 16:25:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:48,912 INFO L93 Difference]: Finished difference Result 544 states and 552 transitions. [2018-04-11 16:25:48,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-11 16:25:48,912 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 436 [2018-04-11 16:25:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:48,914 INFO L225 Difference]: With dead ends: 544 [2018-04-11 16:25:48,914 INFO L226 Difference]: Without dead ends: 544 [2018-04-11 16:25:48,916 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=866, Invalid=3294, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 16:25:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-04-11 16:25:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 533. [2018-04-11 16:25:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-04-11 16:25:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 541 transitions. [2018-04-11 16:25:48,923 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 541 transitions. Word has length 436 [2018-04-11 16:25:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:48,924 INFO L459 AbstractCegarLoop]: Abstraction has 533 states and 541 transitions. [2018-04-11 16:25:48,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 16:25:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 541 transitions. [2018-04-11 16:25:48,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-04-11 16:25:48,927 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:48,928 INFO L355 BasicCegarLoop]: trace histogram [73, 64, 63, 63, 63, 63, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:48,928 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:48,928 INFO L82 PathProgramCache]: Analyzing trace with hash 282969737, now seen corresponding path program 19 times [2018-04-11 16:25:48,928 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:48,928 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:48,929 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:48,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:48,929 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:48,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 13536 backedges. 6446 proven. 234 refuted. 0 times theorem prover too weak. 6856 trivial. 0 not checked. [2018-04-11 16:25:49,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:49,438 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:49,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:49,475 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 13536 backedges. 6446 proven. 234 refuted. 0 times theorem prover too weak. 6856 trivial. 0 not checked. [2018-04-11 16:25:49,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:49,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-04-11 16:25:49,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 16:25:49,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 16:25:49,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-04-11 16:25:49,684 INFO L87 Difference]: Start difference. First operand 533 states and 541 transitions. Second operand 32 states. [2018-04-11 16:25:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:50,061 INFO L93 Difference]: Finished difference Result 554 states and 558 transitions. [2018-04-11 16:25:50,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 16:25:50,061 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 502 [2018-04-11 16:25:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:50,062 INFO L225 Difference]: With dead ends: 554 [2018-04-11 16:25:50,062 INFO L226 Difference]: Without dead ends: 533 [2018-04-11 16:25:50,063 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=375, Invalid=1185, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 16:25:50,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-04-11 16:25:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 524. [2018-04-11 16:25:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-04-11 16:25:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 527 transitions. [2018-04-11 16:25:50,067 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 527 transitions. Word has length 502 [2018-04-11 16:25:50,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:50,068 INFO L459 AbstractCegarLoop]: Abstraction has 524 states and 527 transitions. [2018-04-11 16:25:50,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 16:25:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 527 transitions. [2018-04-11 16:25:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2018-04-11 16:25:50,070 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:50,070 INFO L355 BasicCegarLoop]: trace histogram [74, 65, 64, 64, 64, 64, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:50,070 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:50,070 INFO L82 PathProgramCache]: Analyzing trace with hash 870003329, now seen corresponding path program 20 times [2018-04-11 16:25:50,070 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:50,070 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:50,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:50,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:25:50,071 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:50,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 13935 backedges. 3600 proven. 300 refuted. 0 times theorem prover too weak. 10035 trivial. 0 not checked. [2018-04-11 16:25:50,438 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:50,438 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:50,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:25:50,489 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:25:50,489 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:50,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:50,645 INFO L134 CoverageAnalysis]: Checked inductivity of 13935 backedges. 3600 proven. 300 refuted. 0 times theorem prover too weak. 10035 trivial. 0 not checked. [2018-04-11 16:25:50,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:50,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-04-11 16:25:50,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 16:25:50,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 16:25:50,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2018-04-11 16:25:50,647 INFO L87 Difference]: Start difference. First operand 524 states and 527 transitions. Second operand 15 states. [2018-04-11 16:25:50,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:50,800 INFO L93 Difference]: Finished difference Result 542 states and 546 transitions. [2018-04-11 16:25:50,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 16:25:50,801 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 508 [2018-04-11 16:25:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:50,803 INFO L225 Difference]: With dead ends: 542 [2018-04-11 16:25:50,803 INFO L226 Difference]: Without dead ends: 542 [2018-04-11 16:25:50,803 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=181, Invalid=371, Unknown=0, NotChecked=0, Total=552 [2018-04-11 16:25:50,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-04-11 16:25:50,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 530. [2018-04-11 16:25:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-04-11 16:25:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 534 transitions. [2018-04-11 16:25:50,810 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 534 transitions. Word has length 508 [2018-04-11 16:25:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:50,810 INFO L459 AbstractCegarLoop]: Abstraction has 530 states and 534 transitions. [2018-04-11 16:25:50,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 16:25:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 534 transitions. [2018-04-11 16:25:50,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-04-11 16:25:50,813 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:50,813 INFO L355 BasicCegarLoop]: trace histogram [75, 66, 65, 65, 65, 65, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:50,814 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:50,814 INFO L82 PathProgramCache]: Analyzing trace with hash -265555847, now seen corresponding path program 21 times [2018-04-11 16:25:50,814 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:50,814 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:50,814 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:50,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:50,815 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:50,848 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 4282 proven. 284 refuted. 0 times theorem prover too weak. 9774 trivial. 0 not checked. [2018-04-11 16:25:51,390 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:51,390 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:51,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:25:51,471 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-04-11 16:25:51,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:51,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14340 backedges. 5125 proven. 1949 refuted. 0 times theorem prover too weak. 7266 trivial. 0 not checked. [2018-04-11 16:25:52,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:52,140 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 53 [2018-04-11 16:25:52,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-11 16:25:52,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-11 16:25:52,141 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=2393, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 16:25:52,141 INFO L87 Difference]: Start difference. First operand 530 states and 534 transitions. Second operand 53 states. [2018-04-11 16:25:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:53,416 INFO L93 Difference]: Finished difference Result 616 states and 621 transitions. [2018-04-11 16:25:53,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 16:25:53,416 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 514 [2018-04-11 16:25:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:53,418 INFO L225 Difference]: With dead ends: 616 [2018-04-11 16:25:53,418 INFO L226 Difference]: Without dead ends: 616 [2018-04-11 16:25:53,420 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1941 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1242, Invalid=6590, Unknown=0, NotChecked=0, Total=7832 [2018-04-11 16:25:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-04-11 16:25:53,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 608. [2018-04-11 16:25:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-04-11 16:25:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 613 transitions. [2018-04-11 16:25:53,424 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 613 transitions. Word has length 514 [2018-04-11 16:25:53,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:53,424 INFO L459 AbstractCegarLoop]: Abstraction has 608 states and 613 transitions. [2018-04-11 16:25:53,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-11 16:25:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 613 transitions. [2018-04-11 16:25:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-04-11 16:25:53,427 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:53,427 INFO L355 BasicCegarLoop]: trace histogram [86, 76, 75, 75, 75, 75, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:53,427 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:53,427 INFO L82 PathProgramCache]: Analyzing trace with hash -579703415, now seen corresponding path program 22 times [2018-04-11 16:25:53,427 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:53,427 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:53,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:53,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:53,428 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:53,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 18985 backedges. 8549 proven. 290 refuted. 0 times theorem prover too weak. 10146 trivial. 0 not checked. [2018-04-11 16:25:54,194 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:54,194 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:54,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:25:54,242 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:25:54,243 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:54,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 18985 backedges. 7956 proven. 994 refuted. 0 times theorem prover too weak. 10035 trivial. 0 not checked. [2018-04-11 16:25:54,715 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:54,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29] total 50 [2018-04-11 16:25:54,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-11 16:25:54,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-11 16:25:54,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=2054, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 16:25:54,717 INFO L87 Difference]: Start difference. First operand 608 states and 613 transitions. Second operand 50 states. [2018-04-11 16:25:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:55,808 INFO L93 Difference]: Finished difference Result 625 states and 628 transitions. [2018-04-11 16:25:55,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-11 16:25:55,808 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 586 [2018-04-11 16:25:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:55,809 INFO L225 Difference]: With dead ends: 625 [2018-04-11 16:25:55,809 INFO L226 Difference]: Without dead ends: 619 [2018-04-11 16:25:55,811 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 561 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2735 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1182, Invalid=7190, Unknown=0, NotChecked=0, Total=8372 [2018-04-11 16:25:55,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-04-11 16:25:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 608. [2018-04-11 16:25:55,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-04-11 16:25:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 611 transitions. [2018-04-11 16:25:55,817 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 611 transitions. Word has length 586 [2018-04-11 16:25:55,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:55,817 INFO L459 AbstractCegarLoop]: Abstraction has 608 states and 611 transitions. [2018-04-11 16:25:55,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-11 16:25:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 611 transitions. [2018-04-11 16:25:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-04-11 16:25:55,820 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:55,820 INFO L355 BasicCegarLoop]: trace histogram [87, 77, 76, 76, 76, 76, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:55,820 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:55,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1818728833, now seen corresponding path program 23 times [2018-04-11 16:25:55,820 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:55,820 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:55,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:55,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:55,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:55,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 19458 backedges. 4725 proven. 363 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-04-11 16:25:56,231 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:56,231 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:56,231 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 16:25:56,817 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2018-04-11 16:25:56,818 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:56,910 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 19458 backedges. 4725 proven. 363 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-04-11 16:25:57,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:57,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-04-11 16:25:57,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 16:25:57,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 16:25:57,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-04-11 16:25:57,165 INFO L87 Difference]: Start difference. First operand 608 states and 611 transitions. Second operand 27 states. [2018-04-11 16:25:57,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:57,431 INFO L93 Difference]: Finished difference Result 626 states and 630 transitions. [2018-04-11 16:25:57,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 16:25:57,432 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 592 [2018-04-11 16:25:57,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:57,433 INFO L225 Difference]: With dead ends: 626 [2018-04-11 16:25:57,433 INFO L226 Difference]: Without dead ends: 626 [2018-04-11 16:25:57,433 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 579 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-04-11 16:25:57,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-04-11 16:25:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 614. [2018-04-11 16:25:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-04-11 16:25:57,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 618 transitions. [2018-04-11 16:25:57,442 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 618 transitions. Word has length 592 [2018-04-11 16:25:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:57,443 INFO L459 AbstractCegarLoop]: Abstraction has 614 states and 618 transitions. [2018-04-11 16:25:57,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 16:25:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 618 transitions. [2018-04-11 16:25:57,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2018-04-11 16:25:57,448 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:57,448 INFO L355 BasicCegarLoop]: trace histogram [88, 78, 77, 77, 77, 77, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:57,448 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:57,448 INFO L82 PathProgramCache]: Analyzing trace with hash 831461241, now seen corresponding path program 24 times [2018-04-11 16:25:57,451 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:57,451 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:57,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:57,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:57,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:57,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:25:58,184 INFO L134 CoverageAnalysis]: Checked inductivity of 19937 backedges. 5542 proven. 345 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-04-11 16:25:58,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:25:58,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:25:58,184 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 16:25:58,318 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-04-11 16:25:58,318 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:25:58,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:25:58,603 INFO L134 CoverageAnalysis]: Checked inductivity of 19937 backedges. 5202 proven. 322 refuted. 0 times theorem prover too weak. 14413 trivial. 0 not checked. [2018-04-11 16:25:58,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:25:58,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17] total 32 [2018-04-11 16:25:58,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 16:25:58,604 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 16:25:58,604 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=781, Unknown=0, NotChecked=0, Total=992 [2018-04-11 16:25:58,604 INFO L87 Difference]: Start difference. First operand 614 states and 618 transitions. Second operand 32 states. [2018-04-11 16:25:59,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:25:59,169 INFO L93 Difference]: Finished difference Result 700 states and 705 transitions. [2018-04-11 16:25:59,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 16:25:59,169 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 598 [2018-04-11 16:25:59,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:25:59,171 INFO L225 Difference]: With dead ends: 700 [2018-04-11 16:25:59,171 INFO L226 Difference]: Without dead ends: 700 [2018-04-11 16:25:59,172 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=743, Invalid=2337, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 16:25:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-04-11 16:25:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 698. [2018-04-11 16:25:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-04-11 16:25:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 703 transitions. [2018-04-11 16:25:59,180 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 703 transitions. Word has length 598 [2018-04-11 16:25:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:25:59,180 INFO L459 AbstractCegarLoop]: Abstraction has 698 states and 703 transitions. [2018-04-11 16:25:59,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 16:25:59,180 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 703 transitions. [2018-04-11 16:25:59,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-04-11 16:25:59,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:25:59,185 INFO L355 BasicCegarLoop]: trace histogram [100, 89, 88, 88, 88, 88, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:25:59,185 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:25:59,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1107841919, now seen corresponding path program 25 times [2018-04-11 16:25:59,186 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:25:59,186 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:25:59,186 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:59,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:25:59,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:25:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:25:59,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 25905 backedges. 11061 proven. 352 refuted. 0 times theorem prover too weak. 14492 trivial. 0 not checked. [2018-04-11 16:26:00,104 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:00,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:00,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:26:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:00,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 25905 backedges. 11061 proven. 352 refuted. 0 times theorem prover too weak. 14492 trivial. 0 not checked. [2018-04-11 16:26:00,594 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:00,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 38 [2018-04-11 16:26:00,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 16:26:00,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 16:26:00,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 16:26:00,596 INFO L87 Difference]: Start difference. First operand 698 states and 703 transitions. Second operand 38 states. [2018-04-11 16:26:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:01,100 INFO L93 Difference]: Finished difference Result 713 states and 716 transitions. [2018-04-11 16:26:01,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 16:26:01,117 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 676 [2018-04-11 16:26:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:01,119 INFO L225 Difference]: With dead ends: 713 [2018-04-11 16:26:01,119 INFO L226 Difference]: Without dead ends: 707 [2018-04-11 16:26:01,120 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 665 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=534, Invalid=1722, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 16:26:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-04-11 16:26:01,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 698. [2018-04-11 16:26:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 698 states. [2018-04-11 16:26:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 701 transitions. [2018-04-11 16:26:01,126 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 701 transitions. Word has length 676 [2018-04-11 16:26:01,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:01,126 INFO L459 AbstractCegarLoop]: Abstraction has 698 states and 701 transitions. [2018-04-11 16:26:01,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 16:26:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 701 transitions. [2018-04-11 16:26:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2018-04-11 16:26:01,131 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:01,131 INFO L355 BasicCegarLoop]: trace histogram [101, 90, 89, 89, 89, 89, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:01,131 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:01,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1344323193, now seen corresponding path program 26 times [2018-04-11 16:26:01,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:01,132 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:01,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:01,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:26:01,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:01,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 26458 backedges. 6061 proven. 432 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-04-11 16:26:01,780 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:01,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:01,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:26:01,835 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:26:01,835 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:26:01,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 26458 backedges. 6061 proven. 432 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-04-11 16:26:01,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:01,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-04-11 16:26:01,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 16:26:01,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 16:26:01,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-04-11 16:26:01,996 INFO L87 Difference]: Start difference. First operand 698 states and 701 transitions. Second operand 17 states. [2018-04-11 16:26:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:02,228 INFO L93 Difference]: Finished difference Result 716 states and 720 transitions. [2018-04-11 16:26:02,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 16:26:02,228 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 682 [2018-04-11 16:26:02,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:02,230 INFO L225 Difference]: With dead ends: 716 [2018-04-11 16:26:02,230 INFO L226 Difference]: Without dead ends: 716 [2018-04-11 16:26:02,230 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 681 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2018-04-11 16:26:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-04-11 16:26:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 704. [2018-04-11 16:26:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2018-04-11 16:26:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 708 transitions. [2018-04-11 16:26:02,236 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 708 transitions. Word has length 682 [2018-04-11 16:26:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:02,237 INFO L459 AbstractCegarLoop]: Abstraction has 704 states and 708 transitions. [2018-04-11 16:26:02,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 16:26:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 708 transitions. [2018-04-11 16:26:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-04-11 16:26:02,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:02,242 INFO L355 BasicCegarLoop]: trace histogram [102, 91, 90, 90, 90, 90, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:02,242 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:02,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1172742769, now seen corresponding path program 27 times [2018-04-11 16:26:02,242 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:02,243 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:02,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:02,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:26:02,243 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:02,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 27017 backedges. 7025 proven. 412 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-04-11 16:26:03,136 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:03,136 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:03,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:26:03,190 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-04-11 16:26:03,190 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:26:03,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 27017 backedges. 6545 proven. 507 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-04-11 16:26:03,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:03,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 16] total 45 [2018-04-11 16:26:03,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 16:26:03,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 16:26:03,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=1657, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 16:26:03,511 INFO L87 Difference]: Start difference. First operand 704 states and 708 transitions. Second operand 45 states. [2018-04-11 16:26:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:04,697 INFO L93 Difference]: Finished difference Result 820 states and 826 transitions. [2018-04-11 16:26:04,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-11 16:26:04,697 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 688 [2018-04-11 16:26:04,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:04,699 INFO L225 Difference]: With dead ends: 820 [2018-04-11 16:26:04,699 INFO L226 Difference]: Without dead ends: 820 [2018-04-11 16:26:04,700 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 674 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1644 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1435, Invalid=5705, Unknown=0, NotChecked=0, Total=7140 [2018-04-11 16:26:04,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2018-04-11 16:26:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 800. [2018-04-11 16:26:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-04-11 16:26:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 806 transitions. [2018-04-11 16:26:04,706 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 806 transitions. Word has length 688 [2018-04-11 16:26:04,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:04,707 INFO L459 AbstractCegarLoop]: Abstraction has 800 states and 806 transitions. [2018-04-11 16:26:04,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 16:26:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 806 transitions. [2018-04-11 16:26:04,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2018-04-11 16:26:04,713 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:04,713 INFO L355 BasicCegarLoop]: trace histogram [116, 104, 103, 103, 103, 103, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:04,714 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:04,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1896000663, now seen corresponding path program 28 times [2018-04-11 16:26:04,714 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:04,714 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:04,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:04,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:26:04,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:04,770 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 14576 proven. 420 refuted. 0 times theorem prover too weak. 20179 trivial. 0 not checked. [2018-04-11 16:26:05,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:05,714 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:05,715 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:26:05,747 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:26:05,747 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:26:05,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 35175 backedges. 13728 proven. 1482 refuted. 0 times theorem prover too weak. 19965 trivial. 0 not checked. [2018-04-11 16:26:06,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:06,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 34] total 59 [2018-04-11 16:26:06,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-11 16:26:06,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-11 16:26:06,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=2875, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 16:26:06,359 INFO L87 Difference]: Start difference. First operand 800 states and 806 transitions. Second operand 59 states. [2018-04-11 16:26:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:07,655 INFO L93 Difference]: Finished difference Result 814 states and 818 transitions. [2018-04-11 16:26:07,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-11 16:26:07,656 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 778 [2018-04-11 16:26:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:07,657 INFO L225 Difference]: With dead ends: 814 [2018-04-11 16:26:07,658 INFO L226 Difference]: Without dead ends: 808 [2018-04-11 16:26:07,659 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 855 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3946 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1618, Invalid=10154, Unknown=0, NotChecked=0, Total=11772 [2018-04-11 16:26:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-04-11 16:26:07,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 800. [2018-04-11 16:26:07,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2018-04-11 16:26:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 804 transitions. [2018-04-11 16:26:07,664 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 804 transitions. Word has length 778 [2018-04-11 16:26:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:07,665 INFO L459 AbstractCegarLoop]: Abstraction has 800 states and 804 transitions. [2018-04-11 16:26:07,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-11 16:26:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 804 transitions. [2018-04-11 16:26:07,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2018-04-11 16:26:07,668 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:07,669 INFO L355 BasicCegarLoop]: trace histogram [117, 105, 104, 104, 104, 104, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:07,669 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:07,669 INFO L82 PathProgramCache]: Analyzing trace with hash 895063905, now seen corresponding path program 29 times [2018-04-11 16:26:07,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:07,669 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:07,669 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:07,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:26:07,669 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:07,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 35820 backedges. 8749 proven. 485 refuted. 0 times theorem prover too weak. 26586 trivial. 0 not checked. [2018-04-11 16:26:08,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:08,748 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:08,748 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 16:26:09,442 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-04-11 16:26:09,442 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:26:09,541 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 35820 backedges. 8627 proven. 2768 refuted. 0 times theorem prover too weak. 24425 trivial. 0 not checked. [2018-04-11 16:26:10,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:10,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 39] total 56 [2018-04-11 16:26:10,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 16:26:10,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 16:26:10,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=2530, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 16:26:10,172 INFO L87 Difference]: Start difference. First operand 800 states and 804 transitions. Second operand 56 states. [2018-04-11 16:26:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:11,352 INFO L93 Difference]: Finished difference Result 898 states and 902 transitions. [2018-04-11 16:26:11,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 16:26:11,352 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 784 [2018-04-11 16:26:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:11,354 INFO L225 Difference]: With dead ends: 898 [2018-04-11 16:26:11,354 INFO L226 Difference]: Without dead ends: 898 [2018-04-11 16:26:11,355 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1443, Invalid=6039, Unknown=0, NotChecked=0, Total=7482 [2018-04-11 16:26:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-04-11 16:26:11,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 890. [2018-04-11 16:26:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-04-11 16:26:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 894 transitions. [2018-04-11 16:26:11,359 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 894 transitions. Word has length 784 [2018-04-11 16:26:11,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:11,360 INFO L459 AbstractCegarLoop]: Abstraction has 890 states and 894 transitions. [2018-04-11 16:26:11,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 16:26:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 894 transitions. [2018-04-11 16:26:11,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2018-04-11 16:26:11,366 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:11,367 INFO L355 BasicCegarLoop]: trace histogram [131, 118, 117, 117, 117, 117, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:11,367 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:11,367 INFO L82 PathProgramCache]: Analyzing trace with hash -165184423, now seen corresponding path program 30 times [2018-04-11 16:26:11,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:11,367 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:11,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:11,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:26:11,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:11,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 17456 proven. 494 refuted. 0 times theorem prover too weak. 27186 trivial. 0 not checked. [2018-04-11 16:26:12,564 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:12,564 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:12,564 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 16:26:12,755 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-04-11 16:26:12,755 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:26:12,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 45136 backedges. 9431 proven. 534 refuted. 0 times theorem prover too weak. 35171 trivial. 0 not checked. [2018-04-11 16:26:13,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:13,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 20] total 49 [2018-04-11 16:26:13,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-11 16:26:13,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-11 16:26:13,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1993, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 16:26:13,240 INFO L87 Difference]: Start difference. First operand 890 states and 894 transitions. Second operand 49 states. [2018-04-11 16:26:14,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:14,861 INFO L93 Difference]: Finished difference Result 1007 states and 1010 transitions. [2018-04-11 16:26:14,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-11 16:26:14,861 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 874 [2018-04-11 16:26:14,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:14,863 INFO L225 Difference]: With dead ends: 1007 [2018-04-11 16:26:14,863 INFO L226 Difference]: Without dead ends: 998 [2018-04-11 16:26:14,864 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4062 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2165, Invalid=11641, Unknown=0, NotChecked=0, Total=13806 [2018-04-11 16:26:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2018-04-11 16:26:14,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 986. [2018-04-11 16:26:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-04-11 16:26:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 989 transitions. [2018-04-11 16:26:14,871 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 989 transitions. Word has length 874 [2018-04-11 16:26:14,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:14,872 INFO L459 AbstractCegarLoop]: Abstraction has 986 states and 989 transitions. [2018-04-11 16:26:14,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-11 16:26:14,872 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 989 transitions. [2018-04-11 16:26:14,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2018-04-11 16:26:14,880 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:14,881 INFO L355 BasicCegarLoop]: trace histogram [147, 133, 132, 132, 132, 132, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:14,881 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:14,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1060225345, now seen corresponding path program 31 times [2018-04-11 16:26:14,881 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:14,881 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:14,882 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:14,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:26:14,882 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:14,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 57158 backedges. 20675 proven. 574 refuted. 0 times theorem prover too weak. 35909 trivial. 0 not checked. [2018-04-11 16:26:16,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:16,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:16,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:26:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:16,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 57158 backedges. 20675 proven. 574 refuted. 0 times theorem prover too weak. 35909 trivial. 0 not checked. [2018-04-11 16:26:17,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:17,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 47 [2018-04-11 16:26:17,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-11 16:26:17,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-11 16:26:17,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 16:26:17,025 INFO L87 Difference]: Start difference. First operand 986 states and 989 transitions. Second operand 47 states. [2018-04-11 16:26:17,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:17,375 INFO L93 Difference]: Finished difference Result 1015 states and 1018 transitions. [2018-04-11 16:26:17,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-11 16:26:17,375 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 976 [2018-04-11 16:26:17,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:17,377 INFO L225 Difference]: With dead ends: 1015 [2018-04-11 16:26:17,377 INFO L226 Difference]: Without dead ends: 1009 [2018-04-11 16:26:17,377 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 962 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=825, Invalid=2715, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 16:26:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-04-11 16:26:17,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 997. [2018-04-11 16:26:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-04-11 16:26:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1000 transitions. [2018-04-11 16:26:17,386 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1000 transitions. Word has length 976 [2018-04-11 16:26:17,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:17,386 INFO L459 AbstractCegarLoop]: Abstraction has 997 states and 1000 transitions. [2018-04-11 16:26:17,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-11 16:26:17,386 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1000 transitions. [2018-04-11 16:26:17,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-04-11 16:26:17,391 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:17,391 INFO L355 BasicCegarLoop]: trace histogram [148, 134, 133, 133, 133, 133, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:17,391 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:17,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1744157895, now seen corresponding path program 32 times [2018-04-11 16:26:17,392 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:17,392 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:17,392 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:17,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:26:17,392 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:17,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 10773 proven. 588 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-04-11 16:26:18,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:18,353 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:18,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:26:18,405 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:26:18,405 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:26:18,413 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 57981 backedges. 10773 proven. 588 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-04-11 16:26:18,652 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:18,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-04-11 16:26:18,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 16:26:18,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 16:26:18,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2018-04-11 16:26:18,653 INFO L87 Difference]: Start difference. First operand 997 states and 1000 transitions. Second operand 19 states. [2018-04-11 16:26:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:18,833 INFO L93 Difference]: Finished difference Result 1008 states and 1011 transitions. [2018-04-11 16:26:18,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 16:26:18,833 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 982 [2018-04-11 16:26:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:18,835 INFO L225 Difference]: With dead ends: 1008 [2018-04-11 16:26:18,835 INFO L226 Difference]: Without dead ends: 1008 [2018-04-11 16:26:18,835 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1011 GetRequests, 981 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=335, Invalid=657, Unknown=0, NotChecked=0, Total=992 [2018-04-11 16:26:18,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2018-04-11 16:26:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 998. [2018-04-11 16:26:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 998 states. [2018-04-11 16:26:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1001 transitions. [2018-04-11 16:26:18,840 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1001 transitions. Word has length 982 [2018-04-11 16:26:18,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:18,840 INFO L459 AbstractCegarLoop]: Abstraction has 998 states and 1001 transitions. [2018-04-11 16:26:18,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 16:26:18,840 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1001 transitions. [2018-04-11 16:26:18,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2018-04-11 16:26:18,845 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:18,845 INFO L355 BasicCegarLoop]: trace histogram [149, 135, 134, 134, 134, 134, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:18,845 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:18,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1639344335, now seen corresponding path program 33 times [2018-04-11 16:26:18,846 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:18,846 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:18,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:18,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:26:18,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:18,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 58810 backedges. 11515 proven. 675 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-04-11 16:26:19,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:19,876 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:19,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:26:19,934 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-11 16:26:19,934 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:26:19,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:20,203 INFO L134 CoverageAnalysis]: Checked inductivity of 58810 backedges. 11515 proven. 675 refuted. 0 times theorem prover too weak. 46620 trivial. 0 not checked. [2018-04-11 16:26:20,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:20,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-04-11 16:26:20,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 16:26:20,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 16:26:20,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=221, Unknown=0, NotChecked=0, Total=380 [2018-04-11 16:26:20,205 INFO L87 Difference]: Start difference. First operand 998 states and 1001 transitions. Second operand 20 states. [2018-04-11 16:26:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:20,443 INFO L93 Difference]: Finished difference Result 1026 states and 1031 transitions. [2018-04-11 16:26:20,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 16:26:20,444 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 988 [2018-04-11 16:26:20,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:20,446 INFO L225 Difference]: With dead ends: 1026 [2018-04-11 16:26:20,446 INFO L226 Difference]: Without dead ends: 1026 [2018-04-11 16:26:20,446 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1019 GetRequests, 987 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=411, Invalid=711, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 16:26:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2018-04-11 16:26:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1004. [2018-04-11 16:26:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2018-04-11 16:26:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1008 transitions. [2018-04-11 16:26:20,452 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1008 transitions. Word has length 988 [2018-04-11 16:26:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:20,452 INFO L459 AbstractCegarLoop]: Abstraction has 1004 states and 1008 transitions. [2018-04-11 16:26:20,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 16:26:20,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1008 transitions. [2018-04-11 16:26:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2018-04-11 16:26:20,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:20,457 INFO L355 BasicCegarLoop]: trace histogram [150, 136, 135, 135, 135, 135, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:20,457 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:20,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1652027095, now seen corresponding path program 34 times [2018-04-11 16:26:20,458 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:20,458 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:20,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:20,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:26:20,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:20,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 59645 backedges. 12992 proven. 649 refuted. 0 times theorem prover too weak. 46004 trivial. 0 not checked. [2018-04-11 16:26:22,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:22,135 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:22,136 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:26:22,185 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:26:22,185 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:26:22,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 59645 backedges. 21640 proven. 2164 refuted. 0 times theorem prover too weak. 35841 trivial. 0 not checked. [2018-04-11 16:26:23,343 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:23,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 39] total 70 [2018-04-11 16:26:23,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-11 16:26:23,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-11 16:26:23,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=805, Invalid=4025, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 16:26:23,345 INFO L87 Difference]: Start difference. First operand 1004 states and 1008 transitions. Second operand 70 states. [2018-04-11 16:26:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:24,914 INFO L93 Difference]: Finished difference Result 1126 states and 1130 transitions. [2018-04-11 16:26:24,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-11 16:26:24,914 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 994 [2018-04-11 16:26:24,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:24,916 INFO L225 Difference]: With dead ends: 1126 [2018-04-11 16:26:24,916 INFO L226 Difference]: Without dead ends: 1126 [2018-04-11 16:26:24,917 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1076 GetRequests, 961 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3090 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2405, Invalid=11167, Unknown=0, NotChecked=0, Total=13572 [2018-04-11 16:26:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2018-04-11 16:26:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1118. [2018-04-11 16:26:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2018-04-11 16:26:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1122 transitions. [2018-04-11 16:26:24,924 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1122 transitions. Word has length 994 [2018-04-11 16:26:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:24,924 INFO L459 AbstractCegarLoop]: Abstraction has 1118 states and 1122 transitions. [2018-04-11 16:26:24,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-11 16:26:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1122 transitions. [2018-04-11 16:26:24,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1103 [2018-04-11 16:26:24,930 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:24,930 INFO L355 BasicCegarLoop]: trace histogram [167, 152, 151, 151, 151, 151, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:24,930 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:24,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1560222711, now seen corresponding path program 35 times [2018-04-11 16:26:24,930 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:24,930 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:24,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:24,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:26:24,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:24,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 74298 backedges. 13875 proven. 768 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-04-11 16:26:26,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:26,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:26,275 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 16:26:29,415 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2018-04-11 16:26:29,416 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:26:29,893 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 74298 backedges. 13875 proven. 768 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-04-11 16:26:30,340 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:30,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 19 [2018-04-11 16:26:30,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 16:26:30,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 16:26:30,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-04-11 16:26:30,341 INFO L87 Difference]: Start difference. First operand 1118 states and 1122 transitions. Second operand 20 states. [2018-04-11 16:26:30,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:30,824 INFO L93 Difference]: Finished difference Result 1133 states and 1138 transitions. [2018-04-11 16:26:30,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 16:26:30,824 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 1102 [2018-04-11 16:26:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:30,827 INFO L225 Difference]: With dead ends: 1133 [2018-04-11 16:26:30,827 INFO L226 Difference]: Without dead ends: 1133 [2018-04-11 16:26:30,827 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1120 GetRequests, 1099 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-04-11 16:26:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2018-04-11 16:26:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1124. [2018-04-11 16:26:30,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2018-04-11 16:26:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1129 transitions. [2018-04-11 16:26:30,835 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1129 transitions. Word has length 1102 [2018-04-11 16:26:30,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:30,836 INFO L459 AbstractCegarLoop]: Abstraction has 1124 states and 1129 transitions. [2018-04-11 16:26:30,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 16:26:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1129 transitions. [2018-04-11 16:26:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2018-04-11 16:26:30,842 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:30,842 INFO L355 BasicCegarLoop]: trace histogram [168, 153, 152, 152, 152, 152, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:30,842 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:30,842 INFO L82 PathProgramCache]: Analyzing trace with hash -120038399, now seen corresponding path program 36 times [2018-04-11 16:26:30,842 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:30,842 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:30,843 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:30,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:26:30,843 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:30,888 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:33,126 INFO L134 CoverageAnalysis]: Checked inductivity of 75237 backedges. 15547 proven. 740 refuted. 0 times theorem prover too weak. 58950 trivial. 0 not checked. [2018-04-11 16:26:33,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:33,127 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:33,127 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 16:26:33,455 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-04-11 16:26:33,455 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:26:33,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 75237 backedges. 14812 proven. 707 refuted. 0 times theorem prover too weak. 59718 trivial. 0 not checked. [2018-04-11 16:26:33,954 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:33,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 22] total 42 [2018-04-11 16:26:33,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 16:26:33,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 16:26:33,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1346, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 16:26:33,955 INFO L87 Difference]: Start difference. First operand 1124 states and 1129 transitions. Second operand 42 states. [2018-04-11 16:26:34,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:34,874 INFO L93 Difference]: Finished difference Result 1362 states and 1372 transitions. [2018-04-11 16:26:34,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 16:26:34,874 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1108 [2018-04-11 16:26:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:34,878 INFO L225 Difference]: With dead ends: 1362 [2018-04-11 16:26:34,878 INFO L226 Difference]: Without dead ends: 1362 [2018-04-11 16:26:34,878 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1179 GetRequests, 1105 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1343, Invalid=4357, Unknown=0, NotChecked=0, Total=5700 [2018-04-11 16:26:34,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2018-04-11 16:26:34,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 1358. [2018-04-11 16:26:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1358 states. [2018-04-11 16:26:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1368 transitions. [2018-04-11 16:26:34,892 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1368 transitions. Word has length 1108 [2018-04-11 16:26:34,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:34,893 INFO L459 AbstractCegarLoop]: Abstraction has 1358 states and 1368 transitions. [2018-04-11 16:26:34,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 16:26:34,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1368 transitions. [2018-04-11 16:26:34,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1211 [2018-04-11 16:26:34,903 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:34,903 INFO L355 BasicCegarLoop]: trace histogram [184, 168, 167, 167, 167, 167, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:34,903 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:34,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1367851287, now seen corresponding path program 37 times [2018-04-11 16:26:34,904 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:34,904 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:34,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:34,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:26:34,904 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:34,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 90563 backedges. 28558 proven. 2167 refuted. 0 times theorem prover too weak. 59838 trivial. 0 not checked. [2018-04-11 16:26:37,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:37,389 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:37,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:26:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:37,462 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 90563 backedges. 40543 proven. 660 refuted. 0 times theorem prover too weak. 49360 trivial. 0 not checked. [2018-04-11 16:26:38,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:38,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 50 [2018-04-11 16:26:38,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-11 16:26:38,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-11 16:26:38,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 16:26:38,083 INFO L87 Difference]: Start difference. First operand 1358 states and 1368 transitions. Second operand 50 states. [2018-04-11 16:26:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:38,624 INFO L93 Difference]: Finished difference Result 1244 states and 1248 transitions. [2018-04-11 16:26:38,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 16:26:38,624 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1210 [2018-04-11 16:26:38,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:38,627 INFO L225 Difference]: With dead ends: 1244 [2018-04-11 16:26:38,627 INFO L226 Difference]: Without dead ends: 1235 [2018-04-11 16:26:38,627 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1257 GetRequests, 1195 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1345 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=936, Invalid=3096, Unknown=0, NotChecked=0, Total=4032 [2018-04-11 16:26:38,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2018-04-11 16:26:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1232. [2018-04-11 16:26:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2018-04-11 16:26:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1236 transitions. [2018-04-11 16:26:38,633 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1236 transitions. Word has length 1210 [2018-04-11 16:26:38,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:38,634 INFO L459 AbstractCegarLoop]: Abstraction has 1232 states and 1236 transitions. [2018-04-11 16:26:38,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-11 16:26:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1236 transitions. [2018-04-11 16:26:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1217 [2018-04-11 16:26:38,641 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:38,641 INFO L355 BasicCegarLoop]: trace histogram [185, 169, 168, 168, 168, 168, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:38,641 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:38,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1881913057, now seen corresponding path program 38 times [2018-04-11 16:26:38,642 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:38,642 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:38,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:38,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:26:38,642 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:38,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:41,099 INFO L134 CoverageAnalysis]: Checked inductivity of 91600 backedges. 31016 proven. 752 refuted. 0 times theorem prover too weak. 59832 trivial. 0 not checked. [2018-04-11 16:26:41,099 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:41,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:41,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:26:41,172 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:26:41,173 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:26:41,183 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 91600 backedges. 31016 proven. 752 refuted. 0 times theorem prover too weak. 59832 trivial. 0 not checked. [2018-04-11 16:26:41,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:41,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 53 [2018-04-11 16:26:41,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-11 16:26:41,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-11 16:26:41,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 16:26:41,812 INFO L87 Difference]: Start difference. First operand 1232 states and 1236 transitions. Second operand 53 states. [2018-04-11 16:26:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:42,380 INFO L93 Difference]: Finished difference Result 1244 states and 1246 transitions. [2018-04-11 16:26:42,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 16:26:42,380 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1216 [2018-04-11 16:26:42,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:42,382 INFO L225 Difference]: With dead ends: 1244 [2018-04-11 16:26:42,382 INFO L226 Difference]: Without dead ends: 1238 [2018-04-11 16:26:42,383 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1266 GetRequests, 1200 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1531 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1054, Invalid=3502, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 16:26:42,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2018-04-11 16:26:42,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1232. [2018-04-11 16:26:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2018-04-11 16:26:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1234 transitions. [2018-04-11 16:26:42,389 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1234 transitions. Word has length 1216 [2018-04-11 16:26:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:42,390 INFO L459 AbstractCegarLoop]: Abstraction has 1232 states and 1234 transitions. [2018-04-11 16:26:42,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-11 16:26:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1234 transitions. [2018-04-11 16:26:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1223 [2018-04-11 16:26:42,396 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:42,397 INFO L355 BasicCegarLoop]: trace histogram [186, 170, 169, 169, 169, 169, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:42,397 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:42,397 INFO L82 PathProgramCache]: Analyzing trace with hash -460291879, now seen corresponding path program 39 times [2018-04-11 16:26:42,397 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:42,397 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:42,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:42,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:26:42,398 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:42,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:43,966 INFO L134 CoverageAnalysis]: Checked inductivity of 92643 backedges. 16536 proven. 867 refuted. 0 times theorem prover too weak. 75240 trivial. 0 not checked. [2018-04-11 16:26:43,966 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:43,966 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:43,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:26:44,033 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-04-11 16:26:44,034 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:26:44,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 92643 backedges. 16552 proven. 867 refuted. 0 times theorem prover too weak. 75224 trivial. 0 not checked. [2018-04-11 16:26:44,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:44,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2018-04-11 16:26:44,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 16:26:44,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 16:26:44,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1281, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 16:26:44,640 INFO L87 Difference]: Start difference. First operand 1232 states and 1234 transitions. Second operand 42 states. [2018-04-11 16:26:45,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:45,228 INFO L93 Difference]: Finished difference Result 1247 states and 1250 transitions. [2018-04-11 16:26:45,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 16:26:45,228 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1222 [2018-04-11 16:26:45,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:45,231 INFO L225 Difference]: With dead ends: 1247 [2018-04-11 16:26:45,231 INFO L226 Difference]: Without dead ends: 1247 [2018-04-11 16:26:45,231 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1259 GetRequests, 1201 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=872, Invalid=2668, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 16:26:45,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2018-04-11 16:26:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1238. [2018-04-11 16:26:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1238 states. [2018-04-11 16:26:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1241 transitions. [2018-04-11 16:26:45,240 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1241 transitions. Word has length 1222 [2018-04-11 16:26:45,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:45,241 INFO L459 AbstractCegarLoop]: Abstraction has 1238 states and 1241 transitions. [2018-04-11 16:26:45,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 16:26:45,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1241 transitions. [2018-04-11 16:26:45,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1229 [2018-04-11 16:26:45,253 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:45,253 INFO L355 BasicCegarLoop]: trace histogram [187, 171, 170, 170, 170, 170, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:45,253 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:45,254 INFO L82 PathProgramCache]: Analyzing trace with hash -632087343, now seen corresponding path program 40 times [2018-04-11 16:26:45,254 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:45,254 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:45,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:45,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:26:45,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:45,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 93692 backedges. 18415 proven. 837 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-04-11 16:26:47,983 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:47,983 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:47,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:26:48,044 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:26:48,044 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:26:48,056 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 93692 backedges. 31279 proven. 2758 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-04-11 16:26:49,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:49,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 43] total 78 [2018-04-11 16:26:49,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-11 16:26:49,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-11 16:26:49,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=5012, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 16:26:49,390 INFO L87 Difference]: Start difference. First operand 1238 states and 1241 transitions. Second operand 78 states. [2018-04-11 16:26:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:50,990 INFO L93 Difference]: Finished difference Result 1372 states and 1376 transitions. [2018-04-11 16:26:50,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-11 16:26:50,990 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 1228 [2018-04-11 16:26:50,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:50,993 INFO L225 Difference]: With dead ends: 1372 [2018-04-11 16:26:50,993 INFO L226 Difference]: Without dead ends: 1372 [2018-04-11 16:26:50,994 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1320 GetRequests, 1191 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2976, Invalid=14054, Unknown=0, NotChecked=0, Total=17030 [2018-04-11 16:26:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2018-04-11 16:26:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1364. [2018-04-11 16:26:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1364 states. [2018-04-11 16:26:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1368 transitions. [2018-04-11 16:26:51,005 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1368 transitions. Word has length 1228 [2018-04-11 16:26:51,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:51,006 INFO L459 AbstractCegarLoop]: Abstraction has 1364 states and 1368 transitions. [2018-04-11 16:26:51,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-11 16:26:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1368 transitions. [2018-04-11 16:26:51,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1349 [2018-04-11 16:26:51,020 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:51,021 INFO L355 BasicCegarLoop]: trace histogram [206, 189, 188, 188, 188, 188, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:51,021 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:51,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1478054495, now seen corresponding path program 41 times [2018-04-11 16:26:51,021 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:51,021 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:51,022 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:51,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:26:51,022 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:51,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:26:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 114175 backedges. 19516 proven. 972 refuted. 0 times theorem prover too weak. 93687 trivial. 0 not checked. [2018-04-11 16:26:53,011 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:26:53,011 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:26:53,012 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 16:26:55,516 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-04-11 16:26:55,517 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:26:55,925 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:26:56,454 INFO L134 CoverageAnalysis]: Checked inductivity of 114175 backedges. 19516 proven. 972 refuted. 0 times theorem prover too weak. 93687 trivial. 0 not checked. [2018-04-11 16:26:56,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:26:56,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-04-11 16:26:56,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 16:26:56,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 16:26:56,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 16:26:56,456 INFO L87 Difference]: Start difference. First operand 1364 states and 1368 transitions. Second operand 41 states. [2018-04-11 16:26:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:26:56,865 INFO L93 Difference]: Finished difference Result 1379 states and 1384 transitions. [2018-04-11 16:26:56,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 16:26:56,865 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1348 [2018-04-11 16:26:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:26:56,868 INFO L225 Difference]: With dead ends: 1379 [2018-04-11 16:26:56,868 INFO L226 Difference]: Without dead ends: 1379 [2018-04-11 16:26:56,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1368 GetRequests, 1328 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 16:26:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2018-04-11 16:26:56,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1370. [2018-04-11 16:26:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1370 states. [2018-04-11 16:26:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1375 transitions. [2018-04-11 16:26:56,875 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1375 transitions. Word has length 1348 [2018-04-11 16:26:56,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:26:56,875 INFO L459 AbstractCegarLoop]: Abstraction has 1370 states and 1375 transitions. [2018-04-11 16:26:56,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 16:26:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1375 transitions. [2018-04-11 16:26:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1355 [2018-04-11 16:26:56,883 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:26:56,884 INFO L355 BasicCegarLoop]: trace histogram [207, 190, 189, 189, 189, 189, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:26:56,884 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:26:56,884 INFO L82 PathProgramCache]: Analyzing trace with hash 724997017, now seen corresponding path program 42 times [2018-04-11 16:26:56,884 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:26:56,884 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:26:56,885 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:56,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:26:56,885 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:26:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:26:56,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:27:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 115340 backedges. 21614 proven. 940 refuted. 0 times theorem prover too weak. 92786 trivial. 0 not checked. [2018-04-11 16:27:00,273 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:27:00,273 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:27:00,273 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 16:27:02,142 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2018-04-11 16:27:02,142 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:27:02,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:27:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 115340 backedges. 20567 proven. 5569 refuted. 0 times theorem prover too weak. 89204 trivial. 0 not checked. [2018-04-11 16:27:02,974 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:27:02,974 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 28] total 51 [2018-04-11 16:27:02,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 16:27:02,975 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 16:27:02,975 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=2091, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 16:27:02,975 INFO L87 Difference]: Start difference. First operand 1370 states and 1375 transitions. Second operand 51 states. [2018-04-11 16:27:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:27:03,996 INFO L93 Difference]: Finished difference Result 1635 states and 1645 transitions. [2018-04-11 16:27:03,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-11 16:27:03,996 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1354 [2018-04-11 16:27:03,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:27:03,999 INFO L225 Difference]: With dead ends: 1635 [2018-04-11 16:27:03,999 INFO L226 Difference]: Without dead ends: 1635 [2018-04-11 16:27:04,000 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1436 GetRequests, 1346 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1585 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1784, Invalid=6588, Unknown=0, NotChecked=0, Total=8372 [2018-04-11 16:27:04,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1635 states. [2018-04-11 16:27:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1635 to 1628. [2018-04-11 16:27:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2018-04-11 16:27:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1638 transitions. [2018-04-11 16:27:04,009 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1638 transitions. Word has length 1354 [2018-04-11 16:27:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:27:04,010 INFO L459 AbstractCegarLoop]: Abstraction has 1628 states and 1638 transitions. [2018-04-11 16:27:04,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 16:27:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1638 transitions. [2018-04-11 16:27:04,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1469 [2018-04-11 16:27:04,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:27:04,021 INFO L355 BasicCegarLoop]: trace histogram [225, 207, 206, 206, 206, 206, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:27:04,021 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:27:04,022 INFO L82 PathProgramCache]: Analyzing trace with hash 839607921, now seen corresponding path program 43 times [2018-04-11 16:27:04,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:27:04,022 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:27:04,022 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:27:04,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:27:04,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:27:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:27:04,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:27:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 136686 backedges. 40033 proven. 2761 refuted. 0 times theorem prover too weak. 93892 trivial. 0 not checked. [2018-04-11 16:27:07,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:27:07,696 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:27:07,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:27:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:27:07,785 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:27:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 136686 backedges. 57190 proven. 850 refuted. 0 times theorem prover too weak. 78646 trivial. 0 not checked. [2018-04-11 16:27:08,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:27:08,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 56 [2018-04-11 16:27:08,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-11 16:27:08,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-11 16:27:08,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=739, Invalid=2341, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 16:27:08,602 INFO L87 Difference]: Start difference. First operand 1628 states and 1638 transitions. Second operand 56 states. [2018-04-11 16:27:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:27:09,304 INFO L93 Difference]: Finished difference Result 1502 states and 1506 transitions. [2018-04-11 16:27:09,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-11 16:27:09,305 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 1468 [2018-04-11 16:27:09,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:27:09,309 INFO L225 Difference]: With dead ends: 1502 [2018-04-11 16:27:09,309 INFO L226 Difference]: Without dead ends: 1493 [2018-04-11 16:27:09,309 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1521 GetRequests, 1451 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1729 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1179, Invalid=3933, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 16:27:09,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2018-04-11 16:27:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1490. [2018-04-11 16:27:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2018-04-11 16:27:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1494 transitions. [2018-04-11 16:27:09,323 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1494 transitions. Word has length 1468 [2018-04-11 16:27:09,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:27:09,324 INFO L459 AbstractCegarLoop]: Abstraction has 1490 states and 1494 transitions. [2018-04-11 16:27:09,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-11 16:27:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1494 transitions. [2018-04-11 16:27:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1475 [2018-04-11 16:27:09,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:27:09,342 INFO L355 BasicCegarLoop]: trace histogram [226, 208, 207, 207, 207, 207, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:27:09,342 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:27:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash -637855639, now seen corresponding path program 44 times [2018-04-11 16:27:09,342 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:27:09,342 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:27:09,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:27:09,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:27:09,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:27:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:27:09,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:27:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 137961 backedges. 43121 proven. 954 refuted. 0 times theorem prover too weak. 93886 trivial. 0 not checked. [2018-04-11 16:27:13,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:27:13,353 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:27:13,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:27:13,438 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:27:13,438 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:27:13,451 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:27:14,599 INFO L134 CoverageAnalysis]: Checked inductivity of 137961 backedges. 23606 proven. 1009 refuted. 0 times theorem prover too weak. 113346 trivial. 0 not checked. [2018-04-11 16:27:14,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:27:14,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 35] total 74 [2018-04-11 16:27:14,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-11 16:27:14,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-11 16:27:14,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=4683, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 16:27:14,601 INFO L87 Difference]: Start difference. First operand 1490 states and 1494 transitions. Second operand 74 states. [2018-04-11 16:27:16,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:27:16,732 INFO L93 Difference]: Finished difference Result 1637 states and 1640 transitions. [2018-04-11 16:27:16,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-11 16:27:16,732 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 1474 [2018-04-11 16:27:16,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:27:16,735 INFO L225 Difference]: With dead ends: 1637 [2018-04-11 16:27:16,735 INFO L226 Difference]: Without dead ends: 1628 [2018-04-11 16:27:16,736 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1607 GetRequests, 1460 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6154 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2749, Invalid=19303, Unknown=0, NotChecked=0, Total=22052 [2018-04-11 16:27:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2018-04-11 16:27:16,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1616. [2018-04-11 16:27:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2018-04-11 16:27:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 1619 transitions. [2018-04-11 16:27:16,745 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 1619 transitions. Word has length 1474 [2018-04-11 16:27:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:27:16,746 INFO L459 AbstractCegarLoop]: Abstraction has 1616 states and 1619 transitions. [2018-04-11 16:27:16,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-11 16:27:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 1619 transitions. [2018-04-11 16:27:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1607 [2018-04-11 16:27:16,757 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:27:16,757 INFO L355 BasicCegarLoop]: trace histogram [247, 228, 227, 227, 227, 227, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:27:16,757 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:27:16,757 INFO L82 PathProgramCache]: Analyzing trace with hash -119949527, now seen corresponding path program 45 times [2018-04-11 16:27:16,757 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:27:16,757 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:27:16,758 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:27:16,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:27:16,758 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:27:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:27:16,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:27:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 165398 backedges. 48915 proven. 1064 refuted. 0 times theorem prover too weak. 115419 trivial. 0 not checked. [2018-04-11 16:27:21,537 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:27:21,571 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:27:21,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:27:21,656 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-04-11 16:27:21,656 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:27:21,677 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:27:22,528 INFO L134 CoverageAnalysis]: Checked inductivity of 165398 backedges. 25096 proven. 1083 refuted. 0 times theorem prover too weak. 139219 trivial. 0 not checked. [2018-04-11 16:27:22,528 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:27:22,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 21] total 62 [2018-04-11 16:27:22,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-11 16:27:22,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-11 16:27:22,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=3299, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 16:27:22,530 INFO L87 Difference]: Start difference. First operand 1616 states and 1619 transitions. Second operand 62 states. [2018-04-11 16:27:24,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:27:24,725 INFO L93 Difference]: Finished difference Result 1644 states and 1647 transitions. [2018-04-11 16:27:24,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-11 16:27:24,725 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 1606 [2018-04-11 16:27:24,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:27:24,727 INFO L225 Difference]: With dead ends: 1644 [2018-04-11 16:27:24,727 INFO L226 Difference]: Without dead ends: 1638 [2018-04-11 16:27:24,728 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1684 GetRequests, 1587 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2469 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=991, Invalid=8711, Unknown=0, NotChecked=0, Total=9702 [2018-04-11 16:27:24,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2018-04-11 16:27:24,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1628. [2018-04-11 16:27:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2018-04-11 16:27:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 1631 transitions. [2018-04-11 16:27:24,734 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 1631 transitions. Word has length 1606 [2018-04-11 16:27:24,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:27:24,734 INFO L459 AbstractCegarLoop]: Abstraction has 1628 states and 1631 transitions. [2018-04-11 16:27:24,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-11 16:27:24,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 1631 transitions. [2018-04-11 16:27:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1619 [2018-04-11 16:27:24,752 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:27:24,753 INFO L355 BasicCegarLoop]: trace histogram [249, 230, 229, 229, 229, 229, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:27:24,753 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:27:24,753 INFO L82 PathProgramCache]: Analyzing trace with hash 180154649, now seen corresponding path program 46 times [2018-04-11 16:27:24,753 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:27:24,753 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:27:24,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:27:24,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:27:24,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:27:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:27:24,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:27:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 168210 backedges. 26505 proven. 1200 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-04-11 16:27:27,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:27:27,685 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:27:27,685 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:27:27,869 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:27:27,869 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:27:27,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:27:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 168210 backedges. 26505 proven. 1200 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-04-11 16:27:28,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:27:28,644 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2018-04-11 16:27:28,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 16:27:28,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 16:27:28,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=1449, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 16:27:28,645 INFO L87 Difference]: Start difference. First operand 1628 states and 1631 transitions. Second operand 44 states. [2018-04-11 16:27:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:27:29,306 INFO L93 Difference]: Finished difference Result 1656 states and 1661 transitions. [2018-04-11 16:27:29,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 16:27:29,306 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1618 [2018-04-11 16:27:29,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:27:29,308 INFO L225 Difference]: With dead ends: 1656 [2018-04-11 16:27:29,308 INFO L226 Difference]: Without dead ends: 1656 [2018-04-11 16:27:29,308 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1640 GetRequests, 1598 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=1449, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 16:27:29,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2018-04-11 16:27:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1634. [2018-04-11 16:27:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2018-04-11 16:27:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 1638 transitions. [2018-04-11 16:27:29,315 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 1638 transitions. Word has length 1618 [2018-04-11 16:27:29,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:27:29,315 INFO L459 AbstractCegarLoop]: Abstraction has 1634 states and 1638 transitions. [2018-04-11 16:27:29,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 16:27:29,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 1638 transitions. [2018-04-11 16:27:29,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2018-04-11 16:27:29,326 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:27:29,326 INFO L355 BasicCegarLoop]: trace histogram [250, 231, 230, 230, 230, 230, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:27:29,326 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:27:29,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1560650479, now seen corresponding path program 47 times [2018-04-11 16:27:29,327 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:27:29,327 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:27:29,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:27:29,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:27:29,327 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:27:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:27:29,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:27:34,528 INFO L134 CoverageAnalysis]: Checked inductivity of 169625 backedges. 29077 proven. 1164 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-04-11 16:27:34,528 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:27:34,528 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:27:34,528 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 16:27:39,457 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-04-11 16:27:39,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:27:40,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:27:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 169625 backedges. 29011 proven. 6824 refuted. 0 times theorem prover too weak. 133790 trivial. 0 not checked. [2018-04-11 16:27:41,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:27:41,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 50] total 74 [2018-04-11 16:27:41,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-11 16:27:41,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-11 16:27:41,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=4319, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 16:27:41,439 INFO L87 Difference]: Start difference. First operand 1634 states and 1638 transitions. Second operand 74 states. [2018-04-11 16:27:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:27:42,871 INFO L93 Difference]: Finished difference Result 1789 states and 1794 transitions. [2018-04-11 16:27:42,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-11 16:27:42,895 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 1624 [2018-04-11 16:27:42,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:27:42,898 INFO L225 Difference]: With dead ends: 1789 [2018-04-11 16:27:42,898 INFO L226 Difference]: Without dead ends: 1789 [2018-04-11 16:27:42,899 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1714 GetRequests, 1597 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2712 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2962, Invalid=11080, Unknown=0, NotChecked=0, Total=14042 [2018-04-11 16:27:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2018-04-11 16:27:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1778. [2018-04-11 16:27:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2018-04-11 16:27:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 1783 transitions. [2018-04-11 16:27:42,907 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 1783 transitions. Word has length 1624 [2018-04-11 16:27:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:27:42,908 INFO L459 AbstractCegarLoop]: Abstraction has 1778 states and 1783 transitions. [2018-04-11 16:27:42,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-11 16:27:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 1783 transitions. [2018-04-11 16:27:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1757 [2018-04-11 16:27:42,921 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:27:42,922 INFO L355 BasicCegarLoop]: trace histogram [271, 251, 250, 250, 250, 250, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:27:42,922 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:27:42,922 INFO L82 PathProgramCache]: Analyzing trace with hash 963996625, now seen corresponding path program 48 times [2018-04-11 16:27:42,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:27:42,922 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:27:42,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:27:42,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:27:42,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:27:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:27:43,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:27:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 199920 backedges. 55569 proven. 3846 refuted. 0 times theorem prover too weak. 140505 trivial. 0 not checked. [2018-04-11 16:27:49,434 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:27:49,434 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:27:49,434 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 16:27:50,163 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-11 16:27:50,163 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:27:50,211 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:27:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 199920 backedges. 30421 proven. 1323 refuted. 0 times theorem prover too weak. 168176 trivial. 0 not checked. [2018-04-11 16:27:51,308 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:27:51,308 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 24] total 73 [2018-04-11 16:27:51,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-11 16:27:51,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-11 16:27:51,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=4437, Unknown=0, NotChecked=0, Total=5256 [2018-04-11 16:27:51,309 INFO L87 Difference]: Start difference. First operand 1778 states and 1783 transitions. Second operand 73 states. [2018-04-11 16:27:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:27:53,370 INFO L93 Difference]: Finished difference Result 2080 states and 2090 transitions. [2018-04-11 16:27:53,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-11 16:27:53,370 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 1756 [2018-04-11 16:27:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:27:53,376 INFO L225 Difference]: With dead ends: 2080 [2018-04-11 16:27:53,376 INFO L226 Difference]: Without dead ends: 2080 [2018-04-11 16:27:53,377 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1870 GetRequests, 1734 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4536 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4305, Invalid=14601, Unknown=0, NotChecked=0, Total=18906 [2018-04-11 16:27:53,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2018-04-11 16:27:53,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1928. [2018-04-11 16:27:53,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-04-11 16:27:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 1936 transitions. [2018-04-11 16:27:53,393 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 1936 transitions. Word has length 1756 [2018-04-11 16:27:53,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:27:53,394 INFO L459 AbstractCegarLoop]: Abstraction has 1928 states and 1936 transitions. [2018-04-11 16:27:53,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-11 16:27:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 1936 transitions. [2018-04-11 16:27:53,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1769 [2018-04-11 16:27:53,416 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:27:53,417 INFO L355 BasicCegarLoop]: trace histogram [273, 253, 252, 252, 252, 252, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:27:53,417 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:27:53,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1179183553, now seen corresponding path program 49 times [2018-04-11 16:27:53,418 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:27:53,418 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:27:53,418 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:27:53,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:27:53,419 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:27:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:27:53,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:27:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 203012 backedges. 33377 proven. 1285 refuted. 0 times theorem prover too weak. 168350 trivial. 0 not checked. [2018-04-11 16:27:59,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:27:59,678 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:27:59,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:27:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:27:59,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:28:01,194 INFO L134 CoverageAnalysis]: Checked inductivity of 203012 backedges. 33442 proven. 1220 refuted. 0 times theorem prover too weak. 168350 trivial. 0 not checked. [2018-04-11 16:28:01,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:28:01,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47] total 72 [2018-04-11 16:28:01,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-11 16:28:01,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-11 16:28:01,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1177, Invalid=3935, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 16:28:01,195 INFO L87 Difference]: Start difference. First operand 1928 states and 1936 transitions. Second operand 72 states. [2018-04-11 16:28:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:02,867 INFO L93 Difference]: Finished difference Result 2226 states and 2238 transitions. [2018-04-11 16:28:02,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-11 16:28:02,867 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 1768 [2018-04-11 16:28:02,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:02,871 INFO L225 Difference]: With dead ends: 2226 [2018-04-11 16:28:02,871 INFO L226 Difference]: Without dead ends: 2226 [2018-04-11 16:28:02,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1858 GetRequests, 1745 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2204 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3324, Invalid=9786, Unknown=0, NotChecked=0, Total=13110 [2018-04-11 16:28:02,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2018-04-11 16:28:02,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2213. [2018-04-11 16:28:02,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2213 states. [2018-04-11 16:28:02,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2225 transitions. [2018-04-11 16:28:02,883 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2225 transitions. Word has length 1768 [2018-04-11 16:28:02,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:02,884 INFO L459 AbstractCegarLoop]: Abstraction has 2213 states and 2225 transitions. [2018-04-11 16:28:02,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-11 16:28:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2225 transitions. [2018-04-11 16:28:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1901 [2018-04-11 16:28:02,899 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:02,900 INFO L355 BasicCegarLoop]: trace histogram [294, 273, 272, 272, 272, 272, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:28:02,900 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:28:02,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1197311871, now seen corresponding path program 50 times [2018-04-11 16:28:02,900 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:02,900 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:02,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:02,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 16:28:02,901 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:02,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 236043 backedges. 66333 proven. 1302 refuted. 0 times theorem prover too weak. 168408 trivial. 0 not checked. [2018-04-11 16:28:10,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:28:10,474 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:28:10,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 16:28:10,586 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 16:28:10,586 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:28:10,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:28:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 236043 backedges. 66333 proven. 1302 refuted. 0 times theorem prover too weak. 168408 trivial. 0 not checked. [2018-04-11 16:28:11,884 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:28:11,884 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 68 [2018-04-11 16:28:11,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-11 16:28:11,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-11 16:28:11,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1079, Invalid=3477, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 16:28:11,885 INFO L87 Difference]: Start difference. First operand 2213 states and 2225 transitions. Second operand 68 states. [2018-04-11 16:28:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:12,682 INFO L93 Difference]: Finished difference Result 2090 states and 2094 transitions. [2018-04-11 16:28:12,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-11 16:28:12,682 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 1900 [2018-04-11 16:28:12,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:12,686 INFO L225 Difference]: With dead ends: 2090 [2018-04-11 16:28:12,686 INFO L226 Difference]: Without dead ends: 1937 [2018-04-11 16:28:12,687 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1965 GetRequests, 1879 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2641 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1749, Invalid=5907, Unknown=0, NotChecked=0, Total=7656 [2018-04-11 16:28:12,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-04-11 16:28:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1928. [2018-04-11 16:28:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-04-11 16:28:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 1931 transitions. [2018-04-11 16:28:12,702 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 1931 transitions. Word has length 1900 [2018-04-11 16:28:12,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:12,703 INFO L459 AbstractCegarLoop]: Abstraction has 1928 states and 1931 transitions. [2018-04-11 16:28:12,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-11 16:28:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 1931 transitions. [2018-04-11 16:28:12,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1913 [2018-04-11 16:28:12,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:12,730 INFO L355 BasicCegarLoop]: trace histogram [296, 275, 274, 274, 274, 274, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:28:12,730 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:28:12,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1548555889, now seen corresponding path program 51 times [2018-04-11 16:28:12,730 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:12,731 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:12,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:12,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:28:12,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:12,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 239403 backedges. 34986 proven. 1452 refuted. 0 times theorem prover too weak. 202965 trivial. 0 not checked. [2018-04-11 16:28:17,019 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:28:17,019 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:28:17,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 16:28:17,208 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-04-11 16:28:17,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:28:17,251 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 16:28:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 239403 backedges. 34986 proven. 1452 refuted. 0 times theorem prover too weak. 202965 trivial. 0 not checked. [2018-04-11 16:28:18,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 16:28:18,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 29 [2018-04-11 16:28:18,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 16:28:18,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 16:28:18,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=550, Unknown=0, NotChecked=0, Total=870 [2018-04-11 16:28:18,106 INFO L87 Difference]: Start difference. First operand 1928 states and 1931 transitions. Second operand 30 states. [2018-04-11 16:28:18,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 16:28:18,439 INFO L93 Difference]: Finished difference Result 1946 states and 1950 transitions. [2018-04-11 16:28:18,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 16:28:18,439 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1912 [2018-04-11 16:28:18,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 16:28:18,442 INFO L225 Difference]: With dead ends: 1946 [2018-04-11 16:28:18,442 INFO L226 Difference]: Without dead ends: 1946 [2018-04-11 16:28:18,443 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1957 GetRequests, 1908 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=886, Invalid=1664, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 16:28:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2018-04-11 16:28:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1934. [2018-04-11 16:28:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1934 states. [2018-04-11 16:28:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1934 states to 1934 states and 1938 transitions. [2018-04-11 16:28:18,461 INFO L78 Accepts]: Start accepts. Automaton has 1934 states and 1938 transitions. Word has length 1912 [2018-04-11 16:28:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 16:28:18,462 INFO L459 AbstractCegarLoop]: Abstraction has 1934 states and 1938 transitions. [2018-04-11 16:28:18,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 16:28:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1934 states and 1938 transitions. [2018-04-11 16:28:18,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1919 [2018-04-11 16:28:18,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 16:28:18,478 INFO L355 BasicCegarLoop]: trace histogram [297, 276, 275, 275, 275, 275, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 16:28:18,478 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_write_c__fooErr1RequiresViolation]=== [2018-04-11 16:28:18,478 INFO L82 PathProgramCache]: Analyzing trace with hash -29417367, now seen corresponding path program 52 times [2018-04-11 16:28:18,478 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 16:28:18,479 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 16:28:18,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:18,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 16:28:18,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 16:28:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 16:28:18,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 16:28:25,803 INFO L134 CoverageAnalysis]: Checked inductivity of 241092 backedges. 38080 proven. 1412 refuted. 0 times theorem prover too weak. 201600 trivial. 0 not checked. [2018-04-11 16:28:25,803 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 16:28:25,803 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 16:28:25,804 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 16:28:25,909 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 16:28:25,909 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 16:28:25,933 INFO L270 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-04-11 16:28:26,067 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 16:28:26,067 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 16:28:26,070 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 16:28:26,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 04:28:26 BoogieIcfgContainer [2018-04-11 16:28:26,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 16:28:26,071 INFO L168 Benchmark]: Toolchain (without parser) took 173008.33 ms. Allocated memory was 403.2 MB in the beginning and 2.6 GB in the end (delta: 2.2 GB). Free memory was 341.4 MB in the beginning and 2.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 485.3 MB. Max. memory is 5.3 GB. [2018-04-11 16:28:26,072 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 403.2 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 16:28:26,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.38 ms. Allocated memory is still 403.2 MB. Free memory was 341.4 MB in the beginning and 330.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. [2018-04-11 16:28:26,072 INFO L168 Benchmark]: Boogie Preprocessor took 24.71 ms. Allocated memory is still 403.2 MB. Free memory was 330.2 MB in the beginning and 328.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-11 16:28:26,072 INFO L168 Benchmark]: RCFGBuilder took 223.44 ms. Allocated memory was 403.2 MB in the beginning and 590.3 MB in the end (delta: 187.2 MB). Free memory was 328.9 MB in the beginning and 555.4 MB in the end (delta: -226.6 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-04-11 16:28:26,072 INFO L168 Benchmark]: TraceAbstraction took 172604.39 ms. Allocated memory was 590.3 MB in the beginning and 2.6 GB in the end (delta: 2.0 GB). Free memory was 554.1 MB in the beginning and 2.1 GB in the end (delta: -1.5 GB). Peak memory consumption was 510.8 MB. Max. memory is 5.3 GB. [2018-04-11 16:28:26,073 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 403.2 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 153.38 ms. Allocated memory is still 403.2 MB. Free memory was 341.4 MB in the beginning and 330.2 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.71 ms. Allocated memory is still 403.2 MB. Free memory was 330.2 MB in the beginning and 328.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 223.44 ms. Allocated memory was 403.2 MB in the beginning and 590.3 MB in the end (delta: 187.2 MB). Free memory was 328.9 MB in the beginning and 555.4 MB in the end (delta: -226.6 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 172604.39 ms. Allocated memory was 590.3 MB in the beginning and 2.6 GB in the end (delta: 2.0 GB). Free memory was 554.1 MB in the beginning and 2.1 GB in the end (delta: -1.5 GB). Peak memory consumption was 510.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was analyzing trace of length 1919 with TraceHistMax 297, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 7. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 172.5s OverallTime, 61 OverallIterations, 297 TraceHistogramMax, 37.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2181 SDtfs, 19061 SDslu, 24948 SDs, 0 SdLazy, 68135 SolverSat, 2719 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43048 GetRequests, 40063 SyntacticMatches, 14 SemanticMatches, 2971 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62449 ImplicationChecksByTransitivity, 32.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2213occurred in iteration=58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 60 MinimizatonAttempts, 861 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 19.4s SatisfiabilityAnalysisTime, 94.0s InterpolantComputationTime, 81496 NumberOfCodeBlocks, 75930 NumberOfCodeBlocksAsserted, 611 NumberOfCheckSat, 81382 ConstructedInterpolants, 0 QuantifiedInterpolants, 142557923 SizeOfPredicates, 123 NumberOfNonLiveVariables, 80429 ConjunctsInSsa, 1325 ConjunctsInUnsatCore, 114 InterpolantComputations, 7 PerfectInterpolantSequences, 5898334/5978454 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_16-28-26-078.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-write.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_16-28-26-078.csv Completed graceful shutdown