java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 15:05:45,861 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 15:05:45,863 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 15:05:45,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 15:05:45,878 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 15:05:45,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 15:05:45,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 15:05:45,882 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 15:05:45,883 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 15:05:45,884 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 15:05:45,885 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 15:05:45,885 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 15:05:45,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 15:05:45,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 15:05:45,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 15:05:45,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 15:05:45,891 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 15:05:45,892 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 15:05:45,893 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 15:05:45,894 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 15:05:45,896 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 15:05:45,896 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 15:05:45,896 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 15:05:45,897 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 15:05:45,898 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 15:05:45,899 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 15:05:45,899 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 15:05:45,900 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 15:05:45,901 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 15:05:45,901 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 15:05:45,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 15:05:45,902 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_Array.epf [2018-04-10 15:05:45,916 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 15:05:45,916 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 15:05:45,917 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 15:05:45,918 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 15:05:45,918 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 15:05:45,918 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 15:05:45,918 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 15:05:45,918 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 15:05:45,918 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 15:05:45,919 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 15:05:45,919 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 15:05:45,919 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 15:05:45,919 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 15:05:45,919 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 15:05:45,919 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 15:05:45,920 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 15:05:45,920 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 15:05:45,920 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 15:05:45,920 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 15:05:45,920 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 15:05:45,920 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 15:05:45,920 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-04-10 15:05:45,950 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 15:05:45,978 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 15:05:45,981 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 15:05:45,982 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 15:05:45,982 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 15:05:45,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-04-10 15:05:46,296 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG873294137 [2018-04-10 15:05:46,419 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 15:05:46,420 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 15:05:46,420 INFO L168 CDTParser]: Scanning ArraysOfVariableLength_true-valid-memsafety.c [2018-04-10 15:05:46,421 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 15:05:46,421 INFO L215 ultiparseSymbolTable]: [2018-04-10 15:05:46,421 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 15:05:46,421 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength_true-valid-memsafety.c [2018-04-10 15:05:46,421 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength_true-valid-memsafety.c [2018-04-10 15:05:46,421 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 15:05:46,422 INFO L233 ultiparseSymbolTable]: [2018-04-10 15:05:46,435 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG873294137 [2018-04-10 15:05:46,437 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 15:05:46,438 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 15:05:46,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 15:05:46,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 15:05:46,442 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 15:05:46,443 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:05:46" (1/1) ... [2018-04-10 15:05:46,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713d3a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:05:46, skipping insertion in model container [2018-04-10 15:05:46,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 03:05:46" (1/1) ... [2018-04-10 15:05:46,456 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:05:46,465 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 15:05:46,560 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:05:46,578 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 15:05:46,582 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 15:05:46,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:05:46 WrapperNode [2018-04-10 15:05:46,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 15:05:46,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 15:05:46,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 15:05:46,590 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 15:05:46,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:05:46" (1/1) ... [2018-04-10 15:05:46,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:05:46" (1/1) ... [2018-04-10 15:05:46,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:05:46" (1/1) ... [2018-04-10 15:05:46,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:05:46" (1/1) ... [2018-04-10 15:05:46,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:05:46" (1/1) ... [2018-04-10 15:05:46,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:05:46" (1/1) ... [2018-04-10 15:05:46,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:05:46" (1/1) ... [2018-04-10 15:05:46,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 15:05:46,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 15:05:46,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 15:05:46,617 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 15:05:46,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:05:46" (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-10 15:05:46,652 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 15:05:46,652 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 15:05:46,652 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo [2018-04-10 15:05:46,652 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 15:05:46,652 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo [2018-04-10 15:05:46,653 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 15:05:46,653 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 15:05:46,653 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 15:05:46,653 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 15:05:46,653 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 15:05:46,653 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 15:05:46,653 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 15:05:46,653 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 15:05:46,853 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 15:05:46,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:05:46 BoogieIcfgContainer [2018-04-10 15:05:46,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 15:05:46,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 15:05:46,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 15:05:46,858 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 15:05:46,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 03:05:46" (1/3) ... [2018-04-10 15:05:46,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a51690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:05:46, skipping insertion in model container [2018-04-10 15:05:46,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 03:05:46" (2/3) ... [2018-04-10 15:05:46,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a51690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 03:05:46, skipping insertion in model container [2018-04-10 15:05:46,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 03:05:46" (3/3) ... [2018-04-10 15:05:46,862 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-04-10 15:05:46,870 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-04-10 15:05:46,876 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-04-10 15:05:46,899 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 15:05:46,900 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 15:05:46,900 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 15:05:46,900 INFO L371 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-04-10 15:05:46,900 INFO L372 AbstractCegarLoop]: Backedges is CANONICAL [2018-04-10 15:05:46,900 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 15:05:46,900 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 15:05:46,900 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 15:05:46,900 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 15:05:46,901 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 15:05:46,913 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-04-10 15:05:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-10 15:05:46,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:46,923 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:46,923 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash 154629517, now seen corresponding path program 1 times [2018-04-10 15:05:46,961 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:46,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:47,009 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-10 15:05:47,011 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:05:47,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 15:05:47,013 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:47,013 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-10 15:05:47,013 INFO L182 omatonBuilderFactory]: Interpolants [52#true, 53#false] [2018-04-10 15:05:47,014 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-10 15:05:47,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-10 15:05:47,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-10 15:05:47,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-10 15:05:47,026 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-04-10 15:05:47,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:47,043 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-04-10 15:05:47,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-10 15:05:47,045 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-04-10 15:05:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:47,050 INFO L225 Difference]: With dead ends: 49 [2018-04-10 15:05:47,050 INFO L226 Difference]: Without dead ends: 46 [2018-04-10 15:05:47,052 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-10 15:05:47,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-04-10 15:05:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-04-10 15:05:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-10 15:05:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-04-10 15:05:47,075 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2018-04-10 15:05:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:47,076 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-04-10 15:05:47,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-10 15:05:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-04-10 15:05:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-10 15:05:47,076 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:47,076 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:47,076 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:47,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1849425411, now seen corresponding path program 1 times [2018-04-10 15:05:47,077 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:47,093 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:47,160 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-10 15:05:47,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:05:47,161 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:05:47,161 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:47,161 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-10 15:05:47,161 INFO L182 omatonBuilderFactory]: Interpolants [149#true, 150#false, 151#(= 0 main_~i~1), 152#(= 0 |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size|), 153#(and (= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size 0) (= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 0))] [2018-04-10 15:05:47,161 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-10 15:05:47,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:05:47,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:05:47,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:05:47,163 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 5 states. [2018-04-10 15:05:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:47,291 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-04-10 15:05:47,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:05:47,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-10 15:05:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:47,293 INFO L225 Difference]: With dead ends: 73 [2018-04-10 15:05:47,293 INFO L226 Difference]: Without dead ends: 73 [2018-04-10 15:05:47,294 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:05:47,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-10 15:05:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-04-10 15:05:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-10 15:05:47,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-04-10 15:05:47,301 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15 [2018-04-10 15:05:47,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:47,301 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-04-10 15:05:47,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:05:47,301 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-04-10 15:05:47,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-10 15:05:47,302 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:47,302 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:47,302 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:47,303 INFO L82 PathProgramCache]: Analyzing trace with hash -779177800, now seen corresponding path program 1 times [2018-04-10 15:05:47,303 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:47,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:47,333 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-10 15:05:47,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:05:47,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 15:05:47,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:47,334 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-10 15:05:47,334 INFO L182 omatonBuilderFactory]: Interpolants [288#(= 1 (select |#valid| |main_~#b~0.base|)), 286#true, 287#false] [2018-04-10 15:05:47,334 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-10 15:05:47,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 15:05:47,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 15:05:47,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 15:05:47,335 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2018-04-10 15:05:47,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:47,360 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-04-10 15:05:47,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 15:05:47,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-04-10 15:05:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:47,363 INFO L225 Difference]: With dead ends: 55 [2018-04-10 15:05:47,363 INFO L226 Difference]: Without dead ends: 55 [2018-04-10 15:05:47,364 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-10 15:05:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-10 15:05:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-10 15:05:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-10 15:05:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-04-10 15:05:47,369 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 19 [2018-04-10 15:05:47,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:47,369 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-04-10 15:05:47,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 15:05:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-04-10 15:05:47,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-10 15:05:47,370 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:47,370 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:47,370 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:47,370 INFO L82 PathProgramCache]: Analyzing trace with hash -779177799, now seen corresponding path program 1 times [2018-04-10 15:05:47,371 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:47,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:47,427 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-10 15:05:47,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:05:47,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 15:05:47,427 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:47,428 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-10 15:05:47,428 INFO L182 omatonBuilderFactory]: Interpolants [400#false, 401#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0)), 402#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0) (= main_~i~1 0)), 399#true] [2018-04-10 15:05:47,428 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-10 15:05:47,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:05:47,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:05:47,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:05:47,429 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-04-10 15:05:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:47,495 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-04-10 15:05:47,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:05:47,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-10 15:05:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:47,497 INFO L225 Difference]: With dead ends: 65 [2018-04-10 15:05:47,497 INFO L226 Difference]: Without dead ends: 65 [2018-04-10 15:05:47,497 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:05:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-10 15:05:47,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-04-10 15:05:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-10 15:05:47,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-04-10 15:05:47,502 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19 [2018-04-10 15:05:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:47,502 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-04-10 15:05:47,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:05:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-04-10 15:05:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 15:05:47,503 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:47,503 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:47,504 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash 226405917, now seen corresponding path program 1 times [2018-04-10 15:05:47,505 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:47,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 15:05:47,560 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:05:47,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:05:47,560 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:47,561 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-10 15:05:47,561 INFO L182 omatonBuilderFactory]: Interpolants [528#(<= |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size| |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n|), 529#(and (<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n) (= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 0)), 530#(and (<= (+ __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 1) __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n) (= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 0)), 526#true, 527#false] [2018-04-10 15:05:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 15:05:47,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:05:47,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:05:47,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:05:47,562 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-04-10 15:05:47,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:47,603 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-04-10 15:05:47,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:05:47,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-10 15:05:47,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:47,605 INFO L225 Difference]: With dead ends: 69 [2018-04-10 15:05:47,605 INFO L226 Difference]: Without dead ends: 69 [2018-04-10 15:05:47,605 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:05:47,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-04-10 15:05:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-04-10 15:05:47,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-10 15:05:47,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-04-10 15:05:47,611 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 28 [2018-04-10 15:05:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:47,611 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-04-10 15:05:47,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:05:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-04-10 15:05:47,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 15:05:47,612 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:47,612 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:47,612 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:47,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1571351062, now seen corresponding path program 1 times [2018-04-10 15:05:47,614 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:47,625 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:05:47,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:05:47,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 15:05:47,653 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:47,653 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-10 15:05:47,653 INFO L182 omatonBuilderFactory]: Interpolants [665#true, 666#false, 667#(= 1 (select |#valid| |main_~#b~0.base|)), 668#(= 1 (select |#valid| |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base|)), 669#(= 1 (select |#valid| __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base))] [2018-04-10 15:05:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:05:47,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:05:47,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:05:47,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:05:47,654 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 5 states. [2018-04-10 15:05:47,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:47,688 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-04-10 15:05:47,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:05:47,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-10 15:05:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:47,689 INFO L225 Difference]: With dead ends: 60 [2018-04-10 15:05:47,689 INFO L226 Difference]: Without dead ends: 60 [2018-04-10 15:05:47,689 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:05:47,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-10 15:05:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-04-10 15:05:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-10 15:05:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-04-10 15:05:47,693 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 29 [2018-04-10 15:05:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:47,694 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-04-10 15:05:47,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:05:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-04-10 15:05:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 15:05:47,695 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:47,695 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:47,695 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1571351061, now seen corresponding path program 1 times [2018-04-10 15:05:47,696 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:47,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:05:47,804 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:47,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-10 15:05:47,804 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:47,804 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-10 15:05:47,805 INFO L182 omatonBuilderFactory]: Interpolants [800#(and (<= 0 __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0) (= 400 (select |#length| __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base)) (= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset 0) (<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 99)), 793#true, 794#false, 795#(and (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|)), 796#(and (<= main_~i~1 99) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|)), 797#(and (<= main_~i~1 100) (= 400 (select |#length| |main_~#b~0.base|)) (= 0 |main_~#b~0.offset|)), 798#(and (= 400 (select |#length| |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base|)) (= 0 |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset|) (<= |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n| 100)), 799#(and (= 400 (select |#length| __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base)) (= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset 0) (<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n 100))] [2018-04-10 15:05:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:05:47,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:05:47,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:05:47,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:05:47,806 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 8 states. [2018-04-10 15:05:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:47,928 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2018-04-10 15:05:47,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:05:47,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-04-10 15:05:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:47,929 INFO L225 Difference]: With dead ends: 62 [2018-04-10 15:05:47,929 INFO L226 Difference]: Without dead ends: 62 [2018-04-10 15:05:47,929 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:05:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-10 15:05:47,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-04-10 15:05:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-04-10 15:05:47,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-04-10 15:05:47,932 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 29 [2018-04-10 15:05:47,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:47,932 INFO L459 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-04-10 15:05:47,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:05:47,932 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-04-10 15:05:47,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 15:05:47,933 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:47,933 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:47,933 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:47,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1318599725, now seen corresponding path program 1 times [2018-04-10 15:05:47,934 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:47,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-10 15:05:48,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 15:05:48,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 15:05:48,038 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:48,038 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-10 15:05:48,038 INFO L182 omatonBuilderFactory]: Interpolants [928#true, 929#false, 930#(and (= 400 (select |#length| |main_~#b~0.base|)) (= |main_~#b~0.offset| 0)), 931#(and (= |main_~#b~0.offset| 0) (<= 0 (+ (* 4 main_~i~1) |main_~#b~0.offset|)) (= (select |#length| |main_~#b~0.base|) 400)), 932#(and (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (<= 4 (+ (* 4 main_~i~1) |main_~#b~0.offset|))), 933#(and (<= main_~i~1 99) (= |main_~#b~0.offset| 0) (= (select |#length| |main_~#b~0.base|) 400) (<= 4 (+ (* 4 main_~i~1) |main_~#b~0.offset|)))] [2018-04-10 15:05:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-10 15:05:48,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:05:48,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:05:48,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:05:48,039 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 6 states. [2018-04-10 15:05:48,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:48,083 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-04-10 15:05:48,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:05:48,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-10 15:05:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:48,084 INFO L225 Difference]: With dead ends: 64 [2018-04-10 15:05:48,084 INFO L226 Difference]: Without dead ends: 64 [2018-04-10 15:05:48,084 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:05:48,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-10 15:05:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2018-04-10 15:05:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-10 15:05:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-04-10 15:05:48,088 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 32 [2018-04-10 15:05:48,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:48,088 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-04-10 15:05:48,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:05:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-04-10 15:05:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-10 15:05:48,089 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:48,089 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, 1] [2018-04-10 15:05:48,089 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:48,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1420824426, now seen corresponding path program 1 times [2018-04-10 15:05:48,090 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:48,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:48,116 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-10 15:05:48,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:48,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-04-10 15:05:48,117 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:48,117 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-10 15:05:48,117 INFO L182 omatonBuilderFactory]: Interpolants [1052#true, 1053#false, 1054#(= main_~i~1 0), 1055#(<= main_~i~1 1)] [2018-04-10 15:05:48,117 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-10 15:05:48,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 15:05:48,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 15:05:48,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:05:48,118 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-04-10 15:05:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:48,153 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-04-10 15:05:48,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 15:05:48,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-04-10 15:05:48,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:48,154 INFO L225 Difference]: With dead ends: 83 [2018-04-10 15:05:48,155 INFO L226 Difference]: Without dead ends: 83 [2018-04-10 15:05:48,155 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-10 15:05:48,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-10 15:05:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2018-04-10 15:05:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-10 15:05:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-04-10 15:05:48,161 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 32 [2018-04-10 15:05:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:48,162 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-04-10 15:05:48,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 15:05:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-04-10 15:05:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 15:05:48,162 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:48,163 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:48,163 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:48,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1549959115, now seen corresponding path program 1 times [2018-04-10 15:05:48,164 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:48,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:05:48,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:48,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-10 15:05:48,221 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:48,222 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-10 15:05:48,222 INFO L182 omatonBuilderFactory]: Interpolants [1204#true, 1205#false, 1206#(= main_~i~1 0), 1207#(<= main_~i~1 1), 1208#(<= |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size| 1), 1209#(<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size 1), 1210#(<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size (+ __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 1)), 1211#(<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0)] [2018-04-10 15:05:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:05:48,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:05:48,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:05:48,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:05:48,223 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 8 states. [2018-04-10 15:05:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:48,311 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-04-10 15:05:48,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:05:48,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-04-10 15:05:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:48,313 INFO L225 Difference]: With dead ends: 95 [2018-04-10 15:05:48,313 INFO L226 Difference]: Without dead ends: 95 [2018-04-10 15:05:48,313 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:05:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-10 15:05:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78. [2018-04-10 15:05:48,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-10 15:05:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2018-04-10 15:05:48,318 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 34 [2018-04-10 15:05:48,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:48,318 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2018-04-10 15:05:48,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:05:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2018-04-10 15:05:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-10 15:05:48,319 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:48,320 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:48,320 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:48,320 INFO L82 PathProgramCache]: Analyzing trace with hash 2056533948, now seen corresponding path program 2 times [2018-04-10 15:05:48,321 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:48,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-10 15:05:48,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:48,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-10 15:05:48,360 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:48,361 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-10 15:05:48,361 INFO L182 omatonBuilderFactory]: Interpolants [1392#false, 1393#(= main_~i~1 0), 1394#(<= main_~i~1 1), 1395#(<= main_~i~1 2), 1391#true] [2018-04-10 15:05:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-10 15:05:48,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 15:05:48,362 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 15:05:48,362 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 15:05:48,362 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 5 states. [2018-04-10 15:05:48,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:48,415 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-04-10 15:05:48,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 15:05:48,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-04-10 15:05:48,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:48,416 INFO L225 Difference]: With dead ends: 112 [2018-04-10 15:05:48,416 INFO L226 Difference]: Without dead ends: 112 [2018-04-10 15:05:48,417 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10 15:05:48,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-10 15:05:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 89. [2018-04-10 15:05:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-10 15:05:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-04-10 15:05:48,419 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 45 [2018-04-10 15:05:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:48,420 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-04-10 15:05:48,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 15:05:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-04-10 15:05:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-10 15:05:48,421 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:48,421 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:48,421 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:48,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1293117989, now seen corresponding path program 2 times [2018-04-10 15:05:48,421 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:48,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-10 15:05:48,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:48,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-10 15:05:48,499 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 15:05:48,499 INFO L182 omatonBuilderFactory]: Interpolants [1600#(and (<= |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0) (= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 0)), 1601#(<= |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size| 0), 1602#(<= main_~i~1 0), 1603#(<= main_~i~1 1), 1604#(<= |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size| 1), 1605#(<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size 1), 1606#(<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size (+ __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 1)), 1607#(<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0), 1597#true, 1598#false, 1599#(and (= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 0) (<= |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size))] [2018-04-10 15:05:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-10 15:05:48,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:05:48,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:05:48,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:05:48,500 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 11 states. [2018-04-10 15:05:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:48,653 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2018-04-10 15:05:48,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:05:48,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-04-10 15:05:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:48,654 INFO L225 Difference]: With dead ends: 137 [2018-04-10 15:05:48,654 INFO L226 Difference]: Without dead ends: 137 [2018-04-10 15:05:48,654 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-04-10 15:05:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-10 15:05:48,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 114. [2018-04-10 15:05:48,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-10 15:05:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2018-04-10 15:05:48,659 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 47 [2018-04-10 15:05:48,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:48,660 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2018-04-10 15:05:48,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:05:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2018-04-10 15:05:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-10 15:05:48,662 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:48,662 INFO L355 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:48,667 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:48,667 INFO L82 PathProgramCache]: Analyzing trace with hash -183198525, now seen corresponding path program 3 times [2018-04-10 15:05:48,668 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:48,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-04-10 15:05:48,723 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:48,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 15:05:48,724 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:48,724 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-10 15:05:48,724 INFO L182 omatonBuilderFactory]: Interpolants [1872#(and (<= 1 __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0) (<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n)), 1873#(and (<= (+ __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 1) __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n) (<= 1 __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0)), 1867#true, 1868#false, 1869#(<= |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size| |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n|), 1870#(<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n), 1871#(and (<= 0 __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0) (<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n))] [2018-04-10 15:05:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-04-10 15:05:48,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:05:48,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:05:48,725 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:05:48,725 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand 7 states. [2018-04-10 15:05:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:48,782 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-04-10 15:05:48,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:05:48,782 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-04-10 15:05:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:48,783 INFO L225 Difference]: With dead ends: 116 [2018-04-10 15:05:48,783 INFO L226 Difference]: Without dead ends: 116 [2018-04-10 15:05:48,784 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:05:48,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-04-10 15:05:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2018-04-10 15:05:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-10 15:05:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2018-04-10 15:05:48,787 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 53 [2018-04-10 15:05:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:48,787 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2018-04-10 15:05:48,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:05:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2018-04-10 15:05:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-10 15:05:48,788 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:48,788 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:48,788 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:48,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1142358974, now seen corresponding path program 1 times [2018-04-10 15:05:48,789 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:48,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-10 15:05:48,843 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:48,843 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-04-10 15:05:48,843 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:48,843 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-10 15:05:48,843 INFO L182 omatonBuilderFactory]: Interpolants [2112#(<= main_~i~1 2), 2113#(<= main_~i~1 3), 2108#true, 2109#false, 2110#(= main_~i~1 0), 2111#(<= main_~i~1 1)] [2018-04-10 15:05:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-04-10 15:05:48,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 15:05:48,844 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 15:05:48,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:05:48,844 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand 6 states. [2018-04-10 15:05:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:48,900 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2018-04-10 15:05:48,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 15:05:48,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-04-10 15:05:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:48,902 INFO L225 Difference]: With dead ends: 170 [2018-04-10 15:05:48,902 INFO L226 Difference]: Without dead ends: 170 [2018-04-10 15:05:48,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-04-10 15:05:48,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-10 15:05:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 131. [2018-04-10 15:05:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-10 15:05:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2018-04-10 15:05:48,907 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 64 [2018-04-10 15:05:48,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:48,908 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2018-04-10 15:05:48,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 15:05:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2018-04-10 15:05:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-10 15:05:48,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:48,909 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:48,909 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:48,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2038091036, now seen corresponding path program 2 times [2018-04-10 15:05:48,910 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:48,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-04-10 15:05:48,968 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:48,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-04-10 15:05:48,968 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-10 15:05:48,969 INFO L182 omatonBuilderFactory]: Interpolants [2416#false, 2417#(= main_~i~1 0), 2418#(<= main_~i~1 1), 2419#(<= main_~i~1 2), 2420#(<= main_~i~1 3), 2421#(<= main_~i~1 4), 2415#true] [2018-04-10 15:05:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-04-10 15:05:48,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 15:05:48,969 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 15:05:48,969 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:05:48,969 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand 7 states. [2018-04-10 15:05:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:49,029 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2018-04-10 15:05:49,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 15:05:49,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2018-04-10 15:05:49,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:49,030 INFO L225 Difference]: With dead ends: 194 [2018-04-10 15:05:49,030 INFO L226 Difference]: Without dead ends: 194 [2018-04-10 15:05:49,031 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-04-10 15:05:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-10 15:05:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 150. [2018-04-10 15:05:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-10 15:05:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2018-04-10 15:05:49,037 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 77 [2018-04-10 15:05:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:49,037 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2018-04-10 15:05:49,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 15:05:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2018-04-10 15:05:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-04-10 15:05:49,039 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:49,039 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:49,039 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:49,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1707561342, now seen corresponding path program 3 times [2018-04-10 15:05:49,040 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:49,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-04-10 15:05:49,093 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:49,093 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-04-10 15:05:49,093 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-10 15:05:49,094 INFO L182 omatonBuilderFactory]: Interpolants [2768#(= main_~i~1 0), 2769#(<= main_~i~1 1), 2770#(<= main_~i~1 2), 2771#(<= main_~i~1 3), 2772#(<= main_~i~1 4), 2773#(<= main_~i~1 5), 2766#true, 2767#false] [2018-04-10 15:05:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-04-10 15:05:49,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 15:05:49,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 15:05:49,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:05:49,095 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand 8 states. [2018-04-10 15:05:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:49,169 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2018-04-10 15:05:49,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 15:05:49,169 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2018-04-10 15:05:49,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:49,170 INFO L225 Difference]: With dead ends: 218 [2018-04-10 15:05:49,171 INFO L226 Difference]: Without dead ends: 218 [2018-04-10 15:05:49,171 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-04-10 15:05:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-10 15:05:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 169. [2018-04-10 15:05:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-10 15:05:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 193 transitions. [2018-04-10 15:05:49,178 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 193 transitions. Word has length 90 [2018-04-10 15:05:49,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:49,179 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 193 transitions. [2018-04-10 15:05:49,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 15:05:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 193 transitions. [2018-04-10 15:05:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-04-10 15:05:49,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:49,180 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:49,180 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:49,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1093583580, now seen corresponding path program 4 times [2018-04-10 15:05:49,181 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:49,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-04-10 15:05:49,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:49,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-10 15:05:49,265 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-10 15:05:49,265 INFO L182 omatonBuilderFactory]: Interpolants [3168#(<= main_~i~1 5), 3169#(<= main_~i~1 6), 3161#true, 3162#false, 3163#(= main_~i~1 0), 3164#(<= main_~i~1 1), 3165#(<= main_~i~1 2), 3166#(<= main_~i~1 3), 3167#(<= main_~i~1 4)] [2018-04-10 15:05:49,266 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-04-10 15:05:49,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 15:05:49,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 15:05:49,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:05:49,266 INFO L87 Difference]: Start difference. First operand 169 states and 193 transitions. Second operand 9 states. [2018-04-10 15:05:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:49,385 INFO L93 Difference]: Finished difference Result 242 states and 269 transitions. [2018-04-10 15:05:49,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 15:05:49,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2018-04-10 15:05:49,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:49,386 INFO L225 Difference]: With dead ends: 242 [2018-04-10 15:05:49,386 INFO L226 Difference]: Without dead ends: 242 [2018-04-10 15:05:49,387 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-04-10 15:05:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-10 15:05:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 188. [2018-04-10 15:05:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-10 15:05:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 217 transitions. [2018-04-10 15:05:49,393 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 217 transitions. Word has length 103 [2018-04-10 15:05:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:49,393 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 217 transitions. [2018-04-10 15:05:49,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 15:05:49,393 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 217 transitions. [2018-04-10 15:05:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-04-10 15:05:49,394 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:49,395 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:49,395 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:49,395 INFO L82 PathProgramCache]: Analyzing trace with hash 709750590, now seen corresponding path program 5 times [2018-04-10 15:05:49,396 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:49,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-04-10 15:05:49,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:49,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 15:05:49,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-04-10 15:05:49,523 INFO L182 omatonBuilderFactory]: Interpolants [3600#true, 3601#false, 3602#(= main_~i~1 0), 3603#(<= main_~i~1 1), 3604#(<= main_~i~1 2), 3605#(<= main_~i~1 3), 3606#(<= main_~i~1 4), 3607#(<= main_~i~1 5), 3608#(<= main_~i~1 6), 3609#(<= main_~i~1 7)] [2018-04-10 15:05:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-04-10 15:05:49,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 15:05:49,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 15:05:49,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:05:49,524 INFO L87 Difference]: Start difference. First operand 188 states and 217 transitions. Second operand 10 states. [2018-04-10 15:05:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:49,643 INFO L93 Difference]: Finished difference Result 266 states and 297 transitions. [2018-04-10 15:05:49,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 15:05:49,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2018-04-10 15:05:49,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:49,644 INFO L225 Difference]: With dead ends: 266 [2018-04-10 15:05:49,645 INFO L226 Difference]: Without dead ends: 266 [2018-04-10 15:05:49,645 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-04-10 15:05:49,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-04-10 15:05:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 207. [2018-04-10 15:05:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-04-10 15:05:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 241 transitions. [2018-04-10 15:05:49,651 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 241 transitions. Word has length 116 [2018-04-10 15:05:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:49,652 INFO L459 AbstractCegarLoop]: Abstraction has 207 states and 241 transitions. [2018-04-10 15:05:49,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 15:05:49,652 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 241 transitions. [2018-04-10 15:05:49,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-10 15:05:49,653 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:49,653 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:49,653 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:49,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1862858596, now seen corresponding path program 6 times [2018-04-10 15:05:49,654 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:49,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-04-10 15:05:49,776 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:49,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-10 15:05:49,776 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-04-10 15:05:49,776 INFO L182 omatonBuilderFactory]: Interpolants [4083#true, 4084#false, 4085#(= main_~i~1 0), 4086#(<= main_~i~1 1), 4087#(<= main_~i~1 2), 4088#(<= main_~i~1 3), 4089#(<= main_~i~1 4), 4090#(<= main_~i~1 5), 4091#(<= main_~i~1 6), 4092#(<= main_~i~1 7), 4093#(<= main_~i~1 8)] [2018-04-10 15:05:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2018-04-10 15:05:49,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 15:05:49,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 15:05:49,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:05:49,777 INFO L87 Difference]: Start difference. First operand 207 states and 241 transitions. Second operand 11 states. [2018-04-10 15:05:49,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:49,876 INFO L93 Difference]: Finished difference Result 290 states and 325 transitions. [2018-04-10 15:05:49,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 15:05:49,876 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2018-04-10 15:05:49,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:49,877 INFO L225 Difference]: With dead ends: 290 [2018-04-10 15:05:49,877 INFO L226 Difference]: Without dead ends: 290 [2018-04-10 15:05:49,878 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-04-10 15:05:49,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-04-10 15:05:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 226. [2018-04-10 15:05:49,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-10 15:05:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 265 transitions. [2018-04-10 15:05:49,885 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 265 transitions. Word has length 129 [2018-04-10 15:05:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:49,885 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 265 transitions. [2018-04-10 15:05:49,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 15:05:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 265 transitions. [2018-04-10 15:05:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-04-10 15:05:49,887 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:49,887 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:49,888 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:49,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1734794494, now seen corresponding path program 7 times [2018-04-10 15:05:49,888 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:49,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-04-10 15:05:50,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:50,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-10 15:05:50,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-04-10 15:05:50,014 INFO L182 omatonBuilderFactory]: Interpolants [4610#true, 4611#false, 4612#(= main_~i~1 0), 4613#(<= main_~i~1 1), 4614#(<= main_~i~1 2), 4615#(<= main_~i~1 3), 4616#(<= main_~i~1 4), 4617#(<= main_~i~1 5), 4618#(<= main_~i~1 6), 4619#(<= main_~i~1 7), 4620#(<= main_~i~1 8), 4621#(<= main_~i~1 9)] [2018-04-10 15:05:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-04-10 15:05:50,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-10 15:05:50,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-10 15:05:50,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-10 15:05:50,015 INFO L87 Difference]: Start difference. First operand 226 states and 265 transitions. Second operand 12 states. [2018-04-10 15:05:50,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:50,123 INFO L93 Difference]: Finished difference Result 314 states and 353 transitions. [2018-04-10 15:05:50,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 15:05:50,123 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 142 [2018-04-10 15:05:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:50,125 INFO L225 Difference]: With dead ends: 314 [2018-04-10 15:05:50,125 INFO L226 Difference]: Without dead ends: 314 [2018-04-10 15:05:50,125 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-04-10 15:05:50,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-10 15:05:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 245. [2018-04-10 15:05:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-10 15:05:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 289 transitions. [2018-04-10 15:05:50,129 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 289 transitions. Word has length 142 [2018-04-10 15:05:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:50,130 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 289 transitions. [2018-04-10 15:05:50,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-10 15:05:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 289 transitions. [2018-04-10 15:05:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-04-10 15:05:50,131 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:50,131 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:50,131 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:50,131 INFO L82 PathProgramCache]: Analyzing trace with hash -219127388, now seen corresponding path program 8 times [2018-04-10 15:05:50,132 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:50,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:50,238 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-04-10 15:05:50,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:50,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-10 15:05:50,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-04-10 15:05:50,239 INFO L182 omatonBuilderFactory]: Interpolants [5184#(<= main_~i~1 1), 5185#(<= main_~i~1 2), 5186#(<= main_~i~1 3), 5187#(<= main_~i~1 4), 5188#(<= main_~i~1 5), 5189#(<= main_~i~1 6), 5190#(<= main_~i~1 7), 5191#(<= main_~i~1 8), 5192#(<= main_~i~1 9), 5193#(<= main_~i~1 10), 5181#true, 5182#false, 5183#(= main_~i~1 0)] [2018-04-10 15:05:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 335 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-04-10 15:05:50,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-10 15:05:50,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-10 15:05:50,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:05:50,240 INFO L87 Difference]: Start difference. First operand 245 states and 289 transitions. Second operand 13 states. [2018-04-10 15:05:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:50,356 INFO L93 Difference]: Finished difference Result 338 states and 381 transitions. [2018-04-10 15:05:50,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 15:05:50,356 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 155 [2018-04-10 15:05:50,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:50,357 INFO L225 Difference]: With dead ends: 338 [2018-04-10 15:05:50,357 INFO L226 Difference]: Without dead ends: 338 [2018-04-10 15:05:50,357 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-04-10 15:05:50,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-04-10 15:05:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 264. [2018-04-10 15:05:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-04-10 15:05:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 313 transitions. [2018-04-10 15:05:50,365 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 313 transitions. Word has length 155 [2018-04-10 15:05:50,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:50,366 INFO L459 AbstractCegarLoop]: Abstraction has 264 states and 313 transitions. [2018-04-10 15:05:50,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-10 15:05:50,366 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 313 transitions. [2018-04-10 15:05:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-04-10 15:05:50,368 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:50,368 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:50,368 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash -3269954, now seen corresponding path program 9 times [2018-04-10 15:05:50,369 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:50,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-04-10 15:05:50,510 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:50,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 15:05:50,510 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-04-10 15:05:50,510 INFO L182 omatonBuilderFactory]: Interpolants [5796#true, 5797#false, 5798#(= main_~i~1 0), 5799#(<= main_~i~1 1), 5800#(<= main_~i~1 2), 5801#(<= main_~i~1 3), 5802#(<= main_~i~1 4), 5803#(<= main_~i~1 5), 5804#(<= main_~i~1 6), 5805#(<= main_~i~1 7), 5806#(<= main_~i~1 8), 5807#(<= main_~i~1 9), 5808#(<= main_~i~1 10), 5809#(<= main_~i~1 11)] [2018-04-10 15:05:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 407 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2018-04-10 15:05:50,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 15:05:50,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 15:05:50,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-04-10 15:05:50,511 INFO L87 Difference]: Start difference. First operand 264 states and 313 transitions. Second operand 14 states. [2018-04-10 15:05:50,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:50,623 INFO L93 Difference]: Finished difference Result 362 states and 409 transitions. [2018-04-10 15:05:50,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 15:05:50,623 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 168 [2018-04-10 15:05:50,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:50,624 INFO L225 Difference]: With dead ends: 362 [2018-04-10 15:05:50,624 INFO L226 Difference]: Without dead ends: 362 [2018-04-10 15:05:50,624 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-04-10 15:05:50,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-04-10 15:05:50,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 283. [2018-04-10 15:05:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-04-10 15:05:50,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 337 transitions. [2018-04-10 15:05:50,630 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 337 transitions. Word has length 168 [2018-04-10 15:05:50,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:50,631 INFO L459 AbstractCegarLoop]: Abstraction has 283 states and 337 transitions. [2018-04-10 15:05:50,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 15:05:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 337 transitions. [2018-04-10 15:05:50,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-04-10 15:05:50,632 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:50,632 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:50,632 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:50,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1186235420, now seen corresponding path program 10 times [2018-04-10 15:05:50,633 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:50,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-04-10 15:05:50,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:50,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-10 15:05:50,807 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2018-04-10 15:05:50,807 INFO L182 omatonBuilderFactory]: Interpolants [6464#(<= main_~i~1 7), 6465#(<= main_~i~1 8), 6466#(<= main_~i~1 9), 6467#(<= main_~i~1 10), 6468#(<= main_~i~1 11), 6469#(<= main_~i~1 12), 6455#true, 6456#false, 6457#(= main_~i~1 0), 6458#(<= main_~i~1 1), 6459#(<= main_~i~1 2), 6460#(<= main_~i~1 3), 6461#(<= main_~i~1 4), 6462#(<= main_~i~1 5), 6463#(<= main_~i~1 6)] [2018-04-10 15:05:50,808 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 486 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2018-04-10 15:05:50,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 15:05:50,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 15:05:50,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-10 15:05:50,808 INFO L87 Difference]: Start difference. First operand 283 states and 337 transitions. Second operand 15 states. [2018-04-10 15:05:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:50,957 INFO L93 Difference]: Finished difference Result 386 states and 437 transitions. [2018-04-10 15:05:50,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 15:05:50,957 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 181 [2018-04-10 15:05:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:50,959 INFO L225 Difference]: With dead ends: 386 [2018-04-10 15:05:50,959 INFO L226 Difference]: Without dead ends: 386 [2018-04-10 15:05:50,960 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-04-10 15:05:50,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-04-10 15:05:50,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 302. [2018-04-10 15:05:50,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-04-10 15:05:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 361 transitions. [2018-04-10 15:05:50,968 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 361 transitions. Word has length 181 [2018-04-10 15:05:50,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:50,969 INFO L459 AbstractCegarLoop]: Abstraction has 302 states and 361 transitions. [2018-04-10 15:05:50,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 15:05:50,969 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 361 transitions. [2018-04-10 15:05:50,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-04-10 15:05:50,971 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:50,971 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:50,971 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:50,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1556109186, now seen corresponding path program 11 times [2018-04-10 15:05:50,973 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:50,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-04-10 15:05:51,191 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:51,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 15:05:51,191 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-04-10 15:05:51,191 INFO L182 omatonBuilderFactory]: Interpolants [7168#(<= main_~i~1 8), 7169#(<= main_~i~1 9), 7170#(<= main_~i~1 10), 7171#(<= main_~i~1 11), 7172#(<= main_~i~1 12), 7173#(<= main_~i~1 13), 7158#true, 7159#false, 7160#(= main_~i~1 0), 7161#(<= main_~i~1 1), 7162#(<= main_~i~1 2), 7163#(<= main_~i~1 3), 7164#(<= main_~i~1 4), 7165#(<= main_~i~1 5), 7166#(<= main_~i~1 6), 7167#(<= main_~i~1 7)] [2018-04-10 15:05:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2018-04-10 15:05:51,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 15:05:51,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 15:05:51,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-04-10 15:05:51,192 INFO L87 Difference]: Start difference. First operand 302 states and 361 transitions. Second operand 16 states. [2018-04-10 15:05:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:51,372 INFO L93 Difference]: Finished difference Result 410 states and 465 transitions. [2018-04-10 15:05:51,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 15:05:51,372 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 194 [2018-04-10 15:05:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:51,374 INFO L225 Difference]: With dead ends: 410 [2018-04-10 15:05:51,375 INFO L226 Difference]: Without dead ends: 410 [2018-04-10 15:05:51,375 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-04-10 15:05:51,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-04-10 15:05:51,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 321. [2018-04-10 15:05:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-04-10 15:05:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 385 transitions. [2018-04-10 15:05:51,383 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 385 transitions. Word has length 194 [2018-04-10 15:05:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:51,384 INFO L459 AbstractCegarLoop]: Abstraction has 321 states and 385 transitions. [2018-04-10 15:05:51,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 15:05:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 385 transitions. [2018-04-10 15:05:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-04-10 15:05:51,385 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:51,386 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:51,386 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:51,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2082585052, now seen corresponding path program 12 times [2018-04-10 15:05:51,387 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:51,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-04-10 15:05:51,621 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:51,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 15:05:51,621 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-04-10 15:05:51,622 INFO L182 omatonBuilderFactory]: Interpolants [7905#true, 7906#false, 7907#(= main_~i~1 0), 7908#(<= main_~i~1 1), 7909#(<= main_~i~1 2), 7910#(<= main_~i~1 3), 7911#(<= main_~i~1 4), 7912#(<= main_~i~1 5), 7913#(<= main_~i~1 6), 7914#(<= main_~i~1 7), 7915#(<= main_~i~1 8), 7916#(<= main_~i~1 9), 7917#(<= main_~i~1 10), 7918#(<= main_~i~1 11), 7919#(<= main_~i~1 12), 7920#(<= main_~i~1 13), 7921#(<= main_~i~1 14)] [2018-04-10 15:05:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1239 backedges. 0 proven. 665 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2018-04-10 15:05:51,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 15:05:51,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 15:05:51,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-10 15:05:51,623 INFO L87 Difference]: Start difference. First operand 321 states and 385 transitions. Second operand 17 states. [2018-04-10 15:05:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:51,800 INFO L93 Difference]: Finished difference Result 434 states and 493 transitions. [2018-04-10 15:05:51,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 15:05:51,800 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 207 [2018-04-10 15:05:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:51,801 INFO L225 Difference]: With dead ends: 434 [2018-04-10 15:05:51,802 INFO L226 Difference]: Without dead ends: 434 [2018-04-10 15:05:51,802 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-04-10 15:05:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-04-10 15:05:51,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 340. [2018-04-10 15:05:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-04-10 15:05:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 409 transitions. [2018-04-10 15:05:51,809 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 409 transitions. Word has length 207 [2018-04-10 15:05:51,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:51,810 INFO L459 AbstractCegarLoop]: Abstraction has 340 states and 409 transitions. [2018-04-10 15:05:51,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 15:05:51,810 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 409 transitions. [2018-04-10 15:05:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-04-10 15:05:51,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:51,812 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:51,812 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:51,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1904769474, now seen corresponding path program 13 times [2018-04-10 15:05:51,813 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:51,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-04-10 15:05:52,097 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:52,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 15:05:52,097 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2018-04-10 15:05:52,098 INFO L182 omatonBuilderFactory]: Interpolants [8704#(<= main_~i~1 6), 8705#(<= main_~i~1 7), 8706#(<= main_~i~1 8), 8707#(<= main_~i~1 9), 8708#(<= main_~i~1 10), 8709#(<= main_~i~1 11), 8710#(<= main_~i~1 12), 8711#(<= main_~i~1 13), 8712#(<= main_~i~1 14), 8713#(<= main_~i~1 15), 8696#true, 8697#false, 8698#(= main_~i~1 0), 8699#(<= main_~i~1 1), 8700#(<= main_~i~1 2), 8701#(<= main_~i~1 3), 8702#(<= main_~i~1 4), 8703#(<= main_~i~1 5)] [2018-04-10 15:05:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 0 proven. 765 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2018-04-10 15:05:52,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 15:05:52,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 15:05:52,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-04-10 15:05:52,099 INFO L87 Difference]: Start difference. First operand 340 states and 409 transitions. Second operand 18 states. [2018-04-10 15:05:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:52,290 INFO L93 Difference]: Finished difference Result 458 states and 521 transitions. [2018-04-10 15:05:52,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 15:05:52,290 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 220 [2018-04-10 15:05:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:52,293 INFO L225 Difference]: With dead ends: 458 [2018-04-10 15:05:52,293 INFO L226 Difference]: Without dead ends: 458 [2018-04-10 15:05:52,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-04-10 15:05:52,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-04-10 15:05:52,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 359. [2018-04-10 15:05:52,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-04-10 15:05:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 433 transitions. [2018-04-10 15:05:52,302 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 433 transitions. Word has length 220 [2018-04-10 15:05:52,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:52,303 INFO L459 AbstractCegarLoop]: Abstraction has 359 states and 433 transitions. [2018-04-10 15:05:52,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 15:05:52,303 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 433 transitions. [2018-04-10 15:05:52,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-04-10 15:05:52,305 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:52,305 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:52,305 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:52,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1486045084, now seen corresponding path program 14 times [2018-04-10 15:05:52,306 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:52,329 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-04-10 15:05:52,604 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:52,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-10 15:05:52,604 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2018-04-10 15:05:52,604 INFO L182 omatonBuilderFactory]: Interpolants [9536#(<= main_~i~1 3), 9537#(<= main_~i~1 4), 9538#(<= main_~i~1 5), 9539#(<= main_~i~1 6), 9540#(<= main_~i~1 7), 9541#(<= main_~i~1 8), 9542#(<= main_~i~1 9), 9543#(<= main_~i~1 10), 9544#(<= main_~i~1 11), 9545#(<= main_~i~1 12), 9546#(<= main_~i~1 13), 9547#(<= main_~i~1 14), 9548#(<= main_~i~1 15), 9549#(<= main_~i~1 16), 9531#true, 9532#false, 9533#(= main_~i~1 0), 9534#(<= main_~i~1 1), 9535#(<= main_~i~1 2)] [2018-04-10 15:05:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 872 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-04-10 15:05:52,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 15:05:52,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 15:05:52,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-10 15:05:52,605 INFO L87 Difference]: Start difference. First operand 359 states and 433 transitions. Second operand 19 states. [2018-04-10 15:05:52,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:52,866 INFO L93 Difference]: Finished difference Result 482 states and 549 transitions. [2018-04-10 15:05:52,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 15:05:52,866 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 233 [2018-04-10 15:05:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:52,868 INFO L225 Difference]: With dead ends: 482 [2018-04-10 15:05:52,868 INFO L226 Difference]: Without dead ends: 482 [2018-04-10 15:05:52,869 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-04-10 15:05:52,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-04-10 15:05:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2018-04-10 15:05:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-04-10 15:05:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 457 transitions. [2018-04-10 15:05:52,878 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 457 transitions. Word has length 233 [2018-04-10 15:05:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:52,879 INFO L459 AbstractCegarLoop]: Abstraction has 378 states and 457 transitions. [2018-04-10 15:05:52,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 15:05:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 457 transitions. [2018-04-10 15:05:52,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-04-10 15:05:52,881 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:52,881 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:52,881 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:52,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1261548542, now seen corresponding path program 15 times [2018-04-10 15:05:52,882 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:52,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2018-04-10 15:05:53,190 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:53,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-10 15:05:53,190 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:53,191 INFO L134 CoverageAnalysis]: Checked inductivity of 588 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2018-04-10 15:05:53,191 INFO L182 omatonBuilderFactory]: Interpolants [10410#true, 10411#false, 10412#(= main_~i~1 0), 10413#(<= main_~i~1 1), 10414#(<= main_~i~1 2), 10415#(<= main_~i~1 3), 10416#(<= main_~i~1 4), 10417#(<= main_~i~1 5), 10418#(<= main_~i~1 6), 10419#(<= main_~i~1 7), 10420#(<= main_~i~1 8), 10421#(<= main_~i~1 9), 10422#(<= main_~i~1 10), 10423#(<= main_~i~1 11), 10424#(<= main_~i~1 12), 10425#(<= main_~i~1 13), 10426#(<= main_~i~1 14), 10427#(<= main_~i~1 15), 10428#(<= main_~i~1 16), 10429#(<= main_~i~1 17)] [2018-04-10 15:05:53,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 986 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2018-04-10 15:05:53,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 15:05:53,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 15:05:53,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-10 15:05:53,193 INFO L87 Difference]: Start difference. First operand 378 states and 457 transitions. Second operand 20 states. [2018-04-10 15:05:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:53,439 INFO L93 Difference]: Finished difference Result 506 states and 577 transitions. [2018-04-10 15:05:53,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 15:05:53,440 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 246 [2018-04-10 15:05:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:53,442 INFO L225 Difference]: With dead ends: 506 [2018-04-10 15:05:53,442 INFO L226 Difference]: Without dead ends: 506 [2018-04-10 15:05:53,442 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-04-10 15:05:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-04-10 15:05:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 397. [2018-04-10 15:05:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-04-10 15:05:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 481 transitions. [2018-04-10 15:05:53,451 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 481 transitions. Word has length 246 [2018-04-10 15:05:53,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:53,452 INFO L459 AbstractCegarLoop]: Abstraction has 397 states and 481 transitions. [2018-04-10 15:05:53,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 15:05:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 481 transitions. [2018-04-10 15:05:53,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-04-10 15:05:53,454 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:53,454 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:53,454 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:53,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1270540964, now seen corresponding path program 16 times [2018-04-10 15:05:53,455 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:53,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2018-04-10 15:05:53,833 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:53,833 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-10 15:05:53,834 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2018-04-10 15:05:53,834 INFO L182 omatonBuilderFactory]: Interpolants [11333#true, 11334#false, 11335#(= main_~i~1 0), 11336#(<= main_~i~1 1), 11337#(<= main_~i~1 2), 11338#(<= main_~i~1 3), 11339#(<= main_~i~1 4), 11340#(<= main_~i~1 5), 11341#(<= main_~i~1 6), 11342#(<= main_~i~1 7), 11343#(<= main_~i~1 8), 11344#(<= main_~i~1 9), 11345#(<= main_~i~1 10), 11346#(<= main_~i~1 11), 11347#(<= main_~i~1 12), 11348#(<= main_~i~1 13), 11349#(<= main_~i~1 14), 11350#(<= main_~i~1 15), 11351#(<= main_~i~1 16), 11352#(<= main_~i~1 17), 11353#(<= main_~i~1 18)] [2018-04-10 15:05:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2061 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 954 trivial. 0 not checked. [2018-04-10 15:05:53,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 15:05:53,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 15:05:53,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-10 15:05:53,836 INFO L87 Difference]: Start difference. First operand 397 states and 481 transitions. Second operand 21 states. [2018-04-10 15:05:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:54,099 INFO L93 Difference]: Finished difference Result 530 states and 605 transitions. [2018-04-10 15:05:54,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-10 15:05:54,100 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 259 [2018-04-10 15:05:54,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:54,103 INFO L225 Difference]: With dead ends: 530 [2018-04-10 15:05:54,103 INFO L226 Difference]: Without dead ends: 530 [2018-04-10 15:05:54,103 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-04-10 15:05:54,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-04-10 15:05:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 416. [2018-04-10 15:05:54,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-04-10 15:05:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 505 transitions. [2018-04-10 15:05:54,114 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 505 transitions. Word has length 259 [2018-04-10 15:05:54,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:54,115 INFO L459 AbstractCegarLoop]: Abstraction has 416 states and 505 transitions. [2018-04-10 15:05:54,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 15:05:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 505 transitions. [2018-04-10 15:05:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-04-10 15:05:54,117 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:54,117 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:54,117 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:54,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1881813438, now seen corresponding path program 17 times [2018-04-10 15:05:54,118 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:54,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2018-04-10 15:05:54,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:54,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-10 15:05:54,544 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2018-04-10 15:05:54,545 INFO L182 omatonBuilderFactory]: Interpolants [12320#(<= main_~i~1 18), 12321#(<= main_~i~1 19), 12300#true, 12301#false, 12302#(= main_~i~1 0), 12303#(<= main_~i~1 1), 12304#(<= main_~i~1 2), 12305#(<= main_~i~1 3), 12306#(<= main_~i~1 4), 12307#(<= main_~i~1 5), 12308#(<= main_~i~1 6), 12309#(<= main_~i~1 7), 12310#(<= main_~i~1 8), 12311#(<= main_~i~1 9), 12312#(<= main_~i~1 10), 12313#(<= main_~i~1 11), 12314#(<= main_~i~1 12), 12315#(<= main_~i~1 13), 12316#(<= main_~i~1 14), 12317#(<= main_~i~1 15), 12318#(<= main_~i~1 16), 12319#(<= main_~i~1 17)] [2018-04-10 15:05:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2299 backedges. 0 proven. 1235 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2018-04-10 15:05:54,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 15:05:54,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 15:05:54,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-04-10 15:05:54,547 INFO L87 Difference]: Start difference. First operand 416 states and 505 transitions. Second operand 22 states. [2018-04-10 15:05:54,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:54,781 INFO L93 Difference]: Finished difference Result 554 states and 633 transitions. [2018-04-10 15:05:54,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 15:05:54,781 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 272 [2018-04-10 15:05:54,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:54,784 INFO L225 Difference]: With dead ends: 554 [2018-04-10 15:05:54,784 INFO L226 Difference]: Without dead ends: 554 [2018-04-10 15:05:54,784 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-04-10 15:05:54,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-04-10 15:05:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 435. [2018-04-10 15:05:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-10 15:05:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 529 transitions. [2018-04-10 15:05:54,795 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 529 transitions. Word has length 272 [2018-04-10 15:05:54,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:54,795 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 529 transitions. [2018-04-10 15:05:54,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 15:05:54,796 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 529 transitions. [2018-04-10 15:05:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-04-10 15:05:54,798 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:54,798 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 15:05:54,798 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1416837916, now seen corresponding path program 18 times [2018-04-10 15:05:54,799 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:54,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-04-10 15:05:55,248 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:55,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-10 15:05:55,249 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2018-04-10 15:05:55,250 INFO L182 omatonBuilderFactory]: Interpolants [13312#false, 13313#(= main_~i~1 0), 13314#(<= main_~i~1 1), 13315#(<= main_~i~1 2), 13316#(<= main_~i~1 3), 13317#(<= main_~i~1 4), 13318#(<= main_~i~1 5), 13319#(<= main_~i~1 6), 13320#(<= main_~i~1 7), 13321#(<= main_~i~1 8), 13322#(<= main_~i~1 9), 13323#(<= main_~i~1 10), 13324#(<= main_~i~1 11), 13325#(<= main_~i~1 12), 13326#(<= main_~i~1 13), 13327#(<= main_~i~1 14), 13328#(<= main_~i~1 15), 13329#(<= main_~i~1 16), 13330#(<= main_~i~1 17), 13331#(<= main_~i~1 18), 13332#(<= main_~i~1 19), 13333#(<= main_~i~1 20), 13311#true] [2018-04-10 15:05:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1370 refuted. 0 times theorem prover too weak. 1180 trivial. 0 not checked. [2018-04-10 15:05:55,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 15:05:55,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 15:05:55,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-10 15:05:55,252 INFO L87 Difference]: Start difference. First operand 435 states and 529 transitions. Second operand 23 states. [2018-04-10 15:05:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:55,509 INFO L93 Difference]: Finished difference Result 578 states and 661 transitions. [2018-04-10 15:05:55,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 15:05:55,509 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 285 [2018-04-10 15:05:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:55,512 INFO L225 Difference]: With dead ends: 578 [2018-04-10 15:05:55,512 INFO L226 Difference]: Without dead ends: 578 [2018-04-10 15:05:55,512 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-04-10 15:05:55,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-04-10 15:05:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 454. [2018-04-10 15:05:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-04-10 15:05:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 553 transitions. [2018-04-10 15:05:55,523 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 553 transitions. Word has length 285 [2018-04-10 15:05:55,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:55,523 INFO L459 AbstractCegarLoop]: Abstraction has 454 states and 553 transitions. [2018-04-10 15:05:55,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 15:05:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 553 transitions. [2018-04-10 15:05:55,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-04-10 15:05:55,526 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:55,526 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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-10 15:05:55,526 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:55,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1629290366, now seen corresponding path program 19 times [2018-04-10 15:05:55,527 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:55,554 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:56,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2814 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2018-04-10 15:05:56,029 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:56,030 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-10 15:05:56,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:56,030 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2018-04-10 15:05:56,031 INFO L182 omatonBuilderFactory]: Interpolants [14368#(= main_~i~1 0), 14369#(<= main_~i~1 1), 14370#(<= main_~i~1 2), 14371#(<= main_~i~1 3), 14372#(<= main_~i~1 4), 14373#(<= main_~i~1 5), 14374#(<= main_~i~1 6), 14375#(<= main_~i~1 7), 14376#(<= main_~i~1 8), 14377#(<= main_~i~1 9), 14378#(<= main_~i~1 10), 14379#(<= main_~i~1 11), 14380#(<= main_~i~1 12), 14381#(<= main_~i~1 13), 14382#(<= main_~i~1 14), 14383#(<= main_~i~1 15), 14384#(<= main_~i~1 16), 14385#(<= main_~i~1 17), 14386#(<= main_~i~1 18), 14387#(<= main_~i~1 19), 14388#(<= main_~i~1 20), 14389#(<= main_~i~1 21), 14366#true, 14367#false] [2018-04-10 15:05:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2814 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2018-04-10 15:05:56,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 15:05:56,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 15:05:56,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-10 15:05:56,032 INFO L87 Difference]: Start difference. First operand 454 states and 553 transitions. Second operand 24 states. [2018-04-10 15:05:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:56,327 INFO L93 Difference]: Finished difference Result 602 states and 689 transitions. [2018-04-10 15:05:56,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 15:05:56,327 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 298 [2018-04-10 15:05:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:56,330 INFO L225 Difference]: With dead ends: 602 [2018-04-10 15:05:56,330 INFO L226 Difference]: Without dead ends: 602 [2018-04-10 15:05:56,330 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-04-10 15:05:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-04-10 15:05:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 473. [2018-04-10 15:05:56,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-04-10 15:05:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 577 transitions. [2018-04-10 15:05:56,340 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 577 transitions. Word has length 298 [2018-04-10 15:05:56,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:56,341 INFO L459 AbstractCegarLoop]: Abstraction has 473 states and 577 transitions. [2018-04-10 15:05:56,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 15:05:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 577 transitions. [2018-04-10 15:05:56,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-04-10 15:05:56,343 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:56,344 INFO L355 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 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-10 15:05:56,344 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:56,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1420185380, now seen corresponding path program 20 times [2018-04-10 15:05:56,344 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:56,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3091 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-04-10 15:05:56,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:56,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-10 15:05:56,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1083 trivial. 0 not checked. [2018-04-10 15:05:56,816 INFO L182 omatonBuilderFactory]: Interpolants [15488#(<= main_~i~1 21), 15489#(<= main_~i~1 22), 15465#true, 15466#false, 15467#(= main_~i~1 0), 15468#(<= main_~i~1 1), 15469#(<= main_~i~1 2), 15470#(<= main_~i~1 3), 15471#(<= main_~i~1 4), 15472#(<= main_~i~1 5), 15473#(<= main_~i~1 6), 15474#(<= main_~i~1 7), 15475#(<= main_~i~1 8), 15476#(<= main_~i~1 9), 15477#(<= main_~i~1 10), 15478#(<= main_~i~1 11), 15479#(<= main_~i~1 12), 15480#(<= main_~i~1 13), 15481#(<= main_~i~1 14), 15482#(<= main_~i~1 15), 15483#(<= main_~i~1 16), 15484#(<= main_~i~1 17), 15485#(<= main_~i~1 18), 15486#(<= main_~i~1 19), 15487#(<= main_~i~1 20)] [2018-04-10 15:05:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3091 backedges. 0 proven. 1661 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-04-10 15:05:56,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-10 15:05:56,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-10 15:05:56,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-04-10 15:05:56,817 INFO L87 Difference]: Start difference. First operand 473 states and 577 transitions. Second operand 25 states. [2018-04-10 15:05:57,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:57,107 INFO L93 Difference]: Finished difference Result 626 states and 717 transitions. [2018-04-10 15:05:57,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 15:05:57,107 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 311 [2018-04-10 15:05:57,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:57,110 INFO L225 Difference]: With dead ends: 626 [2018-04-10 15:05:57,110 INFO L226 Difference]: Without dead ends: 626 [2018-04-10 15:05:57,110 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-04-10 15:05:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2018-04-10 15:05:57,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 492. [2018-04-10 15:05:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-04-10 15:05:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 601 transitions. [2018-04-10 15:05:57,121 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 601 transitions. Word has length 311 [2018-04-10 15:05:57,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:57,121 INFO L459 AbstractCegarLoop]: Abstraction has 492 states and 601 transitions. [2018-04-10 15:05:57,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-10 15:05:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 601 transitions. [2018-04-10 15:05:57,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-04-10 15:05:57,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:57,124 INFO L355 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 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-10 15:05:57,124 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:57,124 INFO L82 PathProgramCache]: Analyzing trace with hash 247864638, now seen corresponding path program 21 times [2018-04-10 15:05:57,125 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:57,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 1817 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2018-04-10 15:05:57,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:57,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-10 15:05:57,680 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-04-10 15:05:57,681 INFO L182 omatonBuilderFactory]: Interpolants [16608#true, 16609#false, 16610#(= main_~i~1 0), 16611#(<= main_~i~1 1), 16612#(<= main_~i~1 2), 16613#(<= main_~i~1 3), 16614#(<= main_~i~1 4), 16615#(<= main_~i~1 5), 16616#(<= main_~i~1 6), 16617#(<= main_~i~1 7), 16618#(<= main_~i~1 8), 16619#(<= main_~i~1 9), 16620#(<= main_~i~1 10), 16621#(<= main_~i~1 11), 16622#(<= main_~i~1 12), 16623#(<= main_~i~1 13), 16624#(<= main_~i~1 14), 16625#(<= main_~i~1 15), 16626#(<= main_~i~1 16), 16627#(<= main_~i~1 17), 16628#(<= main_~i~1 18), 16629#(<= main_~i~1 19), 16630#(<= main_~i~1 20), 16631#(<= main_~i~1 21), 16632#(<= main_~i~1 22), 16633#(<= main_~i~1 23)] [2018-04-10 15:05:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3381 backedges. 0 proven. 1817 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2018-04-10 15:05:57,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 15:05:57,682 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 15:05:57,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-04-10 15:05:57,682 INFO L87 Difference]: Start difference. First operand 492 states and 601 transitions. Second operand 26 states. [2018-04-10 15:05:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:58,058 INFO L93 Difference]: Finished difference Result 650 states and 745 transitions. [2018-04-10 15:05:58,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 15:05:58,058 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 324 [2018-04-10 15:05:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:58,061 INFO L225 Difference]: With dead ends: 650 [2018-04-10 15:05:58,061 INFO L226 Difference]: Without dead ends: 650 [2018-04-10 15:05:58,061 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-04-10 15:05:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-04-10 15:05:58,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 511. [2018-04-10 15:05:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-04-10 15:05:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 625 transitions. [2018-04-10 15:05:58,071 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 625 transitions. Word has length 324 [2018-04-10 15:05:58,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:58,071 INFO L459 AbstractCegarLoop]: Abstraction has 511 states and 625 transitions. [2018-04-10 15:05:58,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 15:05:58,071 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 625 transitions. [2018-04-10 15:05:58,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-04-10 15:05:58,074 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:58,074 INFO L355 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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-10 15:05:58,074 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:58,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1741392228, now seen corresponding path program 22 times [2018-04-10 15:05:58,075 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:58,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1704 trivial. 0 not checked. [2018-04-10 15:05:58,553 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:58,553 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-10 15:05:58,554 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2018-04-10 15:05:58,554 INFO L182 omatonBuilderFactory]: Interpolants [17795#true, 17796#false, 17797#(= main_~i~1 0), 17798#(<= main_~i~1 1), 17799#(<= main_~i~1 2), 17800#(<= main_~i~1 3), 17801#(<= main_~i~1 4), 17802#(<= main_~i~1 5), 17803#(<= main_~i~1 6), 17804#(<= main_~i~1 7), 17805#(<= main_~i~1 8), 17806#(<= main_~i~1 9), 17807#(<= main_~i~1 10), 17808#(<= main_~i~1 11), 17809#(<= main_~i~1 12), 17810#(<= main_~i~1 13), 17811#(<= main_~i~1 14), 17812#(<= main_~i~1 15), 17813#(<= main_~i~1 16), 17814#(<= main_~i~1 17), 17815#(<= main_~i~1 18), 17816#(<= main_~i~1 19), 17817#(<= main_~i~1 20), 17818#(<= main_~i~1 21), 17819#(<= main_~i~1 22), 17820#(<= main_~i~1 23), 17821#(<= main_~i~1 24)] [2018-04-10 15:05:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3684 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 1704 trivial. 0 not checked. [2018-04-10 15:05:58,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 15:05:58,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 15:05:58,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-04-10 15:05:58,555 INFO L87 Difference]: Start difference. First operand 511 states and 625 transitions. Second operand 27 states. [2018-04-10 15:05:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:58,796 INFO L93 Difference]: Finished difference Result 674 states and 773 transitions. [2018-04-10 15:05:58,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-10 15:05:58,796 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 337 [2018-04-10 15:05:58,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:58,798 INFO L225 Difference]: With dead ends: 674 [2018-04-10 15:05:58,798 INFO L226 Difference]: Without dead ends: 674 [2018-04-10 15:05:58,798 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-04-10 15:05:58,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-04-10 15:05:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 530. [2018-04-10 15:05:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-04-10 15:05:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 649 transitions. [2018-04-10 15:05:58,805 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 649 transitions. Word has length 337 [2018-04-10 15:05:58,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:58,805 INFO L459 AbstractCegarLoop]: Abstraction has 530 states and 649 transitions. [2018-04-10 15:05:58,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 15:05:58,805 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 649 transitions. [2018-04-10 15:05:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-04-10 15:05:58,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:58,807 INFO L355 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 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-10 15:05:58,808 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1226732802, now seen corresponding path program 23 times [2018-04-10 15:05:58,808 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:58,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:05:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4000 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked. [2018-04-10 15:05:59,332 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:05:59,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-10 15:05:59,333 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:05:59,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1452 trivial. 0 not checked. [2018-04-10 15:05:59,333 INFO L182 omatonBuilderFactory]: Interpolants [19026#true, 19027#false, 19028#(= main_~i~1 0), 19029#(<= main_~i~1 1), 19030#(<= main_~i~1 2), 19031#(<= main_~i~1 3), 19032#(<= main_~i~1 4), 19033#(<= main_~i~1 5), 19034#(<= main_~i~1 6), 19035#(<= main_~i~1 7), 19036#(<= main_~i~1 8), 19037#(<= main_~i~1 9), 19038#(<= main_~i~1 10), 19039#(<= main_~i~1 11), 19040#(<= main_~i~1 12), 19041#(<= main_~i~1 13), 19042#(<= main_~i~1 14), 19043#(<= main_~i~1 15), 19044#(<= main_~i~1 16), 19045#(<= main_~i~1 17), 19046#(<= main_~i~1 18), 19047#(<= main_~i~1 19), 19048#(<= main_~i~1 20), 19049#(<= main_~i~1 21), 19050#(<= main_~i~1 22), 19051#(<= main_~i~1 23), 19052#(<= main_~i~1 24), 19053#(<= main_~i~1 25)] [2018-04-10 15:05:59,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4000 backedges. 0 proven. 2150 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked. [2018-04-10 15:05:59,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 15:05:59,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 15:05:59,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-04-10 15:05:59,335 INFO L87 Difference]: Start difference. First operand 530 states and 649 transitions. Second operand 28 states. [2018-04-10 15:05:59,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:05:59,639 INFO L93 Difference]: Finished difference Result 698 states and 801 transitions. [2018-04-10 15:05:59,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 15:05:59,639 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 350 [2018-04-10 15:05:59,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:05:59,641 INFO L225 Difference]: With dead ends: 698 [2018-04-10 15:05:59,641 INFO L226 Difference]: Without dead ends: 698 [2018-04-10 15:05:59,641 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-04-10 15:05:59,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-04-10 15:05:59,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 549. [2018-04-10 15:05:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2018-04-10 15:05:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 673 transitions. [2018-04-10 15:05:59,648 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 673 transitions. Word has length 350 [2018-04-10 15:05:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:05:59,648 INFO L459 AbstractCegarLoop]: Abstraction has 549 states and 673 transitions. [2018-04-10 15:05:59,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 15:05:59,648 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 673 transitions. [2018-04-10 15:05:59,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-04-10 15:05:59,650 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:05:59,650 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 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-10 15:05:59,650 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:05:59,650 INFO L82 PathProgramCache]: Analyzing trace with hash -658476124, now seen corresponding path program 24 times [2018-04-10 15:05:59,651 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:05:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:05:59,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 0 proven. 2327 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2018-04-10 15:06:00,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:00,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-10 15:06:00,194 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1587 trivial. 0 not checked. [2018-04-10 15:06:00,194 INFO L182 omatonBuilderFactory]: Interpolants [20301#true, 20302#false, 20303#(= main_~i~1 0), 20304#(<= main_~i~1 1), 20305#(<= main_~i~1 2), 20306#(<= main_~i~1 3), 20307#(<= main_~i~1 4), 20308#(<= main_~i~1 5), 20309#(<= main_~i~1 6), 20310#(<= main_~i~1 7), 20311#(<= main_~i~1 8), 20312#(<= main_~i~1 9), 20313#(<= main_~i~1 10), 20314#(<= main_~i~1 11), 20315#(<= main_~i~1 12), 20316#(<= main_~i~1 13), 20317#(<= main_~i~1 14), 20318#(<= main_~i~1 15), 20319#(<= main_~i~1 16), 20320#(<= main_~i~1 17), 20321#(<= main_~i~1 18), 20322#(<= main_~i~1 19), 20323#(<= main_~i~1 20), 20324#(<= main_~i~1 21), 20325#(<= main_~i~1 22), 20326#(<= main_~i~1 23), 20327#(<= main_~i~1 24), 20328#(<= main_~i~1 25), 20329#(<= main_~i~1 26)] [2018-04-10 15:06:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 0 proven. 2327 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2018-04-10 15:06:00,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 15:06:00,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 15:06:00,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:06:00,196 INFO L87 Difference]: Start difference. First operand 549 states and 673 transitions. Second operand 29 states. [2018-04-10 15:06:00,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:00,621 INFO L93 Difference]: Finished difference Result 722 states and 829 transitions. [2018-04-10 15:06:00,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 15:06:00,621 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 363 [2018-04-10 15:06:00,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:00,623 INFO L225 Difference]: With dead ends: 722 [2018-04-10 15:06:00,623 INFO L226 Difference]: Without dead ends: 722 [2018-04-10 15:06:00,623 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-04-10 15:06:00,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-04-10 15:06:00,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 568. [2018-04-10 15:06:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-04-10 15:06:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 697 transitions. [2018-04-10 15:06:00,633 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 697 transitions. Word has length 363 [2018-04-10 15:06:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:00,634 INFO L459 AbstractCegarLoop]: Abstraction has 568 states and 697 transitions. [2018-04-10 15:06:00,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 15:06:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 697 transitions. [2018-04-10 15:06:00,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-04-10 15:06:00,637 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:00,637 INFO L355 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 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-10 15:06:00,638 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:00,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1540667202, now seen corresponding path program 25 times [2018-04-10 15:06:00,638 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:00,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4671 backedges. 0 proven. 2511 refuted. 0 times theorem prover too weak. 2160 trivial. 0 not checked. [2018-04-10 15:06:01,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:01,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-10 15:06:01,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:01,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1728 trivial. 0 not checked. [2018-04-10 15:06:01,186 INFO L182 omatonBuilderFactory]: Interpolants [21632#(<= main_~i~1 10), 21633#(<= main_~i~1 11), 21634#(<= main_~i~1 12), 21635#(<= main_~i~1 13), 21636#(<= main_~i~1 14), 21637#(<= main_~i~1 15), 21638#(<= main_~i~1 16), 21639#(<= main_~i~1 17), 21640#(<= main_~i~1 18), 21641#(<= main_~i~1 19), 21642#(<= main_~i~1 20), 21643#(<= main_~i~1 21), 21644#(<= main_~i~1 22), 21645#(<= main_~i~1 23), 21646#(<= main_~i~1 24), 21647#(<= main_~i~1 25), 21648#(<= main_~i~1 26), 21649#(<= main_~i~1 27), 21620#true, 21621#false, 21622#(= main_~i~1 0), 21623#(<= main_~i~1 1), 21624#(<= main_~i~1 2), 21625#(<= main_~i~1 3), 21626#(<= main_~i~1 4), 21627#(<= main_~i~1 5), 21628#(<= main_~i~1 6), 21629#(<= main_~i~1 7), 21630#(<= main_~i~1 8), 21631#(<= main_~i~1 9)] [2018-04-10 15:06:01,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4671 backedges. 0 proven. 2511 refuted. 0 times theorem prover too weak. 2160 trivial. 0 not checked. [2018-04-10 15:06:01,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-10 15:06:01,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-10 15:06:01,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-04-10 15:06:01,188 INFO L87 Difference]: Start difference. First operand 568 states and 697 transitions. Second operand 30 states. [2018-04-10 15:06:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:01,513 INFO L93 Difference]: Finished difference Result 746 states and 857 transitions. [2018-04-10 15:06:01,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 15:06:01,513 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 376 [2018-04-10 15:06:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:01,516 INFO L225 Difference]: With dead ends: 746 [2018-04-10 15:06:01,516 INFO L226 Difference]: Without dead ends: 746 [2018-04-10 15:06:01,516 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-04-10 15:06:01,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-04-10 15:06:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 587. [2018-04-10 15:06:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-04-10 15:06:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 721 transitions. [2018-04-10 15:06:01,527 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 721 transitions. Word has length 376 [2018-04-10 15:06:01,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:01,527 INFO L459 AbstractCegarLoop]: Abstraction has 587 states and 721 transitions. [2018-04-10 15:06:01,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-10 15:06:01,527 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 721 transitions. [2018-04-10 15:06:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-04-10 15:06:01,530 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:01,531 INFO L355 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 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-10 15:06:01,531 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:01,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1370944028, now seen corresponding path program 26 times [2018-04-10 15:06:01,532 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:01,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5026 backedges. 0 proven. 2702 refuted. 0 times theorem prover too weak. 2324 trivial. 0 not checked. [2018-04-10 15:06:02,413 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:02,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-10 15:06:02,413 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1875 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1875 trivial. 0 not checked. [2018-04-10 15:06:02,414 INFO L182 omatonBuilderFactory]: Interpolants [22983#true, 22984#false, 22985#(= main_~i~1 0), 22986#(<= main_~i~1 1), 22987#(<= main_~i~1 2), 22988#(<= main_~i~1 3), 22989#(<= main_~i~1 4), 22990#(<= main_~i~1 5), 22991#(<= main_~i~1 6), 22992#(<= main_~i~1 7), 22993#(<= main_~i~1 8), 22994#(<= main_~i~1 9), 22995#(<= main_~i~1 10), 22996#(<= main_~i~1 11), 22997#(<= main_~i~1 12), 22998#(<= main_~i~1 13), 22999#(<= main_~i~1 14), 23000#(<= main_~i~1 15), 23001#(<= main_~i~1 16), 23002#(<= main_~i~1 17), 23003#(<= main_~i~1 18), 23004#(<= main_~i~1 19), 23005#(<= main_~i~1 20), 23006#(<= main_~i~1 21), 23007#(<= main_~i~1 22), 23008#(<= main_~i~1 23), 23009#(<= main_~i~1 24), 23010#(<= main_~i~1 25), 23011#(<= main_~i~1 26), 23012#(<= main_~i~1 27), 23013#(<= main_~i~1 28)] [2018-04-10 15:06:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5026 backedges. 0 proven. 2702 refuted. 0 times theorem prover too weak. 2324 trivial. 0 not checked. [2018-04-10 15:06:02,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 15:06:02,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 15:06:02,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-04-10 15:06:02,416 INFO L87 Difference]: Start difference. First operand 587 states and 721 transitions. Second operand 31 states. [2018-04-10 15:06:02,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:02,797 INFO L93 Difference]: Finished difference Result 770 states and 885 transitions. [2018-04-10 15:06:02,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-10 15:06:02,797 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 389 [2018-04-10 15:06:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:02,799 INFO L225 Difference]: With dead ends: 770 [2018-04-10 15:06:02,799 INFO L226 Difference]: Without dead ends: 770 [2018-04-10 15:06:02,799 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-04-10 15:06:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-04-10 15:06:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 606. [2018-04-10 15:06:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-04-10 15:06:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 745 transitions. [2018-04-10 15:06:02,805 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 745 transitions. Word has length 389 [2018-04-10 15:06:02,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:02,805 INFO L459 AbstractCegarLoop]: Abstraction has 606 states and 745 transitions. [2018-04-10 15:06:02,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 15:06:02,805 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 745 transitions. [2018-04-10 15:06:02,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-04-10 15:06:02,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:02,807 INFO L355 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 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-10 15:06:02,807 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:02,808 INFO L82 PathProgramCache]: Analyzing trace with hash -295741826, now seen corresponding path program 27 times [2018-04-10 15:06:02,808 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:02,827 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5394 backedges. 0 proven. 2900 refuted. 0 times theorem prover too weak. 2494 trivial. 0 not checked. [2018-04-10 15:06:03,399 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:03,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-10 15:06:03,399 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2028 trivial. 0 not checked. [2018-04-10 15:06:03,400 INFO L182 omatonBuilderFactory]: Interpolants [24390#true, 24391#false, 24392#(= main_~i~1 0), 24393#(<= main_~i~1 1), 24394#(<= main_~i~1 2), 24395#(<= main_~i~1 3), 24396#(<= main_~i~1 4), 24397#(<= main_~i~1 5), 24398#(<= main_~i~1 6), 24399#(<= main_~i~1 7), 24400#(<= main_~i~1 8), 24401#(<= main_~i~1 9), 24402#(<= main_~i~1 10), 24403#(<= main_~i~1 11), 24404#(<= main_~i~1 12), 24405#(<= main_~i~1 13), 24406#(<= main_~i~1 14), 24407#(<= main_~i~1 15), 24408#(<= main_~i~1 16), 24409#(<= main_~i~1 17), 24410#(<= main_~i~1 18), 24411#(<= main_~i~1 19), 24412#(<= main_~i~1 20), 24413#(<= main_~i~1 21), 24414#(<= main_~i~1 22), 24415#(<= main_~i~1 23), 24416#(<= main_~i~1 24), 24417#(<= main_~i~1 25), 24418#(<= main_~i~1 26), 24419#(<= main_~i~1 27), 24420#(<= main_~i~1 28), 24421#(<= main_~i~1 29)] [2018-04-10 15:06:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5394 backedges. 0 proven. 2900 refuted. 0 times theorem prover too weak. 2494 trivial. 0 not checked. [2018-04-10 15:06:03,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 15:06:03,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 15:06:03,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-10 15:06:03,401 INFO L87 Difference]: Start difference. First operand 606 states and 745 transitions. Second operand 32 states. [2018-04-10 15:06:03,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:03,788 INFO L93 Difference]: Finished difference Result 794 states and 913 transitions. [2018-04-10 15:06:03,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 15:06:03,789 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 402 [2018-04-10 15:06:03,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:03,791 INFO L225 Difference]: With dead ends: 794 [2018-04-10 15:06:03,791 INFO L226 Difference]: Without dead ends: 794 [2018-04-10 15:06:03,791 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-04-10 15:06:03,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-04-10 15:06:03,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 625. [2018-04-10 15:06:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-04-10 15:06:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 769 transitions. [2018-04-10 15:06:03,797 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 769 transitions. Word has length 402 [2018-04-10 15:06:03,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:03,798 INFO L459 AbstractCegarLoop]: Abstraction has 625 states and 769 transitions. [2018-04-10 15:06:03,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 15:06:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 769 transitions. [2018-04-10 15:06:03,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-04-10 15:06:03,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:03,800 INFO L355 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 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-10 15:06:03,800 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:03,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1110005796, now seen corresponding path program 28 times [2018-04-10 15:06:03,800 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:03,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5775 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2018-04-10 15:06:04,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:04,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-10 15:06:04,522 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2187 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2187 trivial. 0 not checked. [2018-04-10 15:06:04,523 INFO L182 omatonBuilderFactory]: Interpolants [25856#(<= main_~i~1 13), 25857#(<= main_~i~1 14), 25858#(<= main_~i~1 15), 25859#(<= main_~i~1 16), 25860#(<= main_~i~1 17), 25861#(<= main_~i~1 18), 25862#(<= main_~i~1 19), 25863#(<= main_~i~1 20), 25864#(<= main_~i~1 21), 25865#(<= main_~i~1 22), 25866#(<= main_~i~1 23), 25867#(<= main_~i~1 24), 25868#(<= main_~i~1 25), 25869#(<= main_~i~1 26), 25870#(<= main_~i~1 27), 25871#(<= main_~i~1 28), 25872#(<= main_~i~1 29), 25873#(<= main_~i~1 30), 25841#true, 25842#false, 25843#(= main_~i~1 0), 25844#(<= main_~i~1 1), 25845#(<= main_~i~1 2), 25846#(<= main_~i~1 3), 25847#(<= main_~i~1 4), 25848#(<= main_~i~1 5), 25849#(<= main_~i~1 6), 25850#(<= main_~i~1 7), 25851#(<= main_~i~1 8), 25852#(<= main_~i~1 9), 25853#(<= main_~i~1 10), 25854#(<= main_~i~1 11), 25855#(<= main_~i~1 12)] [2018-04-10 15:06:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5775 backedges. 0 proven. 3105 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2018-04-10 15:06:04,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-10 15:06:04,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-10 15:06:04,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 15:06:04,524 INFO L87 Difference]: Start difference. First operand 625 states and 769 transitions. Second operand 33 states. [2018-04-10 15:06:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:04,825 INFO L93 Difference]: Finished difference Result 818 states and 941 transitions. [2018-04-10 15:06:04,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-10 15:06:04,825 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 415 [2018-04-10 15:06:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:04,827 INFO L225 Difference]: With dead ends: 818 [2018-04-10 15:06:04,827 INFO L226 Difference]: Without dead ends: 818 [2018-04-10 15:06:04,828 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-04-10 15:06:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2018-04-10 15:06:04,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 644. [2018-04-10 15:06:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-04-10 15:06:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 793 transitions. [2018-04-10 15:06:04,833 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 793 transitions. Word has length 415 [2018-04-10 15:06:04,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:04,834 INFO L459 AbstractCegarLoop]: Abstraction has 644 states and 793 transitions. [2018-04-10 15:06:04,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-10 15:06:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 793 transitions. [2018-04-10 15:06:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-04-10 15:06:04,836 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:04,836 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 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-10 15:06:04,836 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:04,836 INFO L82 PathProgramCache]: Analyzing trace with hash 976860222, now seen corresponding path program 29 times [2018-04-10 15:06:04,837 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:04,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6169 backedges. 0 proven. 3317 refuted. 0 times theorem prover too weak. 2852 trivial. 0 not checked. [2018-04-10 15:06:05,541 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:05,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-10 15:06:05,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2352 trivial. 0 not checked. [2018-04-10 15:06:05,541 INFO L182 omatonBuilderFactory]: Interpolants [27336#true, 27337#false, 27338#(= main_~i~1 0), 27339#(<= main_~i~1 1), 27340#(<= main_~i~1 2), 27341#(<= main_~i~1 3), 27342#(<= main_~i~1 4), 27343#(<= main_~i~1 5), 27344#(<= main_~i~1 6), 27345#(<= main_~i~1 7), 27346#(<= main_~i~1 8), 27347#(<= main_~i~1 9), 27348#(<= main_~i~1 10), 27349#(<= main_~i~1 11), 27350#(<= main_~i~1 12), 27351#(<= main_~i~1 13), 27352#(<= main_~i~1 14), 27353#(<= main_~i~1 15), 27354#(<= main_~i~1 16), 27355#(<= main_~i~1 17), 27356#(<= main_~i~1 18), 27357#(<= main_~i~1 19), 27358#(<= main_~i~1 20), 27359#(<= main_~i~1 21), 27360#(<= main_~i~1 22), 27361#(<= main_~i~1 23), 27362#(<= main_~i~1 24), 27363#(<= main_~i~1 25), 27364#(<= main_~i~1 26), 27365#(<= main_~i~1 27), 27366#(<= main_~i~1 28), 27367#(<= main_~i~1 29), 27368#(<= main_~i~1 30), 27369#(<= main_~i~1 31)] [2018-04-10 15:06:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6169 backedges. 0 proven. 3317 refuted. 0 times theorem prover too weak. 2852 trivial. 0 not checked. [2018-04-10 15:06:05,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 15:06:05,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 15:06:05,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 15:06:05,542 INFO L87 Difference]: Start difference. First operand 644 states and 793 transitions. Second operand 34 states. [2018-04-10 15:06:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:06,031 INFO L93 Difference]: Finished difference Result 842 states and 969 transitions. [2018-04-10 15:06:06,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-10 15:06:06,031 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 428 [2018-04-10 15:06:06,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:06,034 INFO L225 Difference]: With dead ends: 842 [2018-04-10 15:06:06,035 INFO L226 Difference]: Without dead ends: 842 [2018-04-10 15:06:06,035 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 15:06:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2018-04-10 15:06:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 663. [2018-04-10 15:06:06,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-04-10 15:06:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 817 transitions. [2018-04-10 15:06:06,046 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 817 transitions. Word has length 428 [2018-04-10 15:06:06,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:06,047 INFO L459 AbstractCegarLoop]: Abstraction has 663 states and 817 transitions. [2018-04-10 15:06:06,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 15:06:06,047 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 817 transitions. [2018-04-10 15:06:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-04-10 15:06:06,054 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:06,055 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 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-10 15:06:06,055 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:06,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2128260508, now seen corresponding path program 30 times [2018-04-10 15:06:06,056 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:06,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6576 backedges. 0 proven. 3536 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked. [2018-04-10 15:06:06,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:06,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-10 15:06:06,764 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2523 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2523 trivial. 0 not checked. [2018-04-10 15:06:06,764 INFO L182 omatonBuilderFactory]: Interpolants [28875#true, 28876#false, 28877#(= main_~i~1 0), 28878#(<= main_~i~1 1), 28879#(<= main_~i~1 2), 28880#(<= main_~i~1 3), 28881#(<= main_~i~1 4), 28882#(<= main_~i~1 5), 28883#(<= main_~i~1 6), 28884#(<= main_~i~1 7), 28885#(<= main_~i~1 8), 28886#(<= main_~i~1 9), 28887#(<= main_~i~1 10), 28888#(<= main_~i~1 11), 28889#(<= main_~i~1 12), 28890#(<= main_~i~1 13), 28891#(<= main_~i~1 14), 28892#(<= main_~i~1 15), 28893#(<= main_~i~1 16), 28894#(<= main_~i~1 17), 28895#(<= main_~i~1 18), 28896#(<= main_~i~1 19), 28897#(<= main_~i~1 20), 28898#(<= main_~i~1 21), 28899#(<= main_~i~1 22), 28900#(<= main_~i~1 23), 28901#(<= main_~i~1 24), 28902#(<= main_~i~1 25), 28903#(<= main_~i~1 26), 28904#(<= main_~i~1 27), 28905#(<= main_~i~1 28), 28906#(<= main_~i~1 29), 28907#(<= main_~i~1 30), 28908#(<= main_~i~1 31), 28909#(<= main_~i~1 32)] [2018-04-10 15:06:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6576 backedges. 0 proven. 3536 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked. [2018-04-10 15:06:06,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 15:06:06,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 15:06:06,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:06:06,766 INFO L87 Difference]: Start difference. First operand 663 states and 817 transitions. Second operand 35 states. [2018-04-10 15:06:07,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:07,171 INFO L93 Difference]: Finished difference Result 866 states and 997 transitions. [2018-04-10 15:06:07,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-10 15:06:07,172 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 441 [2018-04-10 15:06:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:07,174 INFO L225 Difference]: With dead ends: 866 [2018-04-10 15:06:07,174 INFO L226 Difference]: Without dead ends: 866 [2018-04-10 15:06:07,174 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 15:06:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-04-10 15:06:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 682. [2018-04-10 15:06:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2018-04-10 15:06:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 841 transitions. [2018-04-10 15:06:07,180 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 841 transitions. Word has length 441 [2018-04-10 15:06:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:07,181 INFO L459 AbstractCegarLoop]: Abstraction has 682 states and 841 transitions. [2018-04-10 15:06:07,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 15:06:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 841 transitions. [2018-04-10 15:06:07,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-04-10 15:06:07,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:07,183 INFO L355 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 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-10 15:06:07,183 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:07,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2037801470, now seen corresponding path program 31 times [2018-04-10 15:06:07,183 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:07,222 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 3762 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked. [2018-04-10 15:06:08,098 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:08,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-10 15:06:08,098 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2700 trivial. 0 not checked. [2018-04-10 15:06:08,099 INFO L182 omatonBuilderFactory]: Interpolants [30464#(<= main_~i~1 4), 30465#(<= main_~i~1 5), 30466#(<= main_~i~1 6), 30467#(<= main_~i~1 7), 30468#(<= main_~i~1 8), 30469#(<= main_~i~1 9), 30470#(<= main_~i~1 10), 30471#(<= main_~i~1 11), 30472#(<= main_~i~1 12), 30473#(<= main_~i~1 13), 30474#(<= main_~i~1 14), 30475#(<= main_~i~1 15), 30476#(<= main_~i~1 16), 30477#(<= main_~i~1 17), 30478#(<= main_~i~1 18), 30479#(<= main_~i~1 19), 30480#(<= main_~i~1 20), 30481#(<= main_~i~1 21), 30482#(<= main_~i~1 22), 30483#(<= main_~i~1 23), 30484#(<= main_~i~1 24), 30485#(<= main_~i~1 25), 30486#(<= main_~i~1 26), 30487#(<= main_~i~1 27), 30488#(<= main_~i~1 28), 30489#(<= main_~i~1 29), 30490#(<= main_~i~1 30), 30491#(<= main_~i~1 31), 30492#(<= main_~i~1 32), 30493#(<= main_~i~1 33), 30458#true, 30459#false, 30460#(= main_~i~1 0), 30461#(<= main_~i~1 1), 30462#(<= main_~i~1 2), 30463#(<= main_~i~1 3)] [2018-04-10 15:06:08,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6996 backedges. 0 proven. 3762 refuted. 0 times theorem prover too weak. 3234 trivial. 0 not checked. [2018-04-10 15:06:08,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-10 15:06:08,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-10 15:06:08,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 15:06:08,100 INFO L87 Difference]: Start difference. First operand 682 states and 841 transitions. Second operand 36 states. [2018-04-10 15:06:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:08,548 INFO L93 Difference]: Finished difference Result 890 states and 1025 transitions. [2018-04-10 15:06:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 15:06:08,548 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 454 [2018-04-10 15:06:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:08,550 INFO L225 Difference]: With dead ends: 890 [2018-04-10 15:06:08,551 INFO L226 Difference]: Without dead ends: 890 [2018-04-10 15:06:08,551 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 15:06:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-04-10 15:06:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 701. [2018-04-10 15:06:08,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2018-04-10 15:06:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 865 transitions. [2018-04-10 15:06:08,557 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 865 transitions. Word has length 454 [2018-04-10 15:06:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:08,558 INFO L459 AbstractCegarLoop]: Abstraction has 701 states and 865 transitions. [2018-04-10 15:06:08,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-10 15:06:08,558 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 865 transitions. [2018-04-10 15:06:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-04-10 15:06:08,560 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:08,560 INFO L355 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 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-10 15:06:08,560 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:08,560 INFO L82 PathProgramCache]: Analyzing trace with hash 721484964, now seen corresponding path program 32 times [2018-04-10 15:06:08,561 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:08,590 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 3434 trivial. 0 not checked. [2018-04-10 15:06:09,408 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:09,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-10 15:06:09,408 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2883 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2883 trivial. 0 not checked. [2018-04-10 15:06:09,409 INFO L182 omatonBuilderFactory]: Interpolants [32085#true, 32086#false, 32087#(= main_~i~1 0), 32088#(<= main_~i~1 1), 32089#(<= main_~i~1 2), 32090#(<= main_~i~1 3), 32091#(<= main_~i~1 4), 32092#(<= main_~i~1 5), 32093#(<= main_~i~1 6), 32094#(<= main_~i~1 7), 32095#(<= main_~i~1 8), 32096#(<= main_~i~1 9), 32097#(<= main_~i~1 10), 32098#(<= main_~i~1 11), 32099#(<= main_~i~1 12), 32100#(<= main_~i~1 13), 32101#(<= main_~i~1 14), 32102#(<= main_~i~1 15), 32103#(<= main_~i~1 16), 32104#(<= main_~i~1 17), 32105#(<= main_~i~1 18), 32106#(<= main_~i~1 19), 32107#(<= main_~i~1 20), 32108#(<= main_~i~1 21), 32109#(<= main_~i~1 22), 32110#(<= main_~i~1 23), 32111#(<= main_~i~1 24), 32112#(<= main_~i~1 25), 32113#(<= main_~i~1 26), 32114#(<= main_~i~1 27), 32115#(<= main_~i~1 28), 32116#(<= main_~i~1 29), 32117#(<= main_~i~1 30), 32118#(<= main_~i~1 31), 32119#(<= main_~i~1 32), 32120#(<= main_~i~1 33), 32121#(<= main_~i~1 34)] [2018-04-10 15:06:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7429 backedges. 0 proven. 3995 refuted. 0 times theorem prover too weak. 3434 trivial. 0 not checked. [2018-04-10 15:06:09,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-10 15:06:09,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-10 15:06:09,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:06:09,410 INFO L87 Difference]: Start difference. First operand 701 states and 865 transitions. Second operand 37 states. [2018-04-10 15:06:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:09,830 INFO L93 Difference]: Finished difference Result 914 states and 1053 transitions. [2018-04-10 15:06:09,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-10 15:06:09,830 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 467 [2018-04-10 15:06:09,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:09,832 INFO L225 Difference]: With dead ends: 914 [2018-04-10 15:06:09,832 INFO L226 Difference]: Without dead ends: 914 [2018-04-10 15:06:09,833 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 15:06:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2018-04-10 15:06:09,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 720. [2018-04-10 15:06:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-04-10 15:06:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 889 transitions. [2018-04-10 15:06:09,839 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 889 transitions. Word has length 467 [2018-04-10 15:06:09,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:09,840 INFO L459 AbstractCegarLoop]: Abstraction has 720 states and 889 transitions. [2018-04-10 15:06:09,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-10 15:06:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 889 transitions. [2018-04-10 15:06:09,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-04-10 15:06:09,842 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:09,842 INFO L355 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 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-10 15:06:09,842 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:09,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1429119042, now seen corresponding path program 33 times [2018-04-10 15:06:09,842 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:09,869 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 4235 refuted. 0 times theorem prover too weak. 3640 trivial. 0 not checked. [2018-04-10 15:06:10,639 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:10,639 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-10 15:06:10,639 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3072 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3072 trivial. 0 not checked. [2018-04-10 15:06:10,640 INFO L182 omatonBuilderFactory]: Interpolants [33792#(<= main_~i~1 34), 33793#(<= main_~i~1 35), 33756#true, 33757#false, 33758#(= main_~i~1 0), 33759#(<= main_~i~1 1), 33760#(<= main_~i~1 2), 33761#(<= main_~i~1 3), 33762#(<= main_~i~1 4), 33763#(<= main_~i~1 5), 33764#(<= main_~i~1 6), 33765#(<= main_~i~1 7), 33766#(<= main_~i~1 8), 33767#(<= main_~i~1 9), 33768#(<= main_~i~1 10), 33769#(<= main_~i~1 11), 33770#(<= main_~i~1 12), 33771#(<= main_~i~1 13), 33772#(<= main_~i~1 14), 33773#(<= main_~i~1 15), 33774#(<= main_~i~1 16), 33775#(<= main_~i~1 17), 33776#(<= main_~i~1 18), 33777#(<= main_~i~1 19), 33778#(<= main_~i~1 20), 33779#(<= main_~i~1 21), 33780#(<= main_~i~1 22), 33781#(<= main_~i~1 23), 33782#(<= main_~i~1 24), 33783#(<= main_~i~1 25), 33784#(<= main_~i~1 26), 33785#(<= main_~i~1 27), 33786#(<= main_~i~1 28), 33787#(<= main_~i~1 29), 33788#(<= main_~i~1 30), 33789#(<= main_~i~1 31), 33790#(<= main_~i~1 32), 33791#(<= main_~i~1 33)] [2018-04-10 15:06:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 4235 refuted. 0 times theorem prover too weak. 3640 trivial. 0 not checked. [2018-04-10 15:06:10,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-10 15:06:10,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-10 15:06:10,640 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 15:06:10,641 INFO L87 Difference]: Start difference. First operand 720 states and 889 transitions. Second operand 38 states. [2018-04-10 15:06:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:11,076 INFO L93 Difference]: Finished difference Result 938 states and 1081 transitions. [2018-04-10 15:06:11,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 15:06:11,076 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 480 [2018-04-10 15:06:11,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:11,078 INFO L225 Difference]: With dead ends: 938 [2018-04-10 15:06:11,078 INFO L226 Difference]: Without dead ends: 938 [2018-04-10 15:06:11,078 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 15:06:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-04-10 15:06:11,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 739. [2018-04-10 15:06:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2018-04-10 15:06:11,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 913 transitions. [2018-04-10 15:06:11,084 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 913 transitions. Word has length 480 [2018-04-10 15:06:11,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:11,085 INFO L459 AbstractCegarLoop]: Abstraction has 739 states and 913 transitions. [2018-04-10 15:06:11,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-10 15:06:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 913 transitions. [2018-04-10 15:06:11,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2018-04-10 15:06:11,087 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:11,087 INFO L355 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 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-10 15:06:11,087 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:11,088 INFO L82 PathProgramCache]: Analyzing trace with hash 310400740, now seen corresponding path program 34 times [2018-04-10 15:06:11,088 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:11,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8334 backedges. 0 proven. 4482 refuted. 0 times theorem prover too weak. 3852 trivial. 0 not checked. [2018-04-10 15:06:11,883 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:11,883 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-10 15:06:11,883 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3267 trivial. 0 not checked. [2018-04-10 15:06:11,883 INFO L182 omatonBuilderFactory]: Interpolants [35471#true, 35472#false, 35473#(= main_~i~1 0), 35474#(<= main_~i~1 1), 35475#(<= main_~i~1 2), 35476#(<= main_~i~1 3), 35477#(<= main_~i~1 4), 35478#(<= main_~i~1 5), 35479#(<= main_~i~1 6), 35480#(<= main_~i~1 7), 35481#(<= main_~i~1 8), 35482#(<= main_~i~1 9), 35483#(<= main_~i~1 10), 35484#(<= main_~i~1 11), 35485#(<= main_~i~1 12), 35486#(<= main_~i~1 13), 35487#(<= main_~i~1 14), 35488#(<= main_~i~1 15), 35489#(<= main_~i~1 16), 35490#(<= main_~i~1 17), 35491#(<= main_~i~1 18), 35492#(<= main_~i~1 19), 35493#(<= main_~i~1 20), 35494#(<= main_~i~1 21), 35495#(<= main_~i~1 22), 35496#(<= main_~i~1 23), 35497#(<= main_~i~1 24), 35498#(<= main_~i~1 25), 35499#(<= main_~i~1 26), 35500#(<= main_~i~1 27), 35501#(<= main_~i~1 28), 35502#(<= main_~i~1 29), 35503#(<= main_~i~1 30), 35504#(<= main_~i~1 31), 35505#(<= main_~i~1 32), 35506#(<= main_~i~1 33), 35507#(<= main_~i~1 34), 35508#(<= main_~i~1 35), 35509#(<= main_~i~1 36)] [2018-04-10 15:06:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8334 backedges. 0 proven. 4482 refuted. 0 times theorem prover too weak. 3852 trivial. 0 not checked. [2018-04-10 15:06:11,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 15:06:11,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 15:06:11,885 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 15:06:11,885 INFO L87 Difference]: Start difference. First operand 739 states and 913 transitions. Second operand 39 states. [2018-04-10 15:06:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:12,405 INFO L93 Difference]: Finished difference Result 962 states and 1109 transitions. [2018-04-10 15:06:12,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-10 15:06:12,405 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 493 [2018-04-10 15:06:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:12,408 INFO L225 Difference]: With dead ends: 962 [2018-04-10 15:06:12,408 INFO L226 Difference]: Without dead ends: 962 [2018-04-10 15:06:12,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 15:06:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2018-04-10 15:06:12,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 758. [2018-04-10 15:06:12,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2018-04-10 15:06:12,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 937 transitions. [2018-04-10 15:06:12,414 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 937 transitions. Word has length 493 [2018-04-10 15:06:12,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:12,415 INFO L459 AbstractCegarLoop]: Abstraction has 758 states and 937 transitions. [2018-04-10 15:06:12,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 15:06:12,415 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 937 transitions. [2018-04-10 15:06:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-04-10 15:06:12,417 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:12,417 INFO L355 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 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-10 15:06:12,417 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:12,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1710838402, now seen corresponding path program 35 times [2018-04-10 15:06:12,418 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:12,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8806 backedges. 0 proven. 4736 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-04-10 15:06:13,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:13,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-10 15:06:13,311 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3468 trivial. 0 not checked. [2018-04-10 15:06:13,312 INFO L182 omatonBuilderFactory]: Interpolants [37248#(<= main_~i~1 16), 37249#(<= main_~i~1 17), 37250#(<= main_~i~1 18), 37251#(<= main_~i~1 19), 37252#(<= main_~i~1 20), 37253#(<= main_~i~1 21), 37254#(<= main_~i~1 22), 37255#(<= main_~i~1 23), 37256#(<= main_~i~1 24), 37257#(<= main_~i~1 25), 37258#(<= main_~i~1 26), 37259#(<= main_~i~1 27), 37260#(<= main_~i~1 28), 37261#(<= main_~i~1 29), 37262#(<= main_~i~1 30), 37263#(<= main_~i~1 31), 37264#(<= main_~i~1 32), 37265#(<= main_~i~1 33), 37266#(<= main_~i~1 34), 37267#(<= main_~i~1 35), 37268#(<= main_~i~1 36), 37269#(<= main_~i~1 37), 37230#true, 37231#false, 37232#(= main_~i~1 0), 37233#(<= main_~i~1 1), 37234#(<= main_~i~1 2), 37235#(<= main_~i~1 3), 37236#(<= main_~i~1 4), 37237#(<= main_~i~1 5), 37238#(<= main_~i~1 6), 37239#(<= main_~i~1 7), 37240#(<= main_~i~1 8), 37241#(<= main_~i~1 9), 37242#(<= main_~i~1 10), 37243#(<= main_~i~1 11), 37244#(<= main_~i~1 12), 37245#(<= main_~i~1 13), 37246#(<= main_~i~1 14), 37247#(<= main_~i~1 15)] [2018-04-10 15:06:13,312 INFO L134 CoverageAnalysis]: Checked inductivity of 8806 backedges. 0 proven. 4736 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2018-04-10 15:06:13,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-10 15:06:13,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-10 15:06:13,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 15:06:13,313 INFO L87 Difference]: Start difference. First operand 758 states and 937 transitions. Second operand 40 states. [2018-04-10 15:06:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:13,716 INFO L93 Difference]: Finished difference Result 986 states and 1137 transitions. [2018-04-10 15:06:13,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 15:06:13,716 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 506 [2018-04-10 15:06:13,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:13,718 INFO L225 Difference]: With dead ends: 986 [2018-04-10 15:06:13,719 INFO L226 Difference]: Without dead ends: 986 [2018-04-10 15:06:13,719 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 15:06:13,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-04-10 15:06:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 777. [2018-04-10 15:06:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2018-04-10 15:06:13,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 961 transitions. [2018-04-10 15:06:13,727 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 961 transitions. Word has length 506 [2018-04-10 15:06:13,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:13,728 INFO L459 AbstractCegarLoop]: Abstraction has 777 states and 961 transitions. [2018-04-10 15:06:13,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-10 15:06:13,728 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 961 transitions. [2018-04-10 15:06:13,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-04-10 15:06:13,730 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:13,730 INFO L355 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 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-10 15:06:13,730 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:13,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1567056164, now seen corresponding path program 36 times [2018-04-10 15:06:13,731 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:13,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9291 backedges. 0 proven. 4997 refuted. 0 times theorem prover too weak. 4294 trivial. 0 not checked. [2018-04-10 15:06:14,718 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:14,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-10 15:06:14,718 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-04-10 15:06:14,719 INFO L182 omatonBuilderFactory]: Interpolants [39040#(<= main_~i~1 5), 39041#(<= main_~i~1 6), 39042#(<= main_~i~1 7), 39043#(<= main_~i~1 8), 39044#(<= main_~i~1 9), 39045#(<= main_~i~1 10), 39046#(<= main_~i~1 11), 39047#(<= main_~i~1 12), 39048#(<= main_~i~1 13), 39049#(<= main_~i~1 14), 39050#(<= main_~i~1 15), 39051#(<= main_~i~1 16), 39052#(<= main_~i~1 17), 39053#(<= main_~i~1 18), 39054#(<= main_~i~1 19), 39055#(<= main_~i~1 20), 39056#(<= main_~i~1 21), 39057#(<= main_~i~1 22), 39058#(<= main_~i~1 23), 39059#(<= main_~i~1 24), 39060#(<= main_~i~1 25), 39061#(<= main_~i~1 26), 39062#(<= main_~i~1 27), 39063#(<= main_~i~1 28), 39064#(<= main_~i~1 29), 39065#(<= main_~i~1 30), 39066#(<= main_~i~1 31), 39067#(<= main_~i~1 32), 39068#(<= main_~i~1 33), 39069#(<= main_~i~1 34), 39070#(<= main_~i~1 35), 39071#(<= main_~i~1 36), 39072#(<= main_~i~1 37), 39073#(<= main_~i~1 38), 39033#true, 39034#false, 39035#(= main_~i~1 0), 39036#(<= main_~i~1 1), 39037#(<= main_~i~1 2), 39038#(<= main_~i~1 3), 39039#(<= main_~i~1 4)] [2018-04-10 15:06:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9291 backedges. 0 proven. 4997 refuted. 0 times theorem prover too weak. 4294 trivial. 0 not checked. [2018-04-10 15:06:14,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 15:06:14,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 15:06:14,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 15:06:14,720 INFO L87 Difference]: Start difference. First operand 777 states and 961 transitions. Second operand 41 states. [2018-04-10 15:06:15,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:15,194 INFO L93 Difference]: Finished difference Result 1010 states and 1165 transitions. [2018-04-10 15:06:15,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 15:06:15,194 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 519 [2018-04-10 15:06:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:15,196 INFO L225 Difference]: With dead ends: 1010 [2018-04-10 15:06:15,196 INFO L226 Difference]: Without dead ends: 1010 [2018-04-10 15:06:15,197 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 15:06:15,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2018-04-10 15:06:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 796. [2018-04-10 15:06:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2018-04-10 15:06:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 985 transitions. [2018-04-10 15:06:15,204 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 985 transitions. Word has length 519 [2018-04-10 15:06:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:15,204 INFO L459 AbstractCegarLoop]: Abstraction has 796 states and 985 transitions. [2018-04-10 15:06:15,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 15:06:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 985 transitions. [2018-04-10 15:06:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-04-10 15:06:15,207 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:15,207 INFO L355 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 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-10 15:06:15,207 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:15,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1613608130, now seen corresponding path program 37 times [2018-04-10 15:06:15,207 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:15,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9789 backedges. 0 proven. 5265 refuted. 0 times theorem prover too weak. 4524 trivial. 0 not checked. [2018-04-10 15:06:16,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:16,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-04-10 15:06:16,130 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3888 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3888 trivial. 0 not checked. [2018-04-10 15:06:16,131 INFO L182 omatonBuilderFactory]: Interpolants [40896#(<= main_~i~1 14), 40897#(<= main_~i~1 15), 40898#(<= main_~i~1 16), 40899#(<= main_~i~1 17), 40900#(<= main_~i~1 18), 40901#(<= main_~i~1 19), 40902#(<= main_~i~1 20), 40903#(<= main_~i~1 21), 40904#(<= main_~i~1 22), 40905#(<= main_~i~1 23), 40906#(<= main_~i~1 24), 40907#(<= main_~i~1 25), 40908#(<= main_~i~1 26), 40909#(<= main_~i~1 27), 40910#(<= main_~i~1 28), 40911#(<= main_~i~1 29), 40912#(<= main_~i~1 30), 40913#(<= main_~i~1 31), 40914#(<= main_~i~1 32), 40915#(<= main_~i~1 33), 40916#(<= main_~i~1 34), 40917#(<= main_~i~1 35), 40918#(<= main_~i~1 36), 40919#(<= main_~i~1 37), 40920#(<= main_~i~1 38), 40921#(<= main_~i~1 39), 40880#true, 40881#false, 40882#(= main_~i~1 0), 40883#(<= main_~i~1 1), 40884#(<= main_~i~1 2), 40885#(<= main_~i~1 3), 40886#(<= main_~i~1 4), 40887#(<= main_~i~1 5), 40888#(<= main_~i~1 6), 40889#(<= main_~i~1 7), 40890#(<= main_~i~1 8), 40891#(<= main_~i~1 9), 40892#(<= main_~i~1 10), 40893#(<= main_~i~1 11), 40894#(<= main_~i~1 12), 40895#(<= main_~i~1 13)] [2018-04-10 15:06:16,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9789 backedges. 0 proven. 5265 refuted. 0 times theorem prover too weak. 4524 trivial. 0 not checked. [2018-04-10 15:06:16,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-10 15:06:16,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-10 15:06:16,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 15:06:16,132 INFO L87 Difference]: Start difference. First operand 796 states and 985 transitions. Second operand 42 states. [2018-04-10 15:06:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:16,583 INFO L93 Difference]: Finished difference Result 1034 states and 1193 transitions. [2018-04-10 15:06:16,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-10 15:06:16,583 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 532 [2018-04-10 15:06:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:16,585 INFO L225 Difference]: With dead ends: 1034 [2018-04-10 15:06:16,585 INFO L226 Difference]: Without dead ends: 1034 [2018-04-10 15:06:16,586 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 15:06:16,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2018-04-10 15:06:16,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 815. [2018-04-10 15:06:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-04-10 15:06:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1009 transitions. [2018-04-10 15:06:16,592 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1009 transitions. Word has length 532 [2018-04-10 15:06:16,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:16,593 INFO L459 AbstractCegarLoop]: Abstraction has 815 states and 1009 transitions. [2018-04-10 15:06:16,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-10 15:06:16,593 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1009 transitions. [2018-04-10 15:06:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-04-10 15:06:16,595 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:16,595 INFO L355 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 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-10 15:06:16,595 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:16,595 INFO L82 PathProgramCache]: Analyzing trace with hash -998630556, now seen corresponding path program 38 times [2018-04-10 15:06:16,596 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:16,622 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 10300 backedges. 0 proven. 5540 refuted. 0 times theorem prover too weak. 4760 trivial. 0 not checked. [2018-04-10 15:06:17,612 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:17,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-10 15:06:17,612 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4107 trivial. 0 not checked. [2018-04-10 15:06:17,612 INFO L182 omatonBuilderFactory]: Interpolants [42771#true, 42772#false, 42773#(= main_~i~1 0), 42774#(<= main_~i~1 1), 42775#(<= main_~i~1 2), 42776#(<= main_~i~1 3), 42777#(<= main_~i~1 4), 42778#(<= main_~i~1 5), 42779#(<= main_~i~1 6), 42780#(<= main_~i~1 7), 42781#(<= main_~i~1 8), 42782#(<= main_~i~1 9), 42783#(<= main_~i~1 10), 42784#(<= main_~i~1 11), 42785#(<= main_~i~1 12), 42786#(<= main_~i~1 13), 42787#(<= main_~i~1 14), 42788#(<= main_~i~1 15), 42789#(<= main_~i~1 16), 42790#(<= main_~i~1 17), 42791#(<= main_~i~1 18), 42792#(<= main_~i~1 19), 42793#(<= main_~i~1 20), 42794#(<= main_~i~1 21), 42795#(<= main_~i~1 22), 42796#(<= main_~i~1 23), 42797#(<= main_~i~1 24), 42798#(<= main_~i~1 25), 42799#(<= main_~i~1 26), 42800#(<= main_~i~1 27), 42801#(<= main_~i~1 28), 42802#(<= main_~i~1 29), 42803#(<= main_~i~1 30), 42804#(<= main_~i~1 31), 42805#(<= main_~i~1 32), 42806#(<= main_~i~1 33), 42807#(<= main_~i~1 34), 42808#(<= main_~i~1 35), 42809#(<= main_~i~1 36), 42810#(<= main_~i~1 37), 42811#(<= main_~i~1 38), 42812#(<= main_~i~1 39), 42813#(<= main_~i~1 40)] [2018-04-10 15:06:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10300 backedges. 0 proven. 5540 refuted. 0 times theorem prover too weak. 4760 trivial. 0 not checked. [2018-04-10 15:06:17,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-04-10 15:06:17,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-04-10 15:06:17,614 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 15:06:17,614 INFO L87 Difference]: Start difference. First operand 815 states and 1009 transitions. Second operand 43 states. [2018-04-10 15:06:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:18,228 INFO L93 Difference]: Finished difference Result 1058 states and 1221 transitions. [2018-04-10 15:06:18,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-10 15:06:18,228 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 545 [2018-04-10 15:06:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:18,231 INFO L225 Difference]: With dead ends: 1058 [2018-04-10 15:06:18,231 INFO L226 Difference]: Without dead ends: 1058 [2018-04-10 15:06:18,231 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-04-10 15:06:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2018-04-10 15:06:18,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 834. [2018-04-10 15:06:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2018-04-10 15:06:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1033 transitions. [2018-04-10 15:06:18,238 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1033 transitions. Word has length 545 [2018-04-10 15:06:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:18,239 INFO L459 AbstractCegarLoop]: Abstraction has 834 states and 1033 transitions. [2018-04-10 15:06:18,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-04-10 15:06:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1033 transitions. [2018-04-10 15:06:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-04-10 15:06:18,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:18,242 INFO L355 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 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-10 15:06:18,242 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:18,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1643133182, now seen corresponding path program 39 times [2018-04-10 15:06:18,242 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:18,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:19,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10824 backedges. 0 proven. 5822 refuted. 0 times theorem prover too weak. 5002 trivial. 0 not checked. [2018-04-10 15:06:19,271 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:19,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-10 15:06:19,271 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4332 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4332 trivial. 0 not checked. [2018-04-10 15:06:19,272 INFO L182 omatonBuilderFactory]: Interpolants [44736#(<= main_~i~1 28), 44737#(<= main_~i~1 29), 44738#(<= main_~i~1 30), 44739#(<= main_~i~1 31), 44740#(<= main_~i~1 32), 44741#(<= main_~i~1 33), 44742#(<= main_~i~1 34), 44743#(<= main_~i~1 35), 44744#(<= main_~i~1 36), 44745#(<= main_~i~1 37), 44746#(<= main_~i~1 38), 44747#(<= main_~i~1 39), 44748#(<= main_~i~1 40), 44749#(<= main_~i~1 41), 44706#true, 44707#false, 44708#(= main_~i~1 0), 44709#(<= main_~i~1 1), 44710#(<= main_~i~1 2), 44711#(<= main_~i~1 3), 44712#(<= main_~i~1 4), 44713#(<= main_~i~1 5), 44714#(<= main_~i~1 6), 44715#(<= main_~i~1 7), 44716#(<= main_~i~1 8), 44717#(<= main_~i~1 9), 44718#(<= main_~i~1 10), 44719#(<= main_~i~1 11), 44720#(<= main_~i~1 12), 44721#(<= main_~i~1 13), 44722#(<= main_~i~1 14), 44723#(<= main_~i~1 15), 44724#(<= main_~i~1 16), 44725#(<= main_~i~1 17), 44726#(<= main_~i~1 18), 44727#(<= main_~i~1 19), 44728#(<= main_~i~1 20), 44729#(<= main_~i~1 21), 44730#(<= main_~i~1 22), 44731#(<= main_~i~1 23), 44732#(<= main_~i~1 24), 44733#(<= main_~i~1 25), 44734#(<= main_~i~1 26), 44735#(<= main_~i~1 27)] [2018-04-10 15:06:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10824 backedges. 0 proven. 5822 refuted. 0 times theorem prover too weak. 5002 trivial. 0 not checked. [2018-04-10 15:06:19,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 15:06:19,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 15:06:19,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 15:06:19,273 INFO L87 Difference]: Start difference. First operand 834 states and 1033 transitions. Second operand 44 states. [2018-04-10 15:06:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:19,717 INFO L93 Difference]: Finished difference Result 1082 states and 1249 transitions. [2018-04-10 15:06:19,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-10 15:06:19,717 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 558 [2018-04-10 15:06:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:19,720 INFO L225 Difference]: With dead ends: 1082 [2018-04-10 15:06:19,720 INFO L226 Difference]: Without dead ends: 1082 [2018-04-10 15:06:19,720 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 15:06:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2018-04-10 15:06:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 853. [2018-04-10 15:06:19,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-04-10 15:06:19,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1057 transitions. [2018-04-10 15:06:19,726 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1057 transitions. Word has length 558 [2018-04-10 15:06:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:19,727 INFO L459 AbstractCegarLoop]: Abstraction has 853 states and 1057 transitions. [2018-04-10 15:06:19,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 15:06:19,727 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1057 transitions. [2018-04-10 15:06:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-04-10 15:06:19,729 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:19,729 INFO L355 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 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-10 15:06:19,730 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:19,730 INFO L82 PathProgramCache]: Analyzing trace with hash -746814044, now seen corresponding path program 40 times [2018-04-10 15:06:19,730 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:19,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 11361 backedges. 0 proven. 6111 refuted. 0 times theorem prover too weak. 5250 trivial. 0 not checked. [2018-04-10 15:06:20,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:20,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-04-10 15:06:20,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4563 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4563 trivial. 0 not checked. [2018-04-10 15:06:20,815 INFO L182 omatonBuilderFactory]: Interpolants [46720#(<= main_~i~1 33), 46721#(<= main_~i~1 34), 46722#(<= main_~i~1 35), 46723#(<= main_~i~1 36), 46724#(<= main_~i~1 37), 46725#(<= main_~i~1 38), 46726#(<= main_~i~1 39), 46727#(<= main_~i~1 40), 46728#(<= main_~i~1 41), 46729#(<= main_~i~1 42), 46685#true, 46686#false, 46687#(= main_~i~1 0), 46688#(<= main_~i~1 1), 46689#(<= main_~i~1 2), 46690#(<= main_~i~1 3), 46691#(<= main_~i~1 4), 46692#(<= main_~i~1 5), 46693#(<= main_~i~1 6), 46694#(<= main_~i~1 7), 46695#(<= main_~i~1 8), 46696#(<= main_~i~1 9), 46697#(<= main_~i~1 10), 46698#(<= main_~i~1 11), 46699#(<= main_~i~1 12), 46700#(<= main_~i~1 13), 46701#(<= main_~i~1 14), 46702#(<= main_~i~1 15), 46703#(<= main_~i~1 16), 46704#(<= main_~i~1 17), 46705#(<= main_~i~1 18), 46706#(<= main_~i~1 19), 46707#(<= main_~i~1 20), 46708#(<= main_~i~1 21), 46709#(<= main_~i~1 22), 46710#(<= main_~i~1 23), 46711#(<= main_~i~1 24), 46712#(<= main_~i~1 25), 46713#(<= main_~i~1 26), 46714#(<= main_~i~1 27), 46715#(<= main_~i~1 28), 46716#(<= main_~i~1 29), 46717#(<= main_~i~1 30), 46718#(<= main_~i~1 31), 46719#(<= main_~i~1 32)] [2018-04-10 15:06:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 11361 backedges. 0 proven. 6111 refuted. 0 times theorem prover too weak. 5250 trivial. 0 not checked. [2018-04-10 15:06:20,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-10 15:06:20,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-10 15:06:20,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 15:06:20,817 INFO L87 Difference]: Start difference. First operand 853 states and 1057 transitions. Second operand 45 states. [2018-04-10 15:06:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:21,359 INFO L93 Difference]: Finished difference Result 1106 states and 1277 transitions. [2018-04-10 15:06:21,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-10 15:06:21,360 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 571 [2018-04-10 15:06:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:21,362 INFO L225 Difference]: With dead ends: 1106 [2018-04-10 15:06:21,362 INFO L226 Difference]: Without dead ends: 1106 [2018-04-10 15:06:21,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 15:06:21,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2018-04-10 15:06:21,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 872. [2018-04-10 15:06:21,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-04-10 15:06:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1081 transitions. [2018-04-10 15:06:21,369 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1081 transitions. Word has length 571 [2018-04-10 15:06:21,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:21,369 INFO L459 AbstractCegarLoop]: Abstraction has 872 states and 1081 transitions. [2018-04-10 15:06:21,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-10 15:06:21,370 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1081 transitions. [2018-04-10 15:06:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2018-04-10 15:06:21,372 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:21,372 INFO L355 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 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-10 15:06:21,372 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:21,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1826851138, now seen corresponding path program 41 times [2018-04-10 15:06:21,373 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:21,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:22,488 INFO L134 CoverageAnalysis]: Checked inductivity of 11911 backedges. 0 proven. 6407 refuted. 0 times theorem prover too weak. 5504 trivial. 0 not checked. [2018-04-10 15:06:22,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:22,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-10 15:06:22,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4800 trivial. 0 not checked. [2018-04-10 15:06:22,489 INFO L182 omatonBuilderFactory]: Interpolants [48708#true, 48709#false, 48710#(= main_~i~1 0), 48711#(<= main_~i~1 1), 48712#(<= main_~i~1 2), 48713#(<= main_~i~1 3), 48714#(<= main_~i~1 4), 48715#(<= main_~i~1 5), 48716#(<= main_~i~1 6), 48717#(<= main_~i~1 7), 48718#(<= main_~i~1 8), 48719#(<= main_~i~1 9), 48720#(<= main_~i~1 10), 48721#(<= main_~i~1 11), 48722#(<= main_~i~1 12), 48723#(<= main_~i~1 13), 48724#(<= main_~i~1 14), 48725#(<= main_~i~1 15), 48726#(<= main_~i~1 16), 48727#(<= main_~i~1 17), 48728#(<= main_~i~1 18), 48729#(<= main_~i~1 19), 48730#(<= main_~i~1 20), 48731#(<= main_~i~1 21), 48732#(<= main_~i~1 22), 48733#(<= main_~i~1 23), 48734#(<= main_~i~1 24), 48735#(<= main_~i~1 25), 48736#(<= main_~i~1 26), 48737#(<= main_~i~1 27), 48738#(<= main_~i~1 28), 48739#(<= main_~i~1 29), 48740#(<= main_~i~1 30), 48741#(<= main_~i~1 31), 48742#(<= main_~i~1 32), 48743#(<= main_~i~1 33), 48744#(<= main_~i~1 34), 48745#(<= main_~i~1 35), 48746#(<= main_~i~1 36), 48747#(<= main_~i~1 37), 48748#(<= main_~i~1 38), 48749#(<= main_~i~1 39), 48750#(<= main_~i~1 40), 48751#(<= main_~i~1 41), 48752#(<= main_~i~1 42), 48753#(<= main_~i~1 43)] [2018-04-10 15:06:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11911 backedges. 0 proven. 6407 refuted. 0 times theorem prover too weak. 5504 trivial. 0 not checked. [2018-04-10 15:06:22,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-10 15:06:22,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-10 15:06:22,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 15:06:22,490 INFO L87 Difference]: Start difference. First operand 872 states and 1081 transitions. Second operand 46 states. [2018-04-10 15:06:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:23,168 INFO L93 Difference]: Finished difference Result 1130 states and 1305 transitions. [2018-04-10 15:06:23,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-10 15:06:23,169 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 584 [2018-04-10 15:06:23,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:23,173 INFO L225 Difference]: With dead ends: 1130 [2018-04-10 15:06:23,173 INFO L226 Difference]: Without dead ends: 1130 [2018-04-10 15:06:23,173 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-04-10 15:06:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2018-04-10 15:06:23,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 891. [2018-04-10 15:06:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-04-10 15:06:23,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1105 transitions. [2018-04-10 15:06:23,182 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1105 transitions. Word has length 584 [2018-04-10 15:06:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:23,182 INFO L459 AbstractCegarLoop]: Abstraction has 891 states and 1105 transitions. [2018-04-10 15:06:23,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-10 15:06:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1105 transitions. [2018-04-10 15:06:23,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2018-04-10 15:06:23,185 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:23,185 INFO L355 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 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-10 15:06:23,185 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:23,186 INFO L82 PathProgramCache]: Analyzing trace with hash 691183588, now seen corresponding path program 42 times [2018-04-10 15:06:23,186 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:23,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12474 backedges. 0 proven. 6710 refuted. 0 times theorem prover too weak. 5764 trivial. 0 not checked. [2018-04-10 15:06:24,337 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:24,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-10 15:06:24,337 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5043 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5043 trivial. 0 not checked. [2018-04-10 15:06:24,337 INFO L182 omatonBuilderFactory]: Interpolants [50816#(<= main_~i~1 39), 50817#(<= main_~i~1 40), 50818#(<= main_~i~1 41), 50819#(<= main_~i~1 42), 50820#(<= main_~i~1 43), 50821#(<= main_~i~1 44), 50775#true, 50776#false, 50777#(= main_~i~1 0), 50778#(<= main_~i~1 1), 50779#(<= main_~i~1 2), 50780#(<= main_~i~1 3), 50781#(<= main_~i~1 4), 50782#(<= main_~i~1 5), 50783#(<= main_~i~1 6), 50784#(<= main_~i~1 7), 50785#(<= main_~i~1 8), 50786#(<= main_~i~1 9), 50787#(<= main_~i~1 10), 50788#(<= main_~i~1 11), 50789#(<= main_~i~1 12), 50790#(<= main_~i~1 13), 50791#(<= main_~i~1 14), 50792#(<= main_~i~1 15), 50793#(<= main_~i~1 16), 50794#(<= main_~i~1 17), 50795#(<= main_~i~1 18), 50796#(<= main_~i~1 19), 50797#(<= main_~i~1 20), 50798#(<= main_~i~1 21), 50799#(<= main_~i~1 22), 50800#(<= main_~i~1 23), 50801#(<= main_~i~1 24), 50802#(<= main_~i~1 25), 50803#(<= main_~i~1 26), 50804#(<= main_~i~1 27), 50805#(<= main_~i~1 28), 50806#(<= main_~i~1 29), 50807#(<= main_~i~1 30), 50808#(<= main_~i~1 31), 50809#(<= main_~i~1 32), 50810#(<= main_~i~1 33), 50811#(<= main_~i~1 34), 50812#(<= main_~i~1 35), 50813#(<= main_~i~1 36), 50814#(<= main_~i~1 37), 50815#(<= main_~i~1 38)] [2018-04-10 15:06:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12474 backedges. 0 proven. 6710 refuted. 0 times theorem prover too weak. 5764 trivial. 0 not checked. [2018-04-10 15:06:24,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-10 15:06:24,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-10 15:06:24,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 15:06:24,338 INFO L87 Difference]: Start difference. First operand 891 states and 1105 transitions. Second operand 47 states. [2018-04-10 15:06:24,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:24,915 INFO L93 Difference]: Finished difference Result 1154 states and 1333 transitions. [2018-04-10 15:06:24,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 15:06:24,942 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 597 [2018-04-10 15:06:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:24,946 INFO L225 Difference]: With dead ends: 1154 [2018-04-10 15:06:24,946 INFO L226 Difference]: Without dead ends: 1154 [2018-04-10 15:06:24,946 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 15:06:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2018-04-10 15:06:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 910. [2018-04-10 15:06:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2018-04-10 15:06:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 1129 transitions. [2018-04-10 15:06:24,956 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 1129 transitions. Word has length 597 [2018-04-10 15:06:24,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:24,956 INFO L459 AbstractCegarLoop]: Abstraction has 910 states and 1129 transitions. [2018-04-10 15:06:24,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-10 15:06:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 1129 transitions. [2018-04-10 15:06:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2018-04-10 15:06:24,959 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:24,959 INFO L355 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 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-10 15:06:24,959 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:24,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1290599298, now seen corresponding path program 43 times [2018-04-10 15:06:24,960 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:24,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 13050 backedges. 0 proven. 7020 refuted. 0 times theorem prover too weak. 6030 trivial. 0 not checked. [2018-04-10 15:06:26,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:26,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-04-10 15:06:26,160 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5292 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5292 trivial. 0 not checked. [2018-04-10 15:06:26,160 INFO L182 omatonBuilderFactory]: Interpolants [52928#(<= main_~i~1 40), 52929#(<= main_~i~1 41), 52930#(<= main_~i~1 42), 52931#(<= main_~i~1 43), 52932#(<= main_~i~1 44), 52933#(<= main_~i~1 45), 52886#true, 52887#false, 52888#(= main_~i~1 0), 52889#(<= main_~i~1 1), 52890#(<= main_~i~1 2), 52891#(<= main_~i~1 3), 52892#(<= main_~i~1 4), 52893#(<= main_~i~1 5), 52894#(<= main_~i~1 6), 52895#(<= main_~i~1 7), 52896#(<= main_~i~1 8), 52897#(<= main_~i~1 9), 52898#(<= main_~i~1 10), 52899#(<= main_~i~1 11), 52900#(<= main_~i~1 12), 52901#(<= main_~i~1 13), 52902#(<= main_~i~1 14), 52903#(<= main_~i~1 15), 52904#(<= main_~i~1 16), 52905#(<= main_~i~1 17), 52906#(<= main_~i~1 18), 52907#(<= main_~i~1 19), 52908#(<= main_~i~1 20), 52909#(<= main_~i~1 21), 52910#(<= main_~i~1 22), 52911#(<= main_~i~1 23), 52912#(<= main_~i~1 24), 52913#(<= main_~i~1 25), 52914#(<= main_~i~1 26), 52915#(<= main_~i~1 27), 52916#(<= main_~i~1 28), 52917#(<= main_~i~1 29), 52918#(<= main_~i~1 30), 52919#(<= main_~i~1 31), 52920#(<= main_~i~1 32), 52921#(<= main_~i~1 33), 52922#(<= main_~i~1 34), 52923#(<= main_~i~1 35), 52924#(<= main_~i~1 36), 52925#(<= main_~i~1 37), 52926#(<= main_~i~1 38), 52927#(<= main_~i~1 39)] [2018-04-10 15:06:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 13050 backedges. 0 proven. 7020 refuted. 0 times theorem prover too weak. 6030 trivial. 0 not checked. [2018-04-10 15:06:26,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-10 15:06:26,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-10 15:06:26,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 15:06:26,161 INFO L87 Difference]: Start difference. First operand 910 states and 1129 transitions. Second operand 48 states. [2018-04-10 15:06:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:26,885 INFO L93 Difference]: Finished difference Result 1178 states and 1361 transitions. [2018-04-10 15:06:26,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-10 15:06:26,885 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 610 [2018-04-10 15:06:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:26,888 INFO L225 Difference]: With dead ends: 1178 [2018-04-10 15:06:26,888 INFO L226 Difference]: Without dead ends: 1178 [2018-04-10 15:06:26,888 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 15:06:26,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-04-10 15:06:26,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 929. [2018-04-10 15:06:26,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2018-04-10 15:06:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1153 transitions. [2018-04-10 15:06:26,896 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1153 transitions. Word has length 610 [2018-04-10 15:06:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:26,897 INFO L459 AbstractCegarLoop]: Abstraction has 929 states and 1153 transitions. [2018-04-10 15:06:26,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-10 15:06:26,897 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1153 transitions. [2018-04-10 15:06:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2018-04-10 15:06:26,899 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:26,900 INFO L355 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 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-10 15:06:26,900 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:26,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1218418140, now seen corresponding path program 44 times [2018-04-10 15:06:26,900 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:26,927 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 13639 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 6302 trivial. 0 not checked. [2018-04-10 15:06:28,189 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:28,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-10 15:06:28,189 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5547 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5547 trivial. 0 not checked. [2018-04-10 15:06:28,190 INFO L182 omatonBuilderFactory]: Interpolants [55041#true, 55042#false, 55043#(= main_~i~1 0), 55044#(<= main_~i~1 1), 55045#(<= main_~i~1 2), 55046#(<= main_~i~1 3), 55047#(<= main_~i~1 4), 55048#(<= main_~i~1 5), 55049#(<= main_~i~1 6), 55050#(<= main_~i~1 7), 55051#(<= main_~i~1 8), 55052#(<= main_~i~1 9), 55053#(<= main_~i~1 10), 55054#(<= main_~i~1 11), 55055#(<= main_~i~1 12), 55056#(<= main_~i~1 13), 55057#(<= main_~i~1 14), 55058#(<= main_~i~1 15), 55059#(<= main_~i~1 16), 55060#(<= main_~i~1 17), 55061#(<= main_~i~1 18), 55062#(<= main_~i~1 19), 55063#(<= main_~i~1 20), 55064#(<= main_~i~1 21), 55065#(<= main_~i~1 22), 55066#(<= main_~i~1 23), 55067#(<= main_~i~1 24), 55068#(<= main_~i~1 25), 55069#(<= main_~i~1 26), 55070#(<= main_~i~1 27), 55071#(<= main_~i~1 28), 55072#(<= main_~i~1 29), 55073#(<= main_~i~1 30), 55074#(<= main_~i~1 31), 55075#(<= main_~i~1 32), 55076#(<= main_~i~1 33), 55077#(<= main_~i~1 34), 55078#(<= main_~i~1 35), 55079#(<= main_~i~1 36), 55080#(<= main_~i~1 37), 55081#(<= main_~i~1 38), 55082#(<= main_~i~1 39), 55083#(<= main_~i~1 40), 55084#(<= main_~i~1 41), 55085#(<= main_~i~1 42), 55086#(<= main_~i~1 43), 55087#(<= main_~i~1 44), 55088#(<= main_~i~1 45), 55089#(<= main_~i~1 46)] [2018-04-10 15:06:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 13639 backedges. 0 proven. 7337 refuted. 0 times theorem prover too weak. 6302 trivial. 0 not checked. [2018-04-10 15:06:28,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-04-10 15:06:28,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-04-10 15:06:28,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 15:06:28,191 INFO L87 Difference]: Start difference. First operand 929 states and 1153 transitions. Second operand 49 states. [2018-04-10 15:06:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:28,907 INFO L93 Difference]: Finished difference Result 1202 states and 1389 transitions. [2018-04-10 15:06:28,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-04-10 15:06:28,908 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 623 [2018-04-10 15:06:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:28,911 INFO L225 Difference]: With dead ends: 1202 [2018-04-10 15:06:28,911 INFO L226 Difference]: Without dead ends: 1202 [2018-04-10 15:06:28,911 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 15:06:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2018-04-10 15:06:28,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 948. [2018-04-10 15:06:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2018-04-10 15:06:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1177 transitions. [2018-04-10 15:06:28,921 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1177 transitions. Word has length 623 [2018-04-10 15:06:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:28,922 INFO L459 AbstractCegarLoop]: Abstraction has 948 states and 1177 transitions. [2018-04-10 15:06:28,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-04-10 15:06:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1177 transitions. [2018-04-10 15:06:28,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2018-04-10 15:06:28,925 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:28,925 INFO L355 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 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-10 15:06:28,925 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:28,925 INFO L82 PathProgramCache]: Analyzing trace with hash -829431234, now seen corresponding path program 45 times [2018-04-10 15:06:28,926 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:28,958 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 14241 backedges. 0 proven. 7661 refuted. 0 times theorem prover too weak. 6580 trivial. 0 not checked. [2018-04-10 15:06:30,303 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:30,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-10 15:06:30,303 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5808 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5808 trivial. 0 not checked. [2018-04-10 15:06:30,304 INFO L182 omatonBuilderFactory]: Interpolants [57240#true, 57241#false, 57242#(= main_~i~1 0), 57243#(<= main_~i~1 1), 57244#(<= main_~i~1 2), 57245#(<= main_~i~1 3), 57246#(<= main_~i~1 4), 57247#(<= main_~i~1 5), 57248#(<= main_~i~1 6), 57249#(<= main_~i~1 7), 57250#(<= main_~i~1 8), 57251#(<= main_~i~1 9), 57252#(<= main_~i~1 10), 57253#(<= main_~i~1 11), 57254#(<= main_~i~1 12), 57255#(<= main_~i~1 13), 57256#(<= main_~i~1 14), 57257#(<= main_~i~1 15), 57258#(<= main_~i~1 16), 57259#(<= main_~i~1 17), 57260#(<= main_~i~1 18), 57261#(<= main_~i~1 19), 57262#(<= main_~i~1 20), 57263#(<= main_~i~1 21), 57264#(<= main_~i~1 22), 57265#(<= main_~i~1 23), 57266#(<= main_~i~1 24), 57267#(<= main_~i~1 25), 57268#(<= main_~i~1 26), 57269#(<= main_~i~1 27), 57270#(<= main_~i~1 28), 57271#(<= main_~i~1 29), 57272#(<= main_~i~1 30), 57273#(<= main_~i~1 31), 57274#(<= main_~i~1 32), 57275#(<= main_~i~1 33), 57276#(<= main_~i~1 34), 57277#(<= main_~i~1 35), 57278#(<= main_~i~1 36), 57279#(<= main_~i~1 37), 57280#(<= main_~i~1 38), 57281#(<= main_~i~1 39), 57282#(<= main_~i~1 40), 57283#(<= main_~i~1 41), 57284#(<= main_~i~1 42), 57285#(<= main_~i~1 43), 57286#(<= main_~i~1 44), 57287#(<= main_~i~1 45), 57288#(<= main_~i~1 46), 57289#(<= main_~i~1 47)] [2018-04-10 15:06:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 14241 backedges. 0 proven. 7661 refuted. 0 times theorem prover too weak. 6580 trivial. 0 not checked. [2018-04-10 15:06:30,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-10 15:06:30,305 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-10 15:06:30,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 15:06:30,305 INFO L87 Difference]: Start difference. First operand 948 states and 1177 transitions. Second operand 50 states. [2018-04-10 15:06:30,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:30,952 INFO L93 Difference]: Finished difference Result 1226 states and 1417 transitions. [2018-04-10 15:06:30,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-10 15:06:30,952 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 636 [2018-04-10 15:06:30,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:30,954 INFO L225 Difference]: With dead ends: 1226 [2018-04-10 15:06:30,954 INFO L226 Difference]: Without dead ends: 1226 [2018-04-10 15:06:30,954 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-04-10 15:06:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2018-04-10 15:06:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 967. [2018-04-10 15:06:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 967 states. [2018-04-10 15:06:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1201 transitions. [2018-04-10 15:06:30,961 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1201 transitions. Word has length 636 [2018-04-10 15:06:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:30,962 INFO L459 AbstractCegarLoop]: Abstraction has 967 states and 1201 transitions. [2018-04-10 15:06:30,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-10 15:06:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1201 transitions. [2018-04-10 15:06:30,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-04-10 15:06:30,965 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:30,965 INFO L355 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 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-10 15:06:30,965 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:30,965 INFO L82 PathProgramCache]: Analyzing trace with hash 46785636, now seen corresponding path program 46 times [2018-04-10 15:06:30,965 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:30,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 14856 backedges. 0 proven. 7992 refuted. 0 times theorem prover too weak. 6864 trivial. 0 not checked. [2018-04-10 15:06:32,383 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:32,383 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-04-10 15:06:32,384 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6075 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6075 trivial. 0 not checked. [2018-04-10 15:06:32,384 INFO L182 omatonBuilderFactory]: Interpolants [59520#(<= main_~i~1 35), 59521#(<= main_~i~1 36), 59522#(<= main_~i~1 37), 59523#(<= main_~i~1 38), 59524#(<= main_~i~1 39), 59525#(<= main_~i~1 40), 59526#(<= main_~i~1 41), 59527#(<= main_~i~1 42), 59528#(<= main_~i~1 43), 59529#(<= main_~i~1 44), 59530#(<= main_~i~1 45), 59531#(<= main_~i~1 46), 59532#(<= main_~i~1 47), 59533#(<= main_~i~1 48), 59483#true, 59484#false, 59485#(= main_~i~1 0), 59486#(<= main_~i~1 1), 59487#(<= main_~i~1 2), 59488#(<= main_~i~1 3), 59489#(<= main_~i~1 4), 59490#(<= main_~i~1 5), 59491#(<= main_~i~1 6), 59492#(<= main_~i~1 7), 59493#(<= main_~i~1 8), 59494#(<= main_~i~1 9), 59495#(<= main_~i~1 10), 59496#(<= main_~i~1 11), 59497#(<= main_~i~1 12), 59498#(<= main_~i~1 13), 59499#(<= main_~i~1 14), 59500#(<= main_~i~1 15), 59501#(<= main_~i~1 16), 59502#(<= main_~i~1 17), 59503#(<= main_~i~1 18), 59504#(<= main_~i~1 19), 59505#(<= main_~i~1 20), 59506#(<= main_~i~1 21), 59507#(<= main_~i~1 22), 59508#(<= main_~i~1 23), 59509#(<= main_~i~1 24), 59510#(<= main_~i~1 25), 59511#(<= main_~i~1 26), 59512#(<= main_~i~1 27), 59513#(<= main_~i~1 28), 59514#(<= main_~i~1 29), 59515#(<= main_~i~1 30), 59516#(<= main_~i~1 31), 59517#(<= main_~i~1 32), 59518#(<= main_~i~1 33), 59519#(<= main_~i~1 34)] [2018-04-10 15:06:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 14856 backedges. 0 proven. 7992 refuted. 0 times theorem prover too weak. 6864 trivial. 0 not checked. [2018-04-10 15:06:32,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-10 15:06:32,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-10 15:06:32,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 15:06:32,386 INFO L87 Difference]: Start difference. First operand 967 states and 1201 transitions. Second operand 51 states. [2018-04-10 15:06:33,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:33,063 INFO L93 Difference]: Finished difference Result 1250 states and 1445 transitions. [2018-04-10 15:06:33,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-10 15:06:33,063 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 649 [2018-04-10 15:06:33,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:33,065 INFO L225 Difference]: With dead ends: 1250 [2018-04-10 15:06:33,065 INFO L226 Difference]: Without dead ends: 1250 [2018-04-10 15:06:33,065 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 15:06:33,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2018-04-10 15:06:33,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 986. [2018-04-10 15:06:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-04-10 15:06:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1225 transitions. [2018-04-10 15:06:33,073 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1225 transitions. Word has length 649 [2018-04-10 15:06:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:33,074 INFO L459 AbstractCegarLoop]: Abstraction has 986 states and 1225 transitions. [2018-04-10 15:06:33,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-10 15:06:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1225 transitions. [2018-04-10 15:06:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2018-04-10 15:06:33,077 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:33,078 INFO L355 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 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-10 15:06:33,078 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:33,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1062146046, now seen corresponding path program 47 times [2018-04-10 15:06:33,078 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:33,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 15484 backedges. 0 proven. 8330 refuted. 0 times theorem prover too weak. 7154 trivial. 0 not checked. [2018-04-10 15:06:34,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:34,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-10 15:06:34,542 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6348 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6348 trivial. 0 not checked. [2018-04-10 15:06:34,543 INFO L182 omatonBuilderFactory]: Interpolants [61770#true, 61771#false, 61772#(= main_~i~1 0), 61773#(<= main_~i~1 1), 61774#(<= main_~i~1 2), 61775#(<= main_~i~1 3), 61776#(<= main_~i~1 4), 61777#(<= main_~i~1 5), 61778#(<= main_~i~1 6), 61779#(<= main_~i~1 7), 61780#(<= main_~i~1 8), 61781#(<= main_~i~1 9), 61782#(<= main_~i~1 10), 61783#(<= main_~i~1 11), 61784#(<= main_~i~1 12), 61785#(<= main_~i~1 13), 61786#(<= main_~i~1 14), 61787#(<= main_~i~1 15), 61788#(<= main_~i~1 16), 61789#(<= main_~i~1 17), 61790#(<= main_~i~1 18), 61791#(<= main_~i~1 19), 61792#(<= main_~i~1 20), 61793#(<= main_~i~1 21), 61794#(<= main_~i~1 22), 61795#(<= main_~i~1 23), 61796#(<= main_~i~1 24), 61797#(<= main_~i~1 25), 61798#(<= main_~i~1 26), 61799#(<= main_~i~1 27), 61800#(<= main_~i~1 28), 61801#(<= main_~i~1 29), 61802#(<= main_~i~1 30), 61803#(<= main_~i~1 31), 61804#(<= main_~i~1 32), 61805#(<= main_~i~1 33), 61806#(<= main_~i~1 34), 61807#(<= main_~i~1 35), 61808#(<= main_~i~1 36), 61809#(<= main_~i~1 37), 61810#(<= main_~i~1 38), 61811#(<= main_~i~1 39), 61812#(<= main_~i~1 40), 61813#(<= main_~i~1 41), 61814#(<= main_~i~1 42), 61815#(<= main_~i~1 43), 61816#(<= main_~i~1 44), 61817#(<= main_~i~1 45), 61818#(<= main_~i~1 46), 61819#(<= main_~i~1 47), 61820#(<= main_~i~1 48), 61821#(<= main_~i~1 49)] [2018-04-10 15:06:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15484 backedges. 0 proven. 8330 refuted. 0 times theorem prover too weak. 7154 trivial. 0 not checked. [2018-04-10 15:06:34,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-10 15:06:34,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-10 15:06:34,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 15:06:34,544 INFO L87 Difference]: Start difference. First operand 986 states and 1225 transitions. Second operand 52 states. [2018-04-10 15:06:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:35,426 INFO L93 Difference]: Finished difference Result 1274 states and 1473 transitions. [2018-04-10 15:06:35,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-04-10 15:06:35,458 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 662 [2018-04-10 15:06:35,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:35,459 INFO L225 Difference]: With dead ends: 1274 [2018-04-10 15:06:35,460 INFO L226 Difference]: Without dead ends: 1274 [2018-04-10 15:06:35,460 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-04-10 15:06:35,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2018-04-10 15:06:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1005. [2018-04-10 15:06:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2018-04-10 15:06:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1249 transitions. [2018-04-10 15:06:35,468 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1249 transitions. Word has length 662 [2018-04-10 15:06:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:35,468 INFO L459 AbstractCegarLoop]: Abstraction has 1005 states and 1249 transitions. [2018-04-10 15:06:35,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-10 15:06:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1249 transitions. [2018-04-10 15:06:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-04-10 15:06:35,474 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:35,475 INFO L355 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 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-10 15:06:35,475 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:35,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1664290468, now seen corresponding path program 48 times [2018-04-10 15:06:35,476 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:35,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 16125 backedges. 0 proven. 8675 refuted. 0 times theorem prover too weak. 7450 trivial. 0 not checked. [2018-04-10 15:06:37,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:37,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-04-10 15:06:37,032 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6627 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6627 trivial. 0 not checked. [2018-04-10 15:06:37,033 INFO L182 omatonBuilderFactory]: Interpolants [64128#(<= main_~i~1 25), 64129#(<= main_~i~1 26), 64130#(<= main_~i~1 27), 64131#(<= main_~i~1 28), 64132#(<= main_~i~1 29), 64133#(<= main_~i~1 30), 64134#(<= main_~i~1 31), 64135#(<= main_~i~1 32), 64136#(<= main_~i~1 33), 64137#(<= main_~i~1 34), 64138#(<= main_~i~1 35), 64139#(<= main_~i~1 36), 64140#(<= main_~i~1 37), 64141#(<= main_~i~1 38), 64142#(<= main_~i~1 39), 64143#(<= main_~i~1 40), 64144#(<= main_~i~1 41), 64145#(<= main_~i~1 42), 64146#(<= main_~i~1 43), 64147#(<= main_~i~1 44), 64148#(<= main_~i~1 45), 64149#(<= main_~i~1 46), 64150#(<= main_~i~1 47), 64151#(<= main_~i~1 48), 64152#(<= main_~i~1 49), 64153#(<= main_~i~1 50), 64101#true, 64102#false, 64103#(= main_~i~1 0), 64104#(<= main_~i~1 1), 64105#(<= main_~i~1 2), 64106#(<= main_~i~1 3), 64107#(<= main_~i~1 4), 64108#(<= main_~i~1 5), 64109#(<= main_~i~1 6), 64110#(<= main_~i~1 7), 64111#(<= main_~i~1 8), 64112#(<= main_~i~1 9), 64113#(<= main_~i~1 10), 64114#(<= main_~i~1 11), 64115#(<= main_~i~1 12), 64116#(<= main_~i~1 13), 64117#(<= main_~i~1 14), 64118#(<= main_~i~1 15), 64119#(<= main_~i~1 16), 64120#(<= main_~i~1 17), 64121#(<= main_~i~1 18), 64122#(<= main_~i~1 19), 64123#(<= main_~i~1 20), 64124#(<= main_~i~1 21), 64125#(<= main_~i~1 22), 64126#(<= main_~i~1 23), 64127#(<= main_~i~1 24)] [2018-04-10 15:06:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16125 backedges. 0 proven. 8675 refuted. 0 times theorem prover too weak. 7450 trivial. 0 not checked. [2018-04-10 15:06:37,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-10 15:06:37,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-10 15:06:37,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 15:06:37,034 INFO L87 Difference]: Start difference. First operand 1005 states and 1249 transitions. Second operand 53 states. [2018-04-10 15:06:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:37,661 INFO L93 Difference]: Finished difference Result 1298 states and 1501 transitions. [2018-04-10 15:06:37,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-10 15:06:37,661 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 675 [2018-04-10 15:06:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:37,664 INFO L225 Difference]: With dead ends: 1298 [2018-04-10 15:06:37,664 INFO L226 Difference]: Without dead ends: 1298 [2018-04-10 15:06:37,664 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-04-10 15:06:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-04-10 15:06:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1024. [2018-04-10 15:06:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-04-10 15:06:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1273 transitions. [2018-04-10 15:06:37,677 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1273 transitions. Word has length 675 [2018-04-10 15:06:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:37,678 INFO L459 AbstractCegarLoop]: Abstraction has 1024 states and 1273 transitions. [2018-04-10 15:06:37,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-10 15:06:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1273 transitions. [2018-04-10 15:06:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2018-04-10 15:06:37,684 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:37,684 INFO L355 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 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-10 15:06:37,685 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:37,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1812762046, now seen corresponding path program 49 times [2018-04-10 15:06:37,685 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:37,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 16779 backedges. 0 proven. 9027 refuted. 0 times theorem prover too weak. 7752 trivial. 0 not checked. [2018-04-10 15:06:39,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:39,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-10 15:06:39,328 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6912 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6912 trivial. 0 not checked. [2018-04-10 15:06:39,328 INFO L182 omatonBuilderFactory]: Interpolants [66477#false, 66476#true, 66479#(<= main_~i~1 1), 66478#(= main_~i~1 0), 66481#(<= main_~i~1 3), 66480#(<= main_~i~1 2), 66483#(<= main_~i~1 5), 66482#(<= main_~i~1 4), 66485#(<= main_~i~1 7), 66484#(<= main_~i~1 6), 66487#(<= main_~i~1 9), 66486#(<= main_~i~1 8), 66489#(<= main_~i~1 11), 66488#(<= main_~i~1 10), 66491#(<= main_~i~1 13), 66490#(<= main_~i~1 12), 66493#(<= main_~i~1 15), 66492#(<= main_~i~1 14), 66495#(<= main_~i~1 17), 66494#(<= main_~i~1 16), 66497#(<= main_~i~1 19), 66496#(<= main_~i~1 18), 66499#(<= main_~i~1 21), 66498#(<= main_~i~1 20), 66501#(<= main_~i~1 23), 66500#(<= main_~i~1 22), 66503#(<= main_~i~1 25), 66502#(<= main_~i~1 24), 66505#(<= main_~i~1 27), 66504#(<= main_~i~1 26), 66507#(<= main_~i~1 29), 66506#(<= main_~i~1 28), 66509#(<= main_~i~1 31), 66508#(<= main_~i~1 30), 66511#(<= main_~i~1 33), 66510#(<= main_~i~1 32), 66513#(<= main_~i~1 35), 66512#(<= main_~i~1 34), 66515#(<= main_~i~1 37), 66514#(<= main_~i~1 36), 66517#(<= main_~i~1 39), 66516#(<= main_~i~1 38), 66519#(<= main_~i~1 41), 66518#(<= main_~i~1 40), 66521#(<= main_~i~1 43), 66520#(<= main_~i~1 42), 66523#(<= main_~i~1 45), 66522#(<= main_~i~1 44), 66525#(<= main_~i~1 47), 66524#(<= main_~i~1 46), 66527#(<= main_~i~1 49), 66526#(<= main_~i~1 48), 66529#(<= main_~i~1 51), 66528#(<= main_~i~1 50)] [2018-04-10 15:06:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16779 backedges. 0 proven. 9027 refuted. 0 times theorem prover too weak. 7752 trivial. 0 not checked. [2018-04-10 15:06:39,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-10 15:06:39,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-10 15:06:39,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 15:06:39,330 INFO L87 Difference]: Start difference. First operand 1024 states and 1273 transitions. Second operand 54 states. [2018-04-10 15:06:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:39,979 INFO L93 Difference]: Finished difference Result 1322 states and 1529 transitions. [2018-04-10 15:06:39,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-10 15:06:39,979 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 688 [2018-04-10 15:06:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:39,981 INFO L225 Difference]: With dead ends: 1322 [2018-04-10 15:06:39,982 INFO L226 Difference]: Without dead ends: 1322 [2018-04-10 15:06:39,982 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-04-10 15:06:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2018-04-10 15:06:39,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1043. [2018-04-10 15:06:39,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2018-04-10 15:06:39,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1297 transitions. [2018-04-10 15:06:39,989 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1297 transitions. Word has length 688 [2018-04-10 15:06:39,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:39,990 INFO L459 AbstractCegarLoop]: Abstraction has 1043 states and 1297 transitions. [2018-04-10 15:06:39,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-10 15:06:39,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1297 transitions. [2018-04-10 15:06:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2018-04-10 15:06:39,993 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:39,993 INFO L355 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 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-10 15:06:39,993 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:39,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1130359012, now seen corresponding path program 50 times [2018-04-10 15:06:39,994 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:40,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 17446 backedges. 0 proven. 9386 refuted. 0 times theorem prover too weak. 8060 trivial. 0 not checked. [2018-04-10 15:06:41,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:41,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-04-10 15:06:41,742 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 7203 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7203 trivial. 0 not checked. [2018-04-10 15:06:41,743 INFO L182 omatonBuilderFactory]: Interpolants [68895#true, 68897#(= main_~i~1 0), 68896#false, 68899#(<= main_~i~1 2), 68898#(<= main_~i~1 1), 68901#(<= main_~i~1 4), 68900#(<= main_~i~1 3), 68903#(<= main_~i~1 6), 68902#(<= main_~i~1 5), 68905#(<= main_~i~1 8), 68904#(<= main_~i~1 7), 68907#(<= main_~i~1 10), 68906#(<= main_~i~1 9), 68909#(<= main_~i~1 12), 68908#(<= main_~i~1 11), 68911#(<= main_~i~1 14), 68910#(<= main_~i~1 13), 68913#(<= main_~i~1 16), 68912#(<= main_~i~1 15), 68915#(<= main_~i~1 18), 68914#(<= main_~i~1 17), 68917#(<= main_~i~1 20), 68916#(<= main_~i~1 19), 68919#(<= main_~i~1 22), 68918#(<= main_~i~1 21), 68921#(<= main_~i~1 24), 68920#(<= main_~i~1 23), 68923#(<= main_~i~1 26), 68922#(<= main_~i~1 25), 68925#(<= main_~i~1 28), 68924#(<= main_~i~1 27), 68927#(<= main_~i~1 30), 68926#(<= main_~i~1 29), 68929#(<= main_~i~1 32), 68928#(<= main_~i~1 31), 68931#(<= main_~i~1 34), 68930#(<= main_~i~1 33), 68933#(<= main_~i~1 36), 68932#(<= main_~i~1 35), 68935#(<= main_~i~1 38), 68934#(<= main_~i~1 37), 68937#(<= main_~i~1 40), 68936#(<= main_~i~1 39), 68939#(<= main_~i~1 42), 68938#(<= main_~i~1 41), 68941#(<= main_~i~1 44), 68940#(<= main_~i~1 43), 68943#(<= main_~i~1 46), 68942#(<= main_~i~1 45), 68945#(<= main_~i~1 48), 68944#(<= main_~i~1 47), 68947#(<= main_~i~1 50), 68946#(<= main_~i~1 49), 68949#(<= main_~i~1 52), 68948#(<= main_~i~1 51)] [2018-04-10 15:06:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 17446 backedges. 0 proven. 9386 refuted. 0 times theorem prover too weak. 8060 trivial. 0 not checked. [2018-04-10 15:06:41,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-10 15:06:41,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-10 15:06:41,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 15:06:41,744 INFO L87 Difference]: Start difference. First operand 1043 states and 1297 transitions. Second operand 55 states. [2018-04-10 15:06:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:42,490 INFO L93 Difference]: Finished difference Result 1346 states and 1557 transitions. [2018-04-10 15:06:42,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-10 15:06:42,490 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 701 [2018-04-10 15:06:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:42,492 INFO L225 Difference]: With dead ends: 1346 [2018-04-10 15:06:42,493 INFO L226 Difference]: Without dead ends: 1346 [2018-04-10 15:06:42,493 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 15:06:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2018-04-10 15:06:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1062. [2018-04-10 15:06:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2018-04-10 15:06:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1321 transitions. [2018-04-10 15:06:42,503 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1321 transitions. Word has length 701 [2018-04-10 15:06:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:42,503 INFO L459 AbstractCegarLoop]: Abstraction has 1062 states and 1321 transitions. [2018-04-10 15:06:42,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-10 15:06:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1321 transitions. [2018-04-10 15:06:42,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2018-04-10 15:06:42,507 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:42,508 INFO L355 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 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-10 15:06:42,508 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:42,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2004591746, now seen corresponding path program 51 times [2018-04-10 15:06:42,509 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:42,551 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 18126 backedges. 0 proven. 9752 refuted. 0 times theorem prover too weak. 8374 trivial. 0 not checked. [2018-04-10 15:06:44,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:44,325 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-10 15:06:44,325 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7500 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7500 trivial. 0 not checked. [2018-04-10 15:06:44,326 INFO L182 omatonBuilderFactory]: Interpolants [71359#false, 71358#true, 71361#(<= main_~i~1 1), 71360#(= main_~i~1 0), 71363#(<= main_~i~1 3), 71362#(<= main_~i~1 2), 71365#(<= main_~i~1 5), 71364#(<= main_~i~1 4), 71367#(<= main_~i~1 7), 71366#(<= main_~i~1 6), 71369#(<= main_~i~1 9), 71368#(<= main_~i~1 8), 71371#(<= main_~i~1 11), 71370#(<= main_~i~1 10), 71373#(<= main_~i~1 13), 71372#(<= main_~i~1 12), 71375#(<= main_~i~1 15), 71374#(<= main_~i~1 14), 71377#(<= main_~i~1 17), 71376#(<= main_~i~1 16), 71379#(<= main_~i~1 19), 71378#(<= main_~i~1 18), 71381#(<= main_~i~1 21), 71380#(<= main_~i~1 20), 71383#(<= main_~i~1 23), 71382#(<= main_~i~1 22), 71385#(<= main_~i~1 25), 71384#(<= main_~i~1 24), 71387#(<= main_~i~1 27), 71386#(<= main_~i~1 26), 71389#(<= main_~i~1 29), 71388#(<= main_~i~1 28), 71391#(<= main_~i~1 31), 71390#(<= main_~i~1 30), 71393#(<= main_~i~1 33), 71392#(<= main_~i~1 32), 71395#(<= main_~i~1 35), 71394#(<= main_~i~1 34), 71397#(<= main_~i~1 37), 71396#(<= main_~i~1 36), 71399#(<= main_~i~1 39), 71398#(<= main_~i~1 38), 71401#(<= main_~i~1 41), 71400#(<= main_~i~1 40), 71403#(<= main_~i~1 43), 71402#(<= main_~i~1 42), 71405#(<= main_~i~1 45), 71404#(<= main_~i~1 44), 71407#(<= main_~i~1 47), 71406#(<= main_~i~1 46), 71409#(<= main_~i~1 49), 71408#(<= main_~i~1 48), 71411#(<= main_~i~1 51), 71410#(<= main_~i~1 50), 71413#(<= main_~i~1 53), 71412#(<= main_~i~1 52)] [2018-04-10 15:06:44,327 INFO L134 CoverageAnalysis]: Checked inductivity of 18126 backedges. 0 proven. 9752 refuted. 0 times theorem prover too weak. 8374 trivial. 0 not checked. [2018-04-10 15:06:44,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-10 15:06:44,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-10 15:06:44,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 15:06:44,328 INFO L87 Difference]: Start difference. First operand 1062 states and 1321 transitions. Second operand 56 states. [2018-04-10 15:06:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:45,184 INFO L93 Difference]: Finished difference Result 1370 states and 1585 transitions. [2018-04-10 15:06:45,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-04-10 15:06:45,184 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 714 [2018-04-10 15:06:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:45,186 INFO L225 Difference]: With dead ends: 1370 [2018-04-10 15:06:45,186 INFO L226 Difference]: Without dead ends: 1370 [2018-04-10 15:06:45,186 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 15:06:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-04-10 15:06:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1081. [2018-04-10 15:06:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-04-10 15:06:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1345 transitions. [2018-04-10 15:06:45,194 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1345 transitions. Word has length 714 [2018-04-10 15:06:45,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:45,194 INFO L459 AbstractCegarLoop]: Abstraction has 1081 states and 1345 transitions. [2018-04-10 15:06:45,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-10 15:06:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1345 transitions. [2018-04-10 15:06:45,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2018-04-10 15:06:45,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:45,199 INFO L355 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 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-10 15:06:45,199 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:45,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1628730148, now seen corresponding path program 52 times [2018-04-10 15:06:45,200 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:45,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18819 backedges. 0 proven. 10125 refuted. 0 times theorem prover too weak. 8694 trivial. 0 not checked. [2018-04-10 15:06:47,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:47,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-10 15:06:47,050 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 7803 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7803 trivial. 0 not checked. [2018-04-10 15:06:47,051 INFO L182 omatonBuilderFactory]: Interpolants [73865#true, 73867#(= main_~i~1 0), 73866#false, 73869#(<= main_~i~1 2), 73868#(<= main_~i~1 1), 73871#(<= main_~i~1 4), 73870#(<= main_~i~1 3), 73873#(<= main_~i~1 6), 73872#(<= main_~i~1 5), 73875#(<= main_~i~1 8), 73874#(<= main_~i~1 7), 73877#(<= main_~i~1 10), 73876#(<= main_~i~1 9), 73879#(<= main_~i~1 12), 73878#(<= main_~i~1 11), 73881#(<= main_~i~1 14), 73880#(<= main_~i~1 13), 73883#(<= main_~i~1 16), 73882#(<= main_~i~1 15), 73885#(<= main_~i~1 18), 73884#(<= main_~i~1 17), 73887#(<= main_~i~1 20), 73886#(<= main_~i~1 19), 73889#(<= main_~i~1 22), 73888#(<= main_~i~1 21), 73891#(<= main_~i~1 24), 73890#(<= main_~i~1 23), 73893#(<= main_~i~1 26), 73892#(<= main_~i~1 25), 73895#(<= main_~i~1 28), 73894#(<= main_~i~1 27), 73897#(<= main_~i~1 30), 73896#(<= main_~i~1 29), 73899#(<= main_~i~1 32), 73898#(<= main_~i~1 31), 73901#(<= main_~i~1 34), 73900#(<= main_~i~1 33), 73903#(<= main_~i~1 36), 73902#(<= main_~i~1 35), 73905#(<= main_~i~1 38), 73904#(<= main_~i~1 37), 73907#(<= main_~i~1 40), 73906#(<= main_~i~1 39), 73909#(<= main_~i~1 42), 73908#(<= main_~i~1 41), 73911#(<= main_~i~1 44), 73910#(<= main_~i~1 43), 73913#(<= main_~i~1 46), 73912#(<= main_~i~1 45), 73915#(<= main_~i~1 48), 73914#(<= main_~i~1 47), 73917#(<= main_~i~1 50), 73916#(<= main_~i~1 49), 73919#(<= main_~i~1 52), 73918#(<= main_~i~1 51), 73921#(<= main_~i~1 54), 73920#(<= main_~i~1 53)] [2018-04-10 15:06:47,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18819 backedges. 0 proven. 10125 refuted. 0 times theorem prover too weak. 8694 trivial. 0 not checked. [2018-04-10 15:06:47,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-10 15:06:47,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-10 15:06:47,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 15:06:47,052 INFO L87 Difference]: Start difference. First operand 1081 states and 1345 transitions. Second operand 57 states. [2018-04-10 15:06:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:47,935 INFO L93 Difference]: Finished difference Result 1394 states and 1613 transitions. [2018-04-10 15:06:47,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-10 15:06:47,935 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 727 [2018-04-10 15:06:47,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:47,938 INFO L225 Difference]: With dead ends: 1394 [2018-04-10 15:06:47,939 INFO L226 Difference]: Without dead ends: 1394 [2018-04-10 15:06:47,939 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 15:06:47,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2018-04-10 15:06:47,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1100. [2018-04-10 15:06:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2018-04-10 15:06:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1369 transitions. [2018-04-10 15:06:47,955 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1369 transitions. Word has length 727 [2018-04-10 15:06:47,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:47,955 INFO L459 AbstractCegarLoop]: Abstraction has 1100 states and 1369 transitions. [2018-04-10 15:06:47,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-10 15:06:47,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1369 transitions. [2018-04-10 15:06:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2018-04-10 15:06:47,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:47,962 INFO L355 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 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-10 15:06:47,962 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:47,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1433565502, now seen corresponding path program 53 times [2018-04-10 15:06:47,963 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:48,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 19525 backedges. 0 proven. 10505 refuted. 0 times theorem prover too weak. 9020 trivial. 0 not checked. [2018-04-10 15:06:49,956 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:49,956 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-10 15:06:49,956 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 8112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8112 trivial. 0 not checked. [2018-04-10 15:06:49,957 INFO L182 omatonBuilderFactory]: Interpolants [76417#false, 76416#true, 76419#(<= main_~i~1 1), 76418#(= main_~i~1 0), 76421#(<= main_~i~1 3), 76420#(<= main_~i~1 2), 76423#(<= main_~i~1 5), 76422#(<= main_~i~1 4), 76425#(<= main_~i~1 7), 76424#(<= main_~i~1 6), 76427#(<= main_~i~1 9), 76426#(<= main_~i~1 8), 76429#(<= main_~i~1 11), 76428#(<= main_~i~1 10), 76431#(<= main_~i~1 13), 76430#(<= main_~i~1 12), 76433#(<= main_~i~1 15), 76432#(<= main_~i~1 14), 76435#(<= main_~i~1 17), 76434#(<= main_~i~1 16), 76437#(<= main_~i~1 19), 76436#(<= main_~i~1 18), 76439#(<= main_~i~1 21), 76438#(<= main_~i~1 20), 76441#(<= main_~i~1 23), 76440#(<= main_~i~1 22), 76443#(<= main_~i~1 25), 76442#(<= main_~i~1 24), 76445#(<= main_~i~1 27), 76444#(<= main_~i~1 26), 76447#(<= main_~i~1 29), 76446#(<= main_~i~1 28), 76449#(<= main_~i~1 31), 76448#(<= main_~i~1 30), 76451#(<= main_~i~1 33), 76450#(<= main_~i~1 32), 76453#(<= main_~i~1 35), 76452#(<= main_~i~1 34), 76455#(<= main_~i~1 37), 76454#(<= main_~i~1 36), 76457#(<= main_~i~1 39), 76456#(<= main_~i~1 38), 76459#(<= main_~i~1 41), 76458#(<= main_~i~1 40), 76461#(<= main_~i~1 43), 76460#(<= main_~i~1 42), 76463#(<= main_~i~1 45), 76462#(<= main_~i~1 44), 76465#(<= main_~i~1 47), 76464#(<= main_~i~1 46), 76467#(<= main_~i~1 49), 76466#(<= main_~i~1 48), 76469#(<= main_~i~1 51), 76468#(<= main_~i~1 50), 76471#(<= main_~i~1 53), 76470#(<= main_~i~1 52), 76473#(<= main_~i~1 55), 76472#(<= main_~i~1 54)] [2018-04-10 15:06:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 19525 backedges. 0 proven. 10505 refuted. 0 times theorem prover too weak. 9020 trivial. 0 not checked. [2018-04-10 15:06:49,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-10 15:06:49,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-10 15:06:49,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 15:06:49,958 INFO L87 Difference]: Start difference. First operand 1100 states and 1369 transitions. Second operand 58 states. [2018-04-10 15:06:50,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:50,846 INFO L93 Difference]: Finished difference Result 1418 states and 1641 transitions. [2018-04-10 15:06:50,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-10 15:06:50,846 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 740 [2018-04-10 15:06:50,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:50,848 INFO L225 Difference]: With dead ends: 1418 [2018-04-10 15:06:50,848 INFO L226 Difference]: Without dead ends: 1418 [2018-04-10 15:06:50,848 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 15:06:50,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2018-04-10 15:06:50,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1119. [2018-04-10 15:06:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-04-10 15:06:50,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1393 transitions. [2018-04-10 15:06:50,856 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1393 transitions. Word has length 740 [2018-04-10 15:06:50,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:50,857 INFO L459 AbstractCegarLoop]: Abstraction has 1119 states and 1393 transitions. [2018-04-10 15:06:50,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-10 15:06:50,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1393 transitions. [2018-04-10 15:06:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 754 [2018-04-10 15:06:50,860 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:50,860 INFO L355 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 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-10 15:06:50,860 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:50,860 INFO L82 PathProgramCache]: Analyzing trace with hash 219458916, now seen corresponding path program 54 times [2018-04-10 15:06:50,861 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:50,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 20244 backedges. 0 proven. 10892 refuted. 0 times theorem prover too weak. 9352 trivial. 0 not checked. [2018-04-10 15:06:52,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:52,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-04-10 15:06:52,929 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:52,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8427 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8427 trivial. 0 not checked. [2018-04-10 15:06:52,929 INFO L182 omatonBuilderFactory]: Interpolants [79011#true, 79013#(= main_~i~1 0), 79012#false, 79015#(<= main_~i~1 2), 79014#(<= main_~i~1 1), 79017#(<= main_~i~1 4), 79016#(<= main_~i~1 3), 79019#(<= main_~i~1 6), 79018#(<= main_~i~1 5), 79021#(<= main_~i~1 8), 79020#(<= main_~i~1 7), 79023#(<= main_~i~1 10), 79022#(<= main_~i~1 9), 79025#(<= main_~i~1 12), 79024#(<= main_~i~1 11), 79027#(<= main_~i~1 14), 79026#(<= main_~i~1 13), 79029#(<= main_~i~1 16), 79028#(<= main_~i~1 15), 79031#(<= main_~i~1 18), 79030#(<= main_~i~1 17), 79033#(<= main_~i~1 20), 79032#(<= main_~i~1 19), 79035#(<= main_~i~1 22), 79034#(<= main_~i~1 21), 79037#(<= main_~i~1 24), 79036#(<= main_~i~1 23), 79039#(<= main_~i~1 26), 79038#(<= main_~i~1 25), 79041#(<= main_~i~1 28), 79040#(<= main_~i~1 27), 79043#(<= main_~i~1 30), 79042#(<= main_~i~1 29), 79045#(<= main_~i~1 32), 79044#(<= main_~i~1 31), 79047#(<= main_~i~1 34), 79046#(<= main_~i~1 33), 79049#(<= main_~i~1 36), 79048#(<= main_~i~1 35), 79051#(<= main_~i~1 38), 79050#(<= main_~i~1 37), 79053#(<= main_~i~1 40), 79052#(<= main_~i~1 39), 79055#(<= main_~i~1 42), 79054#(<= main_~i~1 41), 79057#(<= main_~i~1 44), 79056#(<= main_~i~1 43), 79059#(<= main_~i~1 46), 79058#(<= main_~i~1 45), 79061#(<= main_~i~1 48), 79060#(<= main_~i~1 47), 79063#(<= main_~i~1 50), 79062#(<= main_~i~1 49), 79065#(<= main_~i~1 52), 79064#(<= main_~i~1 51), 79067#(<= main_~i~1 54), 79066#(<= main_~i~1 53), 79069#(<= main_~i~1 56), 79068#(<= main_~i~1 55)] [2018-04-10 15:06:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 20244 backedges. 0 proven. 10892 refuted. 0 times theorem prover too weak. 9352 trivial. 0 not checked. [2018-04-10 15:06:52,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-10 15:06:52,931 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-10 15:06:52,931 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 15:06:52,931 INFO L87 Difference]: Start difference. First operand 1119 states and 1393 transitions. Second operand 59 states. [2018-04-10 15:06:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:53,830 INFO L93 Difference]: Finished difference Result 1442 states and 1669 transitions. [2018-04-10 15:06:53,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-10 15:06:53,830 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 753 [2018-04-10 15:06:53,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:53,832 INFO L225 Difference]: With dead ends: 1442 [2018-04-10 15:06:53,832 INFO L226 Difference]: Without dead ends: 1442 [2018-04-10 15:06:53,832 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-04-10 15:06:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2018-04-10 15:06:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1138. [2018-04-10 15:06:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-04-10 15:06:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1417 transitions. [2018-04-10 15:06:53,845 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1417 transitions. Word has length 753 [2018-04-10 15:06:53,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:53,845 INFO L459 AbstractCegarLoop]: Abstraction has 1138 states and 1417 transitions. [2018-04-10 15:06:53,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-10 15:06:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1417 transitions. [2018-04-10 15:06:53,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2018-04-10 15:06:53,851 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:53,852 INFO L355 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 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-10 15:06:53,852 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:53,852 INFO L82 PathProgramCache]: Analyzing trace with hash -527243522, now seen corresponding path program 55 times [2018-04-10 15:06:53,853 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:53,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 20976 backedges. 0 proven. 11286 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-04-10 15:06:56,009 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:56,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-10 15:06:56,009 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8748 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8748 trivial. 0 not checked. [2018-04-10 15:06:56,010 INFO L182 omatonBuilderFactory]: Interpolants [81665#(<= main_~i~1 13), 81664#(<= main_~i~1 12), 81667#(<= main_~i~1 15), 81666#(<= main_~i~1 14), 81669#(<= main_~i~1 17), 81668#(<= main_~i~1 16), 81671#(<= main_~i~1 19), 81670#(<= main_~i~1 18), 81673#(<= main_~i~1 21), 81672#(<= main_~i~1 20), 81675#(<= main_~i~1 23), 81674#(<= main_~i~1 22), 81677#(<= main_~i~1 25), 81676#(<= main_~i~1 24), 81679#(<= main_~i~1 27), 81678#(<= main_~i~1 26), 81681#(<= main_~i~1 29), 81680#(<= main_~i~1 28), 81683#(<= main_~i~1 31), 81682#(<= main_~i~1 30), 81685#(<= main_~i~1 33), 81684#(<= main_~i~1 32), 81687#(<= main_~i~1 35), 81686#(<= main_~i~1 34), 81689#(<= main_~i~1 37), 81688#(<= main_~i~1 36), 81691#(<= main_~i~1 39), 81690#(<= main_~i~1 38), 81693#(<= main_~i~1 41), 81692#(<= main_~i~1 40), 81695#(<= main_~i~1 43), 81694#(<= main_~i~1 42), 81697#(<= main_~i~1 45), 81696#(<= main_~i~1 44), 81699#(<= main_~i~1 47), 81698#(<= main_~i~1 46), 81701#(<= main_~i~1 49), 81700#(<= main_~i~1 48), 81703#(<= main_~i~1 51), 81702#(<= main_~i~1 50), 81705#(<= main_~i~1 53), 81704#(<= main_~i~1 52), 81707#(<= main_~i~1 55), 81706#(<= main_~i~1 54), 81709#(<= main_~i~1 57), 81708#(<= main_~i~1 56), 81651#false, 81650#true, 81653#(<= main_~i~1 1), 81652#(= main_~i~1 0), 81655#(<= main_~i~1 3), 81654#(<= main_~i~1 2), 81657#(<= main_~i~1 5), 81656#(<= main_~i~1 4), 81659#(<= main_~i~1 7), 81658#(<= main_~i~1 6), 81661#(<= main_~i~1 9), 81660#(<= main_~i~1 8), 81663#(<= main_~i~1 11), 81662#(<= main_~i~1 10)] [2018-04-10 15:06:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 20976 backedges. 0 proven. 11286 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-04-10 15:06:56,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-04-10 15:06:56,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-04-10 15:06:56,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 15:06:56,011 INFO L87 Difference]: Start difference. First operand 1138 states and 1417 transitions. Second operand 60 states. [2018-04-10 15:06:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:56,788 INFO L93 Difference]: Finished difference Result 1466 states and 1697 transitions. [2018-04-10 15:06:56,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-10 15:06:56,788 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 766 [2018-04-10 15:06:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:56,790 INFO L225 Difference]: With dead ends: 1466 [2018-04-10 15:06:56,791 INFO L226 Difference]: Without dead ends: 1466 [2018-04-10 15:06:56,791 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 15:06:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-04-10 15:06:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1157. [2018-04-10 15:06:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-04-10 15:06:56,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1441 transitions. [2018-04-10 15:06:56,806 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1441 transitions. Word has length 766 [2018-04-10 15:06:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:56,806 INFO L459 AbstractCegarLoop]: Abstraction has 1157 states and 1441 transitions. [2018-04-10 15:06:56,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-04-10 15:06:56,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1441 transitions. [2018-04-10 15:06:56,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2018-04-10 15:06:56,810 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:56,811 INFO L355 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 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-10 15:06:56,811 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:56,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1797560228, now seen corresponding path program 56 times [2018-04-10 15:06:56,811 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:56,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:06:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 21721 backedges. 0 proven. 11687 refuted. 0 times theorem prover too weak. 10034 trivial. 0 not checked. [2018-04-10 15:06:59,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:06:59,023 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-04-10 15:06:59,023 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:06:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9075 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9075 trivial. 0 not checked. [2018-04-10 15:06:59,023 INFO L182 omatonBuilderFactory]: Interpolants [84353#(<= main_~i~1 18), 84352#(<= main_~i~1 17), 84355#(<= main_~i~1 20), 84354#(<= main_~i~1 19), 84357#(<= main_~i~1 22), 84356#(<= main_~i~1 21), 84359#(<= main_~i~1 24), 84358#(<= main_~i~1 23), 84361#(<= main_~i~1 26), 84360#(<= main_~i~1 25), 84363#(<= main_~i~1 28), 84362#(<= main_~i~1 27), 84365#(<= main_~i~1 30), 84364#(<= main_~i~1 29), 84367#(<= main_~i~1 32), 84366#(<= main_~i~1 31), 84369#(<= main_~i~1 34), 84368#(<= main_~i~1 33), 84371#(<= main_~i~1 36), 84370#(<= main_~i~1 35), 84373#(<= main_~i~1 38), 84372#(<= main_~i~1 37), 84375#(<= main_~i~1 40), 84374#(<= main_~i~1 39), 84377#(<= main_~i~1 42), 84376#(<= main_~i~1 41), 84379#(<= main_~i~1 44), 84378#(<= main_~i~1 43), 84381#(<= main_~i~1 46), 84380#(<= main_~i~1 45), 84383#(<= main_~i~1 48), 84382#(<= main_~i~1 47), 84385#(<= main_~i~1 50), 84384#(<= main_~i~1 49), 84387#(<= main_~i~1 52), 84386#(<= main_~i~1 51), 84389#(<= main_~i~1 54), 84388#(<= main_~i~1 53), 84391#(<= main_~i~1 56), 84390#(<= main_~i~1 55), 84393#(<= main_~i~1 58), 84392#(<= main_~i~1 57), 84333#true, 84335#(= main_~i~1 0), 84334#false, 84337#(<= main_~i~1 2), 84336#(<= main_~i~1 1), 84339#(<= main_~i~1 4), 84338#(<= main_~i~1 3), 84341#(<= main_~i~1 6), 84340#(<= main_~i~1 5), 84343#(<= main_~i~1 8), 84342#(<= main_~i~1 7), 84345#(<= main_~i~1 10), 84344#(<= main_~i~1 9), 84347#(<= main_~i~1 12), 84346#(<= main_~i~1 11), 84349#(<= main_~i~1 14), 84348#(<= main_~i~1 13), 84351#(<= main_~i~1 16), 84350#(<= main_~i~1 15)] [2018-04-10 15:06:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 21721 backedges. 0 proven. 11687 refuted. 0 times theorem prover too weak. 10034 trivial. 0 not checked. [2018-04-10 15:06:59,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-10 15:06:59,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-10 15:06:59,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 15:06:59,025 INFO L87 Difference]: Start difference. First operand 1157 states and 1441 transitions. Second operand 61 states. [2018-04-10 15:06:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:06:59,854 INFO L93 Difference]: Finished difference Result 1490 states and 1725 transitions. [2018-04-10 15:06:59,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-10 15:06:59,854 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 779 [2018-04-10 15:06:59,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:06:59,856 INFO L225 Difference]: With dead ends: 1490 [2018-04-10 15:06:59,856 INFO L226 Difference]: Without dead ends: 1490 [2018-04-10 15:06:59,856 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-04-10 15:06:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2018-04-10 15:06:59,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1176. [2018-04-10 15:06:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-04-10 15:06:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1465 transitions. [2018-04-10 15:06:59,866 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1465 transitions. Word has length 779 [2018-04-10 15:06:59,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:06:59,866 INFO L459 AbstractCegarLoop]: Abstraction has 1176 states and 1465 transitions. [2018-04-10 15:06:59,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-10 15:06:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1465 transitions. [2018-04-10 15:06:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2018-04-10 15:06:59,870 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:06:59,870 INFO L355 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 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-10 15:06:59,870 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:06:59,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1151444158, now seen corresponding path program 57 times [2018-04-10 15:06:59,871 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:06:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:06:59,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:07:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 22479 backedges. 0 proven. 12095 refuted. 0 times theorem prover too weak. 10384 trivial. 0 not checked. [2018-04-10 15:07:02,379 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:07:02,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-10 15:07:02,379 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:07:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9408 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9408 trivial. 0 not checked. [2018-04-10 15:07:02,380 INFO L182 omatonBuilderFactory]: Interpolants [87061#false, 87060#true, 87063#(<= main_~i~1 1), 87062#(= main_~i~1 0), 87065#(<= main_~i~1 3), 87064#(<= main_~i~1 2), 87067#(<= main_~i~1 5), 87066#(<= main_~i~1 4), 87069#(<= main_~i~1 7), 87068#(<= main_~i~1 6), 87071#(<= main_~i~1 9), 87070#(<= main_~i~1 8), 87073#(<= main_~i~1 11), 87072#(<= main_~i~1 10), 87075#(<= main_~i~1 13), 87074#(<= main_~i~1 12), 87077#(<= main_~i~1 15), 87076#(<= main_~i~1 14), 87079#(<= main_~i~1 17), 87078#(<= main_~i~1 16), 87081#(<= main_~i~1 19), 87080#(<= main_~i~1 18), 87083#(<= main_~i~1 21), 87082#(<= main_~i~1 20), 87085#(<= main_~i~1 23), 87084#(<= main_~i~1 22), 87087#(<= main_~i~1 25), 87086#(<= main_~i~1 24), 87089#(<= main_~i~1 27), 87088#(<= main_~i~1 26), 87091#(<= main_~i~1 29), 87090#(<= main_~i~1 28), 87093#(<= main_~i~1 31), 87092#(<= main_~i~1 30), 87095#(<= main_~i~1 33), 87094#(<= main_~i~1 32), 87097#(<= main_~i~1 35), 87096#(<= main_~i~1 34), 87099#(<= main_~i~1 37), 87098#(<= main_~i~1 36), 87101#(<= main_~i~1 39), 87100#(<= main_~i~1 38), 87103#(<= main_~i~1 41), 87102#(<= main_~i~1 40), 87105#(<= main_~i~1 43), 87104#(<= main_~i~1 42), 87107#(<= main_~i~1 45), 87106#(<= main_~i~1 44), 87109#(<= main_~i~1 47), 87108#(<= main_~i~1 46), 87111#(<= main_~i~1 49), 87110#(<= main_~i~1 48), 87113#(<= main_~i~1 51), 87112#(<= main_~i~1 50), 87115#(<= main_~i~1 53), 87114#(<= main_~i~1 52), 87117#(<= main_~i~1 55), 87116#(<= main_~i~1 54), 87119#(<= main_~i~1 57), 87118#(<= main_~i~1 56), 87121#(<= main_~i~1 59), 87120#(<= main_~i~1 58)] [2018-04-10 15:07:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 22479 backedges. 0 proven. 12095 refuted. 0 times theorem prover too weak. 10384 trivial. 0 not checked. [2018-04-10 15:07:02,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-04-10 15:07:02,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-04-10 15:07:02,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 15:07:02,381 INFO L87 Difference]: Start difference. First operand 1176 states and 1465 transitions. Second operand 62 states. [2018-04-10 15:07:03,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:07:03,433 INFO L93 Difference]: Finished difference Result 1514 states and 1753 transitions. [2018-04-10 15:07:03,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-10 15:07:03,433 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 792 [2018-04-10 15:07:03,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:07:03,434 INFO L225 Difference]: With dead ends: 1514 [2018-04-10 15:07:03,434 INFO L226 Difference]: Without dead ends: 1514 [2018-04-10 15:07:03,435 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 15:07:03,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-04-10 15:07:03,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1195. [2018-04-10 15:07:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2018-04-10 15:07:03,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1489 transitions. [2018-04-10 15:07:03,442 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1489 transitions. Word has length 792 [2018-04-10 15:07:03,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:07:03,442 INFO L459 AbstractCegarLoop]: Abstraction has 1195 states and 1489 transitions. [2018-04-10 15:07:03,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-04-10 15:07:03,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1489 transitions. [2018-04-10 15:07:03,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2018-04-10 15:07:03,446 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:07:03,446 INFO L355 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 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-10 15:07:03,446 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:07:03,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1308085788, now seen corresponding path program 58 times [2018-04-10 15:07:03,446 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:07:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:07:03,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:07:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 23250 backedges. 0 proven. 12510 refuted. 0 times theorem prover too weak. 10740 trivial. 0 not checked. [2018-04-10 15:07:05,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:07:05,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-10 15:07:05,850 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:07:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9747 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9747 trivial. 0 not checked. [2018-04-10 15:07:05,851 INFO L182 omatonBuilderFactory]: Interpolants [89857#(<= main_~i~1 24), 89856#(<= main_~i~1 23), 89859#(<= main_~i~1 26), 89858#(<= main_~i~1 25), 89861#(<= main_~i~1 28), 89860#(<= main_~i~1 27), 89863#(<= main_~i~1 30), 89862#(<= main_~i~1 29), 89865#(<= main_~i~1 32), 89864#(<= main_~i~1 31), 89867#(<= main_~i~1 34), 89866#(<= main_~i~1 33), 89869#(<= main_~i~1 36), 89868#(<= main_~i~1 35), 89871#(<= main_~i~1 38), 89870#(<= main_~i~1 37), 89873#(<= main_~i~1 40), 89872#(<= main_~i~1 39), 89875#(<= main_~i~1 42), 89874#(<= main_~i~1 41), 89877#(<= main_~i~1 44), 89876#(<= main_~i~1 43), 89879#(<= main_~i~1 46), 89878#(<= main_~i~1 45), 89881#(<= main_~i~1 48), 89880#(<= main_~i~1 47), 89883#(<= main_~i~1 50), 89882#(<= main_~i~1 49), 89885#(<= main_~i~1 52), 89884#(<= main_~i~1 51), 89887#(<= main_~i~1 54), 89886#(<= main_~i~1 53), 89889#(<= main_~i~1 56), 89888#(<= main_~i~1 55), 89891#(<= main_~i~1 58), 89890#(<= main_~i~1 57), 89893#(<= main_~i~1 60), 89892#(<= main_~i~1 59), 89831#true, 89833#(= main_~i~1 0), 89832#false, 89835#(<= main_~i~1 2), 89834#(<= main_~i~1 1), 89837#(<= main_~i~1 4), 89836#(<= main_~i~1 3), 89839#(<= main_~i~1 6), 89838#(<= main_~i~1 5), 89841#(<= main_~i~1 8), 89840#(<= main_~i~1 7), 89843#(<= main_~i~1 10), 89842#(<= main_~i~1 9), 89845#(<= main_~i~1 12), 89844#(<= main_~i~1 11), 89847#(<= main_~i~1 14), 89846#(<= main_~i~1 13), 89849#(<= main_~i~1 16), 89848#(<= main_~i~1 15), 89851#(<= main_~i~1 18), 89850#(<= main_~i~1 17), 89853#(<= main_~i~1 20), 89852#(<= main_~i~1 19), 89855#(<= main_~i~1 22), 89854#(<= main_~i~1 21)] [2018-04-10 15:07:05,852 INFO L134 CoverageAnalysis]: Checked inductivity of 23250 backedges. 0 proven. 12510 refuted. 0 times theorem prover too weak. 10740 trivial. 0 not checked. [2018-04-10 15:07:05,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-10 15:07:05,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-10 15:07:05,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 15:07:05,853 INFO L87 Difference]: Start difference. First operand 1195 states and 1489 transitions. Second operand 63 states. [2018-04-10 15:07:06,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:07:06,609 INFO L93 Difference]: Finished difference Result 1538 states and 1781 transitions. [2018-04-10 15:07:06,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-10 15:07:06,610 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 805 [2018-04-10 15:07:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:07:06,612 INFO L225 Difference]: With dead ends: 1538 [2018-04-10 15:07:06,612 INFO L226 Difference]: Without dead ends: 1538 [2018-04-10 15:07:06,612 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 15:07:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2018-04-10 15:07:06,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1214. [2018-04-10 15:07:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-04-10 15:07:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1513 transitions. [2018-04-10 15:07:06,622 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1513 transitions. Word has length 805 [2018-04-10 15:07:06,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:07:06,622 INFO L459 AbstractCegarLoop]: Abstraction has 1214 states and 1513 transitions. [2018-04-10 15:07:06,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-10 15:07:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1513 transitions. [2018-04-10 15:07:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2018-04-10 15:07:06,626 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:07:06,626 INFO L355 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 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-10 15:07:06,626 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:07:06,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1767551614, now seen corresponding path program 59 times [2018-04-10 15:07:06,627 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:07:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:07:06,670 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:07:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 24034 backedges. 0 proven. 12932 refuted. 0 times theorem prover too weak. 11102 trivial. 0 not checked. [2018-04-10 15:07:09,183 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:07:09,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-10 15:07:09,184 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:07:09,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10092 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10092 trivial. 0 not checked. [2018-04-10 15:07:09,184 INFO L182 omatonBuilderFactory]: Interpolants [92673#(<= main_~i~1 25), 92672#(<= main_~i~1 24), 92675#(<= main_~i~1 27), 92674#(<= main_~i~1 26), 92677#(<= main_~i~1 29), 92676#(<= main_~i~1 28), 92679#(<= main_~i~1 31), 92678#(<= main_~i~1 30), 92681#(<= main_~i~1 33), 92680#(<= main_~i~1 32), 92683#(<= main_~i~1 35), 92682#(<= main_~i~1 34), 92685#(<= main_~i~1 37), 92684#(<= main_~i~1 36), 92687#(<= main_~i~1 39), 92686#(<= main_~i~1 38), 92689#(<= main_~i~1 41), 92688#(<= main_~i~1 40), 92691#(<= main_~i~1 43), 92690#(<= main_~i~1 42), 92693#(<= main_~i~1 45), 92692#(<= main_~i~1 44), 92695#(<= main_~i~1 47), 92694#(<= main_~i~1 46), 92697#(<= main_~i~1 49), 92696#(<= main_~i~1 48), 92699#(<= main_~i~1 51), 92698#(<= main_~i~1 50), 92701#(<= main_~i~1 53), 92700#(<= main_~i~1 52), 92703#(<= main_~i~1 55), 92702#(<= main_~i~1 54), 92705#(<= main_~i~1 57), 92704#(<= main_~i~1 56), 92707#(<= main_~i~1 59), 92706#(<= main_~i~1 58), 92709#(<= main_~i~1 61), 92708#(<= main_~i~1 60), 92647#false, 92646#true, 92649#(<= main_~i~1 1), 92648#(= main_~i~1 0), 92651#(<= main_~i~1 3), 92650#(<= main_~i~1 2), 92653#(<= main_~i~1 5), 92652#(<= main_~i~1 4), 92655#(<= main_~i~1 7), 92654#(<= main_~i~1 6), 92657#(<= main_~i~1 9), 92656#(<= main_~i~1 8), 92659#(<= main_~i~1 11), 92658#(<= main_~i~1 10), 92661#(<= main_~i~1 13), 92660#(<= main_~i~1 12), 92663#(<= main_~i~1 15), 92662#(<= main_~i~1 14), 92665#(<= main_~i~1 17), 92664#(<= main_~i~1 16), 92667#(<= main_~i~1 19), 92666#(<= main_~i~1 18), 92669#(<= main_~i~1 21), 92668#(<= main_~i~1 20), 92671#(<= main_~i~1 23), 92670#(<= main_~i~1 22)] [2018-04-10 15:07:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 24034 backedges. 0 proven. 12932 refuted. 0 times theorem prover too weak. 11102 trivial. 0 not checked. [2018-04-10 15:07:09,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-10 15:07:09,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-10 15:07:09,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 15:07:09,186 INFO L87 Difference]: Start difference. First operand 1214 states and 1513 transitions. Second operand 64 states. [2018-04-10 15:07:10,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:07:10,006 INFO L93 Difference]: Finished difference Result 1562 states and 1809 transitions. [2018-04-10 15:07:10,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-10 15:07:10,006 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 818 [2018-04-10 15:07:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:07:10,008 INFO L225 Difference]: With dead ends: 1562 [2018-04-10 15:07:10,008 INFO L226 Difference]: Without dead ends: 1562 [2018-04-10 15:07:10,008 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 15:07:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2018-04-10 15:07:10,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1233. [2018-04-10 15:07:10,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2018-04-10 15:07:10,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1537 transitions. [2018-04-10 15:07:10,016 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1537 transitions. Word has length 818 [2018-04-10 15:07:10,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:07:10,016 INFO L459 AbstractCegarLoop]: Abstraction has 1233 states and 1537 transitions. [2018-04-10 15:07:10,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-10 15:07:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1537 transitions. [2018-04-10 15:07:10,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-04-10 15:07:10,020 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:07:10,020 INFO L355 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 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-10 15:07:10,020 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:07:10,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1803779108, now seen corresponding path program 60 times [2018-04-10 15:07:10,020 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:07:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:07:10,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:07:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 24831 backedges. 0 proven. 13361 refuted. 0 times theorem prover too weak. 11470 trivial. 0 not checked. [2018-04-10 15:07:12,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:07:12,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-04-10 15:07:12,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:07:12,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10443 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10443 trivial. 0 not checked. [2018-04-10 15:07:12,666 INFO L182 omatonBuilderFactory]: Interpolants [95505#true, 95507#(= main_~i~1 0), 95506#false, 95509#(<= main_~i~1 2), 95508#(<= main_~i~1 1), 95511#(<= main_~i~1 4), 95510#(<= main_~i~1 3), 95513#(<= main_~i~1 6), 95512#(<= main_~i~1 5), 95515#(<= main_~i~1 8), 95514#(<= main_~i~1 7), 95517#(<= main_~i~1 10), 95516#(<= main_~i~1 9), 95519#(<= main_~i~1 12), 95518#(<= main_~i~1 11), 95521#(<= main_~i~1 14), 95520#(<= main_~i~1 13), 95523#(<= main_~i~1 16), 95522#(<= main_~i~1 15), 95525#(<= main_~i~1 18), 95524#(<= main_~i~1 17), 95527#(<= main_~i~1 20), 95526#(<= main_~i~1 19), 95529#(<= main_~i~1 22), 95528#(<= main_~i~1 21), 95531#(<= main_~i~1 24), 95530#(<= main_~i~1 23), 95533#(<= main_~i~1 26), 95532#(<= main_~i~1 25), 95535#(<= main_~i~1 28), 95534#(<= main_~i~1 27), 95537#(<= main_~i~1 30), 95536#(<= main_~i~1 29), 95539#(<= main_~i~1 32), 95538#(<= main_~i~1 31), 95541#(<= main_~i~1 34), 95540#(<= main_~i~1 33), 95543#(<= main_~i~1 36), 95542#(<= main_~i~1 35), 95545#(<= main_~i~1 38), 95544#(<= main_~i~1 37), 95547#(<= main_~i~1 40), 95546#(<= main_~i~1 39), 95549#(<= main_~i~1 42), 95548#(<= main_~i~1 41), 95551#(<= main_~i~1 44), 95550#(<= main_~i~1 43), 95553#(<= main_~i~1 46), 95552#(<= main_~i~1 45), 95555#(<= main_~i~1 48), 95554#(<= main_~i~1 47), 95557#(<= main_~i~1 50), 95556#(<= main_~i~1 49), 95559#(<= main_~i~1 52), 95558#(<= main_~i~1 51), 95561#(<= main_~i~1 54), 95560#(<= main_~i~1 53), 95563#(<= main_~i~1 56), 95562#(<= main_~i~1 55), 95565#(<= main_~i~1 58), 95564#(<= main_~i~1 57), 95567#(<= main_~i~1 60), 95566#(<= main_~i~1 59), 95569#(<= main_~i~1 62), 95568#(<= main_~i~1 61)] [2018-04-10 15:07:12,667 INFO L134 CoverageAnalysis]: Checked inductivity of 24831 backedges. 0 proven. 13361 refuted. 0 times theorem prover too weak. 11470 trivial. 0 not checked. [2018-04-10 15:07:12,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-10 15:07:12,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-10 15:07:12,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 15:07:12,667 INFO L87 Difference]: Start difference. First operand 1233 states and 1537 transitions. Second operand 65 states. [2018-04-10 15:07:13,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:07:13,878 INFO L93 Difference]: Finished difference Result 1586 states and 1837 transitions. [2018-04-10 15:07:13,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-10 15:07:13,878 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 831 [2018-04-10 15:07:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:07:13,880 INFO L225 Difference]: With dead ends: 1586 [2018-04-10 15:07:13,880 INFO L226 Difference]: Without dead ends: 1586 [2018-04-10 15:07:13,880 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-04-10 15:07:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2018-04-10 15:07:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1252. [2018-04-10 15:07:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-04-10 15:07:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1561 transitions. [2018-04-10 15:07:13,889 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1561 transitions. Word has length 831 [2018-04-10 15:07:13,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:07:13,889 INFO L459 AbstractCegarLoop]: Abstraction has 1252 states and 1561 transitions. [2018-04-10 15:07:13,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-10 15:07:13,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1561 transitions. [2018-04-10 15:07:13,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 845 [2018-04-10 15:07:13,893 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:07:13,893 INFO L355 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 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-10 15:07:13,893 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:07:13,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1015410626, now seen corresponding path program 61 times [2018-04-10 15:07:13,894 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:07:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:07:13,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:07:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 25641 backedges. 0 proven. 13797 refuted. 0 times theorem prover too weak. 11844 trivial. 0 not checked. [2018-04-10 15:07:16,600 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:07:16,600 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-10 15:07:16,600 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:07:16,601 INFO L134 CoverageAnalysis]: Checked inductivity of 10800 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10800 trivial. 0 not checked. [2018-04-10 15:07:16,601 INFO L182 omatonBuilderFactory]: Interpolants [98433#(<= main_~i~1 23), 98432#(<= main_~i~1 22), 98435#(<= main_~i~1 25), 98434#(<= main_~i~1 24), 98437#(<= main_~i~1 27), 98436#(<= main_~i~1 26), 98439#(<= main_~i~1 29), 98438#(<= main_~i~1 28), 98441#(<= main_~i~1 31), 98440#(<= main_~i~1 30), 98443#(<= main_~i~1 33), 98442#(<= main_~i~1 32), 98445#(<= main_~i~1 35), 98444#(<= main_~i~1 34), 98447#(<= main_~i~1 37), 98446#(<= main_~i~1 36), 98449#(<= main_~i~1 39), 98448#(<= main_~i~1 38), 98451#(<= main_~i~1 41), 98450#(<= main_~i~1 40), 98453#(<= main_~i~1 43), 98452#(<= main_~i~1 42), 98455#(<= main_~i~1 45), 98454#(<= main_~i~1 44), 98457#(<= main_~i~1 47), 98456#(<= main_~i~1 46), 98459#(<= main_~i~1 49), 98458#(<= main_~i~1 48), 98461#(<= main_~i~1 51), 98460#(<= main_~i~1 50), 98463#(<= main_~i~1 53), 98462#(<= main_~i~1 52), 98465#(<= main_~i~1 55), 98464#(<= main_~i~1 54), 98467#(<= main_~i~1 57), 98466#(<= main_~i~1 56), 98469#(<= main_~i~1 59), 98468#(<= main_~i~1 58), 98471#(<= main_~i~1 61), 98470#(<= main_~i~1 60), 98473#(<= main_~i~1 63), 98472#(<= main_~i~1 62), 98409#false, 98408#true, 98411#(<= main_~i~1 1), 98410#(= main_~i~1 0), 98413#(<= main_~i~1 3), 98412#(<= main_~i~1 2), 98415#(<= main_~i~1 5), 98414#(<= main_~i~1 4), 98417#(<= main_~i~1 7), 98416#(<= main_~i~1 6), 98419#(<= main_~i~1 9), 98418#(<= main_~i~1 8), 98421#(<= main_~i~1 11), 98420#(<= main_~i~1 10), 98423#(<= main_~i~1 13), 98422#(<= main_~i~1 12), 98425#(<= main_~i~1 15), 98424#(<= main_~i~1 14), 98427#(<= main_~i~1 17), 98426#(<= main_~i~1 16), 98429#(<= main_~i~1 19), 98428#(<= main_~i~1 18), 98431#(<= main_~i~1 21), 98430#(<= main_~i~1 20)] [2018-04-10 15:07:16,602 INFO L134 CoverageAnalysis]: Checked inductivity of 25641 backedges. 0 proven. 13797 refuted. 0 times theorem prover too weak. 11844 trivial. 0 not checked. [2018-04-10 15:07:16,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-10 15:07:16,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-10 15:07:16,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 15:07:16,602 INFO L87 Difference]: Start difference. First operand 1252 states and 1561 transitions. Second operand 66 states. [2018-04-10 15:07:17,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:07:17,479 INFO L93 Difference]: Finished difference Result 1610 states and 1865 transitions. [2018-04-10 15:07:17,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-04-10 15:07:17,480 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 844 [2018-04-10 15:07:17,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:07:17,481 INFO L225 Difference]: With dead ends: 1610 [2018-04-10 15:07:17,481 INFO L226 Difference]: Without dead ends: 1610 [2018-04-10 15:07:17,481 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 15:07:17,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2018-04-10 15:07:17,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1271. [2018-04-10 15:07:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1271 states. [2018-04-10 15:07:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1585 transitions. [2018-04-10 15:07:17,489 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1585 transitions. Word has length 844 [2018-04-10 15:07:17,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:07:17,489 INFO L459 AbstractCegarLoop]: Abstraction has 1271 states and 1585 transitions. [2018-04-10 15:07:17,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-10 15:07:17,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1585 transitions. [2018-04-10 15:07:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 858 [2018-04-10 15:07:17,493 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:07:17,493 INFO L355 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 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-10 15:07:17,493 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:07:17,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1269139868, now seen corresponding path program 62 times [2018-04-10 15:07:17,494 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:07:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:07:17,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:07:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 26464 backedges. 0 proven. 14240 refuted. 0 times theorem prover too weak. 12224 trivial. 0 not checked. [2018-04-10 15:07:20,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:07:20,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-04-10 15:07:20,310 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:07:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 11163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11163 trivial. 0 not checked. [2018-04-10 15:07:20,311 INFO L182 omatonBuilderFactory]: Interpolants [101377#(<= main_~i~1 20), 101376#(<= main_~i~1 19), 101379#(<= main_~i~1 22), 101378#(<= main_~i~1 21), 101381#(<= main_~i~1 24), 101380#(<= main_~i~1 23), 101383#(<= main_~i~1 26), 101382#(<= main_~i~1 25), 101385#(<= main_~i~1 28), 101384#(<= main_~i~1 27), 101387#(<= main_~i~1 30), 101386#(<= main_~i~1 29), 101389#(<= main_~i~1 32), 101388#(<= main_~i~1 31), 101391#(<= main_~i~1 34), 101390#(<= main_~i~1 33), 101393#(<= main_~i~1 36), 101392#(<= main_~i~1 35), 101395#(<= main_~i~1 38), 101394#(<= main_~i~1 37), 101397#(<= main_~i~1 40), 101396#(<= main_~i~1 39), 101399#(<= main_~i~1 42), 101398#(<= main_~i~1 41), 101401#(<= main_~i~1 44), 101400#(<= main_~i~1 43), 101403#(<= main_~i~1 46), 101402#(<= main_~i~1 45), 101405#(<= main_~i~1 48), 101404#(<= main_~i~1 47), 101407#(<= main_~i~1 50), 101406#(<= main_~i~1 49), 101409#(<= main_~i~1 52), 101408#(<= main_~i~1 51), 101411#(<= main_~i~1 54), 101410#(<= main_~i~1 53), 101413#(<= main_~i~1 56), 101412#(<= main_~i~1 55), 101415#(<= main_~i~1 58), 101414#(<= main_~i~1 57), 101417#(<= main_~i~1 60), 101416#(<= main_~i~1 59), 101419#(<= main_~i~1 62), 101418#(<= main_~i~1 61), 101421#(<= main_~i~1 64), 101420#(<= main_~i~1 63), 101355#true, 101357#(= main_~i~1 0), 101356#false, 101359#(<= main_~i~1 2), 101358#(<= main_~i~1 1), 101361#(<= main_~i~1 4), 101360#(<= main_~i~1 3), 101363#(<= main_~i~1 6), 101362#(<= main_~i~1 5), 101365#(<= main_~i~1 8), 101364#(<= main_~i~1 7), 101367#(<= main_~i~1 10), 101366#(<= main_~i~1 9), 101369#(<= main_~i~1 12), 101368#(<= main_~i~1 11), 101371#(<= main_~i~1 14), 101370#(<= main_~i~1 13), 101373#(<= main_~i~1 16), 101372#(<= main_~i~1 15), 101375#(<= main_~i~1 18), 101374#(<= main_~i~1 17)] [2018-04-10 15:07:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 26464 backedges. 0 proven. 14240 refuted. 0 times theorem prover too weak. 12224 trivial. 0 not checked. [2018-04-10 15:07:20,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-10 15:07:20,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-10 15:07:20,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 15:07:20,313 INFO L87 Difference]: Start difference. First operand 1271 states and 1585 transitions. Second operand 67 states. [2018-04-10 15:07:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:07:21,304 INFO L93 Difference]: Finished difference Result 1634 states and 1893 transitions. [2018-04-10 15:07:21,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-10 15:07:21,305 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 857 [2018-04-10 15:07:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:07:21,307 INFO L225 Difference]: With dead ends: 1634 [2018-04-10 15:07:21,307 INFO L226 Difference]: Without dead ends: 1634 [2018-04-10 15:07:21,307 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-04-10 15:07:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2018-04-10 15:07:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1290. [2018-04-10 15:07:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-04-10 15:07:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1609 transitions. [2018-04-10 15:07:21,316 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1609 transitions. Word has length 857 [2018-04-10 15:07:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:07:21,316 INFO L459 AbstractCegarLoop]: Abstraction has 1290 states and 1609 transitions. [2018-04-10 15:07:21,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-10 15:07:21,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1609 transitions. [2018-04-10 15:07:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2018-04-10 15:07:21,321 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:07:21,321 INFO L355 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 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-10 15:07:21,321 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:07:21,322 INFO L82 PathProgramCache]: Analyzing trace with hash 347848190, now seen corresponding path program 63 times [2018-04-10 15:07:21,322 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:07:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:07:21,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:07:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 27300 backedges. 0 proven. 14690 refuted. 0 times theorem prover too weak. 12610 trivial. 0 not checked. [2018-04-10 15:07:24,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:07:24,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-10 15:07:24,240 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:07:24,241 INFO L134 CoverageAnalysis]: Checked inductivity of 11532 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11532 trivial. 0 not checked. [2018-04-10 15:07:24,241 INFO L182 omatonBuilderFactory]: Interpolants [104347#false, 104346#true, 104349#(<= main_~i~1 1), 104348#(= main_~i~1 0), 104351#(<= main_~i~1 3), 104350#(<= main_~i~1 2), 104353#(<= main_~i~1 5), 104352#(<= main_~i~1 4), 104355#(<= main_~i~1 7), 104354#(<= main_~i~1 6), 104357#(<= main_~i~1 9), 104356#(<= main_~i~1 8), 104359#(<= main_~i~1 11), 104358#(<= main_~i~1 10), 104361#(<= main_~i~1 13), 104360#(<= main_~i~1 12), 104363#(<= main_~i~1 15), 104362#(<= main_~i~1 14), 104365#(<= main_~i~1 17), 104364#(<= main_~i~1 16), 104367#(<= main_~i~1 19), 104366#(<= main_~i~1 18), 104369#(<= main_~i~1 21), 104368#(<= main_~i~1 20), 104371#(<= main_~i~1 23), 104370#(<= main_~i~1 22), 104373#(<= main_~i~1 25), 104372#(<= main_~i~1 24), 104375#(<= main_~i~1 27), 104374#(<= main_~i~1 26), 104377#(<= main_~i~1 29), 104376#(<= main_~i~1 28), 104379#(<= main_~i~1 31), 104378#(<= main_~i~1 30), 104381#(<= main_~i~1 33), 104380#(<= main_~i~1 32), 104383#(<= main_~i~1 35), 104382#(<= main_~i~1 34), 104385#(<= main_~i~1 37), 104384#(<= main_~i~1 36), 104387#(<= main_~i~1 39), 104386#(<= main_~i~1 38), 104389#(<= main_~i~1 41), 104388#(<= main_~i~1 40), 104391#(<= main_~i~1 43), 104390#(<= main_~i~1 42), 104393#(<= main_~i~1 45), 104392#(<= main_~i~1 44), 104395#(<= main_~i~1 47), 104394#(<= main_~i~1 46), 104397#(<= main_~i~1 49), 104396#(<= main_~i~1 48), 104399#(<= main_~i~1 51), 104398#(<= main_~i~1 50), 104401#(<= main_~i~1 53), 104400#(<= main_~i~1 52), 104403#(<= main_~i~1 55), 104402#(<= main_~i~1 54), 104405#(<= main_~i~1 57), 104404#(<= main_~i~1 56), 104407#(<= main_~i~1 59), 104406#(<= main_~i~1 58), 104409#(<= main_~i~1 61), 104408#(<= main_~i~1 60), 104411#(<= main_~i~1 63), 104410#(<= main_~i~1 62), 104413#(<= main_~i~1 65), 104412#(<= main_~i~1 64)] [2018-04-10 15:07:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 27300 backedges. 0 proven. 14690 refuted. 0 times theorem prover too weak. 12610 trivial. 0 not checked. [2018-04-10 15:07:24,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-10 15:07:24,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-10 15:07:24,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 15:07:24,243 INFO L87 Difference]: Start difference. First operand 1290 states and 1609 transitions. Second operand 68 states. [2018-04-10 15:07:25,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:07:25,518 INFO L93 Difference]: Finished difference Result 1658 states and 1921 transitions. [2018-04-10 15:07:25,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-10 15:07:25,518 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 870 [2018-04-10 15:07:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:07:25,520 INFO L225 Difference]: With dead ends: 1658 [2018-04-10 15:07:25,520 INFO L226 Difference]: Without dead ends: 1658 [2018-04-10 15:07:25,520 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-04-10 15:07:25,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2018-04-10 15:07:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1309. [2018-04-10 15:07:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2018-04-10 15:07:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1633 transitions. [2018-04-10 15:07:25,528 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1633 transitions. Word has length 870 [2018-04-10 15:07:25,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:07:25,529 INFO L459 AbstractCegarLoop]: Abstraction has 1309 states and 1633 transitions. [2018-04-10 15:07:25,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-10 15:07:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1633 transitions. [2018-04-10 15:07:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2018-04-10 15:07:25,533 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:07:25,533 INFO L355 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 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-10 15:07:25,533 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:07:25,534 INFO L82 PathProgramCache]: Analyzing trace with hash 2085691556, now seen corresponding path program 64 times [2018-04-10 15:07:25,534 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:07:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:07:25,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:07:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 28149 backedges. 0 proven. 15147 refuted. 0 times theorem prover too weak. 13002 trivial. 0 not checked. [2018-04-10 15:07:28,522 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:07:28,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-04-10 15:07:28,523 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:07:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 11907 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11907 trivial. 0 not checked. [2018-04-10 15:07:28,523 INFO L182 omatonBuilderFactory]: Interpolants [107393#(<= main_~i~1 10), 107392#(<= main_~i~1 9), 107395#(<= main_~i~1 12), 107394#(<= main_~i~1 11), 107397#(<= main_~i~1 14), 107396#(<= main_~i~1 13), 107399#(<= main_~i~1 16), 107398#(<= main_~i~1 15), 107401#(<= main_~i~1 18), 107400#(<= main_~i~1 17), 107403#(<= main_~i~1 20), 107402#(<= main_~i~1 19), 107405#(<= main_~i~1 22), 107404#(<= main_~i~1 21), 107407#(<= main_~i~1 24), 107406#(<= main_~i~1 23), 107409#(<= main_~i~1 26), 107408#(<= main_~i~1 25), 107411#(<= main_~i~1 28), 107410#(<= main_~i~1 27), 107413#(<= main_~i~1 30), 107412#(<= main_~i~1 29), 107415#(<= main_~i~1 32), 107414#(<= main_~i~1 31), 107417#(<= main_~i~1 34), 107416#(<= main_~i~1 33), 107419#(<= main_~i~1 36), 107418#(<= main_~i~1 35), 107421#(<= main_~i~1 38), 107420#(<= main_~i~1 37), 107423#(<= main_~i~1 40), 107422#(<= main_~i~1 39), 107425#(<= main_~i~1 42), 107424#(<= main_~i~1 41), 107427#(<= main_~i~1 44), 107426#(<= main_~i~1 43), 107429#(<= main_~i~1 46), 107428#(<= main_~i~1 45), 107431#(<= main_~i~1 48), 107430#(<= main_~i~1 47), 107433#(<= main_~i~1 50), 107432#(<= main_~i~1 49), 107435#(<= main_~i~1 52), 107434#(<= main_~i~1 51), 107437#(<= main_~i~1 54), 107436#(<= main_~i~1 53), 107439#(<= main_~i~1 56), 107438#(<= main_~i~1 55), 107441#(<= main_~i~1 58), 107440#(<= main_~i~1 57), 107443#(<= main_~i~1 60), 107442#(<= main_~i~1 59), 107445#(<= main_~i~1 62), 107444#(<= main_~i~1 61), 107447#(<= main_~i~1 64), 107446#(<= main_~i~1 63), 107449#(<= main_~i~1 66), 107448#(<= main_~i~1 65), 107381#true, 107383#(= main_~i~1 0), 107382#false, 107385#(<= main_~i~1 2), 107384#(<= main_~i~1 1), 107387#(<= main_~i~1 4), 107386#(<= main_~i~1 3), 107389#(<= main_~i~1 6), 107388#(<= main_~i~1 5), 107391#(<= main_~i~1 8), 107390#(<= main_~i~1 7)] [2018-04-10 15:07:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 28149 backedges. 0 proven. 15147 refuted. 0 times theorem prover too weak. 13002 trivial. 0 not checked. [2018-04-10 15:07:28,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-10 15:07:28,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-10 15:07:28,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 15:07:28,525 INFO L87 Difference]: Start difference. First operand 1309 states and 1633 transitions. Second operand 69 states. [2018-04-10 15:07:29,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:07:29,708 INFO L93 Difference]: Finished difference Result 1682 states and 1949 transitions. [2018-04-10 15:07:29,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-10 15:07:29,708 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 883 [2018-04-10 15:07:29,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:07:29,710 INFO L225 Difference]: With dead ends: 1682 [2018-04-10 15:07:29,710 INFO L226 Difference]: Without dead ends: 1682 [2018-04-10 15:07:29,711 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 15:07:29,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2018-04-10 15:07:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1328. [2018-04-10 15:07:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2018-04-10 15:07:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1657 transitions. [2018-04-10 15:07:29,721 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1657 transitions. Word has length 883 [2018-04-10 15:07:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:07:29,722 INFO L459 AbstractCegarLoop]: Abstraction has 1328 states and 1657 transitions. [2018-04-10 15:07:29,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-10 15:07:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1657 transitions. [2018-04-10 15:07:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 897 [2018-04-10 15:07:29,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:07:29,726 INFO L355 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 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-10 15:07:29,726 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:07:29,726 INFO L82 PathProgramCache]: Analyzing trace with hash 735820734, now seen corresponding path program 65 times [2018-04-10 15:07:29,727 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:07:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:07:29,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:07:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 29011 backedges. 0 proven. 15611 refuted. 0 times theorem prover too weak. 13400 trivial. 0 not checked. [2018-04-10 15:07:32,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:07:32,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-04-10 15:07:32,844 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:07:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12288 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12288 trivial. 0 not checked. [2018-04-10 15:07:32,845 INFO L182 omatonBuilderFactory]: Interpolants [110465#(<= main_~i~1 3), 110464#(<= main_~i~1 2), 110467#(<= main_~i~1 5), 110466#(<= main_~i~1 4), 110469#(<= main_~i~1 7), 110468#(<= main_~i~1 6), 110471#(<= main_~i~1 9), 110470#(<= main_~i~1 8), 110473#(<= main_~i~1 11), 110472#(<= main_~i~1 10), 110475#(<= main_~i~1 13), 110474#(<= main_~i~1 12), 110477#(<= main_~i~1 15), 110476#(<= main_~i~1 14), 110479#(<= main_~i~1 17), 110478#(<= main_~i~1 16), 110481#(<= main_~i~1 19), 110480#(<= main_~i~1 18), 110483#(<= main_~i~1 21), 110482#(<= main_~i~1 20), 110485#(<= main_~i~1 23), 110484#(<= main_~i~1 22), 110487#(<= main_~i~1 25), 110486#(<= main_~i~1 24), 110489#(<= main_~i~1 27), 110488#(<= main_~i~1 26), 110491#(<= main_~i~1 29), 110490#(<= main_~i~1 28), 110493#(<= main_~i~1 31), 110492#(<= main_~i~1 30), 110495#(<= main_~i~1 33), 110494#(<= main_~i~1 32), 110497#(<= main_~i~1 35), 110496#(<= main_~i~1 34), 110499#(<= main_~i~1 37), 110498#(<= main_~i~1 36), 110501#(<= main_~i~1 39), 110500#(<= main_~i~1 38), 110503#(<= main_~i~1 41), 110502#(<= main_~i~1 40), 110505#(<= main_~i~1 43), 110504#(<= main_~i~1 42), 110507#(<= main_~i~1 45), 110506#(<= main_~i~1 44), 110509#(<= main_~i~1 47), 110508#(<= main_~i~1 46), 110511#(<= main_~i~1 49), 110510#(<= main_~i~1 48), 110513#(<= main_~i~1 51), 110512#(<= main_~i~1 50), 110515#(<= main_~i~1 53), 110514#(<= main_~i~1 52), 110517#(<= main_~i~1 55), 110516#(<= main_~i~1 54), 110519#(<= main_~i~1 57), 110518#(<= main_~i~1 56), 110521#(<= main_~i~1 59), 110520#(<= main_~i~1 58), 110523#(<= main_~i~1 61), 110522#(<= main_~i~1 60), 110525#(<= main_~i~1 63), 110524#(<= main_~i~1 62), 110527#(<= main_~i~1 65), 110526#(<= main_~i~1 64), 110529#(<= main_~i~1 67), 110528#(<= main_~i~1 66), 110461#false, 110460#true, 110463#(<= main_~i~1 1), 110462#(= main_~i~1 0)] [2018-04-10 15:07:32,846 INFO L134 CoverageAnalysis]: Checked inductivity of 29011 backedges. 0 proven. 15611 refuted. 0 times theorem prover too weak. 13400 trivial. 0 not checked. [2018-04-10 15:07:32,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-10 15:07:32,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-10 15:07:32,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 15:07:32,846 INFO L87 Difference]: Start difference. First operand 1328 states and 1657 transitions. Second operand 70 states. [2018-04-10 15:07:34,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:07:34,334 INFO L93 Difference]: Finished difference Result 1706 states and 1977 transitions. [2018-04-10 15:07:34,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-10 15:07:34,334 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 896 [2018-04-10 15:07:34,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:07:34,336 INFO L225 Difference]: With dead ends: 1706 [2018-04-10 15:07:34,336 INFO L226 Difference]: Without dead ends: 1706 [2018-04-10 15:07:34,337 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 15:07:34,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2018-04-10 15:07:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1347. [2018-04-10 15:07:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2018-04-10 15:07:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1681 transitions. [2018-04-10 15:07:34,346 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1681 transitions. Word has length 896 [2018-04-10 15:07:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:07:34,346 INFO L459 AbstractCegarLoop]: Abstraction has 1347 states and 1681 transitions. [2018-04-10 15:07:34,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-10 15:07:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1681 transitions. [2018-04-10 15:07:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2018-04-10 15:07:34,350 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:07:34,351 INFO L355 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 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-10 15:07:34,351 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:07:34,351 INFO L82 PathProgramCache]: Analyzing trace with hash -970229020, now seen corresponding path program 66 times [2018-04-10 15:07:34,351 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:07:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:07:34,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:07:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 29886 backedges. 0 proven. 16082 refuted. 0 times theorem prover too weak. 13804 trivial. 0 not checked. [2018-04-10 15:07:37,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:07:37,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-04-10 15:07:37,657 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:07:37,658 INFO L134 CoverageAnalysis]: Checked inductivity of 12675 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12675 trivial. 0 not checked. [2018-04-10 15:07:37,658 INFO L182 omatonBuilderFactory]: Interpolants [113583#true, 113585#(= main_~i~1 0), 113584#false, 113587#(<= main_~i~1 2), 113586#(<= main_~i~1 1), 113589#(<= main_~i~1 4), 113588#(<= main_~i~1 3), 113591#(<= main_~i~1 6), 113590#(<= main_~i~1 5), 113593#(<= main_~i~1 8), 113592#(<= main_~i~1 7), 113595#(<= main_~i~1 10), 113594#(<= main_~i~1 9), 113597#(<= main_~i~1 12), 113596#(<= main_~i~1 11), 113599#(<= main_~i~1 14), 113598#(<= main_~i~1 13), 113601#(<= main_~i~1 16), 113600#(<= main_~i~1 15), 113603#(<= main_~i~1 18), 113602#(<= main_~i~1 17), 113605#(<= main_~i~1 20), 113604#(<= main_~i~1 19), 113607#(<= main_~i~1 22), 113606#(<= main_~i~1 21), 113609#(<= main_~i~1 24), 113608#(<= main_~i~1 23), 113611#(<= main_~i~1 26), 113610#(<= main_~i~1 25), 113613#(<= main_~i~1 28), 113612#(<= main_~i~1 27), 113615#(<= main_~i~1 30), 113614#(<= main_~i~1 29), 113617#(<= main_~i~1 32), 113616#(<= main_~i~1 31), 113619#(<= main_~i~1 34), 113618#(<= main_~i~1 33), 113621#(<= main_~i~1 36), 113620#(<= main_~i~1 35), 113623#(<= main_~i~1 38), 113622#(<= main_~i~1 37), 113625#(<= main_~i~1 40), 113624#(<= main_~i~1 39), 113627#(<= main_~i~1 42), 113626#(<= main_~i~1 41), 113629#(<= main_~i~1 44), 113628#(<= main_~i~1 43), 113631#(<= main_~i~1 46), 113630#(<= main_~i~1 45), 113633#(<= main_~i~1 48), 113632#(<= main_~i~1 47), 113635#(<= main_~i~1 50), 113634#(<= main_~i~1 49), 113637#(<= main_~i~1 52), 113636#(<= main_~i~1 51), 113639#(<= main_~i~1 54), 113638#(<= main_~i~1 53), 113641#(<= main_~i~1 56), 113640#(<= main_~i~1 55), 113643#(<= main_~i~1 58), 113642#(<= main_~i~1 57), 113645#(<= main_~i~1 60), 113644#(<= main_~i~1 59), 113647#(<= main_~i~1 62), 113646#(<= main_~i~1 61), 113649#(<= main_~i~1 64), 113648#(<= main_~i~1 63), 113651#(<= main_~i~1 66), 113650#(<= main_~i~1 65), 113653#(<= main_~i~1 68), 113652#(<= main_~i~1 67)] [2018-04-10 15:07:37,659 INFO L134 CoverageAnalysis]: Checked inductivity of 29886 backedges. 0 proven. 16082 refuted. 0 times theorem prover too weak. 13804 trivial. 0 not checked. [2018-04-10 15:07:37,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-10 15:07:37,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-10 15:07:37,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-04-10 15:07:37,659 INFO L87 Difference]: Start difference. First operand 1347 states and 1681 transitions. Second operand 71 states. [2018-04-10 15:07:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:07:39,140 INFO L93 Difference]: Finished difference Result 1730 states and 2005 transitions. [2018-04-10 15:07:39,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-10 15:07:39,141 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 909 [2018-04-10 15:07:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:07:39,143 INFO L225 Difference]: With dead ends: 1730 [2018-04-10 15:07:39,143 INFO L226 Difference]: Without dead ends: 1730 [2018-04-10 15:07:39,143 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-04-10 15:07:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2018-04-10 15:07:39,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1366. [2018-04-10 15:07:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1366 states. [2018-04-10 15:07:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1705 transitions. [2018-04-10 15:07:39,155 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1705 transitions. Word has length 909 [2018-04-10 15:07:39,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:07:39,156 INFO L459 AbstractCegarLoop]: Abstraction has 1366 states and 1705 transitions. [2018-04-10 15:07:39,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-10 15:07:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1705 transitions. [2018-04-10 15:07:39,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2018-04-10 15:07:39,164 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:07:39,164 INFO L355 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 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-10 15:07:39,164 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:07:39,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1533671042, now seen corresponding path program 67 times [2018-04-10 15:07:39,165 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:07:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:07:39,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:07:42,502 INFO L134 CoverageAnalysis]: Checked inductivity of 30774 backedges. 0 proven. 16560 refuted. 0 times theorem prover too weak. 14214 trivial. 0 not checked. [2018-04-10 15:07:42,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:07:42,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-04-10 15:07:42,503 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:07:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13068 trivial. 0 not checked. [2018-04-10 15:07:42,503 INFO L182 omatonBuilderFactory]: Interpolants [116751#false, 116750#true, 116753#(<= main_~i~1 1), 116752#(= main_~i~1 0), 116755#(<= main_~i~1 3), 116754#(<= main_~i~1 2), 116757#(<= main_~i~1 5), 116756#(<= main_~i~1 4), 116759#(<= main_~i~1 7), 116758#(<= main_~i~1 6), 116761#(<= main_~i~1 9), 116760#(<= main_~i~1 8), 116763#(<= main_~i~1 11), 116762#(<= main_~i~1 10), 116765#(<= main_~i~1 13), 116764#(<= main_~i~1 12), 116767#(<= main_~i~1 15), 116766#(<= main_~i~1 14), 116769#(<= main_~i~1 17), 116768#(<= main_~i~1 16), 116771#(<= main_~i~1 19), 116770#(<= main_~i~1 18), 116773#(<= main_~i~1 21), 116772#(<= main_~i~1 20), 116775#(<= main_~i~1 23), 116774#(<= main_~i~1 22), 116777#(<= main_~i~1 25), 116776#(<= main_~i~1 24), 116779#(<= main_~i~1 27), 116778#(<= main_~i~1 26), 116781#(<= main_~i~1 29), 116780#(<= main_~i~1 28), 116783#(<= main_~i~1 31), 116782#(<= main_~i~1 30), 116785#(<= main_~i~1 33), 116784#(<= main_~i~1 32), 116787#(<= main_~i~1 35), 116786#(<= main_~i~1 34), 116789#(<= main_~i~1 37), 116788#(<= main_~i~1 36), 116791#(<= main_~i~1 39), 116790#(<= main_~i~1 38), 116793#(<= main_~i~1 41), 116792#(<= main_~i~1 40), 116795#(<= main_~i~1 43), 116794#(<= main_~i~1 42), 116797#(<= main_~i~1 45), 116796#(<= main_~i~1 44), 116799#(<= main_~i~1 47), 116798#(<= main_~i~1 46), 116801#(<= main_~i~1 49), 116800#(<= main_~i~1 48), 116803#(<= main_~i~1 51), 116802#(<= main_~i~1 50), 116805#(<= main_~i~1 53), 116804#(<= main_~i~1 52), 116807#(<= main_~i~1 55), 116806#(<= main_~i~1 54), 116809#(<= main_~i~1 57), 116808#(<= main_~i~1 56), 116811#(<= main_~i~1 59), 116810#(<= main_~i~1 58), 116813#(<= main_~i~1 61), 116812#(<= main_~i~1 60), 116815#(<= main_~i~1 63), 116814#(<= main_~i~1 62), 116817#(<= main_~i~1 65), 116816#(<= main_~i~1 64), 116819#(<= main_~i~1 67), 116818#(<= main_~i~1 66), 116821#(<= main_~i~1 69), 116820#(<= main_~i~1 68)] [2018-04-10 15:07:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 30774 backedges. 0 proven. 16560 refuted. 0 times theorem prover too weak. 14214 trivial. 0 not checked. [2018-04-10 15:07:42,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-10 15:07:42,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-10 15:07:42,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 15:07:42,505 INFO L87 Difference]: Start difference. First operand 1366 states and 1705 transitions. Second operand 72 states. [2018-04-10 15:07:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:07:44,167 INFO L93 Difference]: Finished difference Result 1754 states and 2033 transitions. [2018-04-10 15:07:44,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-04-10 15:07:44,168 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 922 [2018-04-10 15:07:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:07:44,169 INFO L225 Difference]: With dead ends: 1754 [2018-04-10 15:07:44,169 INFO L226 Difference]: Without dead ends: 1754 [2018-04-10 15:07:44,169 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 15:07:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2018-04-10 15:07:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1385. [2018-04-10 15:07:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-04-10 15:07:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1729 transitions. [2018-04-10 15:07:44,177 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1729 transitions. Word has length 922 [2018-04-10 15:07:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:07:44,178 INFO L459 AbstractCegarLoop]: Abstraction has 1385 states and 1729 transitions. [2018-04-10 15:07:44,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-10 15:07:44,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1729 transitions. [2018-04-10 15:07:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 936 [2018-04-10 15:07:44,182 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:07:44,183 INFO L355 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 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-10 15:07:44,183 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:07:44,183 INFO L82 PathProgramCache]: Analyzing trace with hash -408058588, now seen corresponding path program 68 times [2018-04-10 15:07:44,183 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:07:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:07:44,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:07:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 31675 backedges. 0 proven. 17045 refuted. 0 times theorem prover too weak. 14630 trivial. 0 not checked. [2018-04-10 15:07:47,633 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:07:47,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-04-10 15:07:47,633 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:07:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 13467 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13467 trivial. 0 not checked. [2018-04-10 15:07:47,634 INFO L182 omatonBuilderFactory]: Interpolants [119961#true, 119963#(= main_~i~1 0), 119962#false, 119965#(<= main_~i~1 2), 119964#(<= main_~i~1 1), 119967#(<= main_~i~1 4), 119966#(<= main_~i~1 3), 119969#(<= main_~i~1 6), 119968#(<= main_~i~1 5), 119971#(<= main_~i~1 8), 119970#(<= main_~i~1 7), 119973#(<= main_~i~1 10), 119972#(<= main_~i~1 9), 119975#(<= main_~i~1 12), 119974#(<= main_~i~1 11), 119977#(<= main_~i~1 14), 119976#(<= main_~i~1 13), 119979#(<= main_~i~1 16), 119978#(<= main_~i~1 15), 119981#(<= main_~i~1 18), 119980#(<= main_~i~1 17), 119983#(<= main_~i~1 20), 119982#(<= main_~i~1 19), 119985#(<= main_~i~1 22), 119984#(<= main_~i~1 21), 119987#(<= main_~i~1 24), 119986#(<= main_~i~1 23), 119989#(<= main_~i~1 26), 119988#(<= main_~i~1 25), 119991#(<= main_~i~1 28), 119990#(<= main_~i~1 27), 119993#(<= main_~i~1 30), 119992#(<= main_~i~1 29), 119995#(<= main_~i~1 32), 119994#(<= main_~i~1 31), 119997#(<= main_~i~1 34), 119996#(<= main_~i~1 33), 119999#(<= main_~i~1 36), 119998#(<= main_~i~1 35), 120001#(<= main_~i~1 38), 120000#(<= main_~i~1 37), 120003#(<= main_~i~1 40), 120002#(<= main_~i~1 39), 120005#(<= main_~i~1 42), 120004#(<= main_~i~1 41), 120007#(<= main_~i~1 44), 120006#(<= main_~i~1 43), 120009#(<= main_~i~1 46), 120008#(<= main_~i~1 45), 120011#(<= main_~i~1 48), 120010#(<= main_~i~1 47), 120013#(<= main_~i~1 50), 120012#(<= main_~i~1 49), 120015#(<= main_~i~1 52), 120014#(<= main_~i~1 51), 120017#(<= main_~i~1 54), 120016#(<= main_~i~1 53), 120019#(<= main_~i~1 56), 120018#(<= main_~i~1 55), 120021#(<= main_~i~1 58), 120020#(<= main_~i~1 57), 120023#(<= main_~i~1 60), 120022#(<= main_~i~1 59), 120025#(<= main_~i~1 62), 120024#(<= main_~i~1 61), 120027#(<= main_~i~1 64), 120026#(<= main_~i~1 63), 120029#(<= main_~i~1 66), 120028#(<= main_~i~1 65), 120031#(<= main_~i~1 68), 120030#(<= main_~i~1 67), 120033#(<= main_~i~1 70), 120032#(<= main_~i~1 69)] [2018-04-10 15:07:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 31675 backedges. 0 proven. 17045 refuted. 0 times theorem prover too weak. 14630 trivial. 0 not checked. [2018-04-10 15:07:47,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-10 15:07:47,636 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-10 15:07:47,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-04-10 15:07:47,636 INFO L87 Difference]: Start difference. First operand 1385 states and 1729 transitions. Second operand 73 states. [2018-04-10 15:07:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:07:49,287 INFO L93 Difference]: Finished difference Result 1778 states and 2061 transitions. [2018-04-10 15:07:49,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-10 15:07:49,287 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 935 [2018-04-10 15:07:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:07:49,289 INFO L225 Difference]: With dead ends: 1778 [2018-04-10 15:07:49,289 INFO L226 Difference]: Without dead ends: 1778 [2018-04-10 15:07:49,290 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-04-10 15:07:49,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2018-04-10 15:07:49,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1404. [2018-04-10 15:07:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2018-04-10 15:07:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1753 transitions. [2018-04-10 15:07:49,299 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1753 transitions. Word has length 935 [2018-04-10 15:07:49,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:07:49,299 INFO L459 AbstractCegarLoop]: Abstraction has 1404 states and 1753 transitions. [2018-04-10 15:07:49,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-10 15:07:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1753 transitions. [2018-04-10 15:07:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 949 [2018-04-10 15:07:49,304 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:07:49,305 INFO L355 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 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-10 15:07:49,305 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:07:49,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1482250434, now seen corresponding path program 69 times [2018-04-10 15:07:49,305 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:07:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:07:49,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:07:52,885 INFO L134 CoverageAnalysis]: Checked inductivity of 32589 backedges. 0 proven. 17537 refuted. 0 times theorem prover too weak. 15052 trivial. 0 not checked. [2018-04-10 15:07:52,886 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:07:52,886 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-04-10 15:07:52,886 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:07:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13872 trivial. 0 not checked. [2018-04-10 15:07:52,887 INFO L182 omatonBuilderFactory]: Interpolants [123265#(<= main_~i~1 47), 123264#(<= main_~i~1 46), 123267#(<= main_~i~1 49), 123266#(<= main_~i~1 48), 123269#(<= main_~i~1 51), 123268#(<= main_~i~1 50), 123271#(<= main_~i~1 53), 123270#(<= main_~i~1 52), 123273#(<= main_~i~1 55), 123272#(<= main_~i~1 54), 123275#(<= main_~i~1 57), 123274#(<= main_~i~1 56), 123277#(<= main_~i~1 59), 123276#(<= main_~i~1 58), 123279#(<= main_~i~1 61), 123278#(<= main_~i~1 60), 123281#(<= main_~i~1 63), 123280#(<= main_~i~1 62), 123283#(<= main_~i~1 65), 123282#(<= main_~i~1 64), 123285#(<= main_~i~1 67), 123284#(<= main_~i~1 66), 123287#(<= main_~i~1 69), 123286#(<= main_~i~1 68), 123289#(<= main_~i~1 71), 123288#(<= main_~i~1 70), 123217#false, 123216#true, 123219#(<= main_~i~1 1), 123218#(= main_~i~1 0), 123221#(<= main_~i~1 3), 123220#(<= main_~i~1 2), 123223#(<= main_~i~1 5), 123222#(<= main_~i~1 4), 123225#(<= main_~i~1 7), 123224#(<= main_~i~1 6), 123227#(<= main_~i~1 9), 123226#(<= main_~i~1 8), 123229#(<= main_~i~1 11), 123228#(<= main_~i~1 10), 123231#(<= main_~i~1 13), 123230#(<= main_~i~1 12), 123233#(<= main_~i~1 15), 123232#(<= main_~i~1 14), 123235#(<= main_~i~1 17), 123234#(<= main_~i~1 16), 123237#(<= main_~i~1 19), 123236#(<= main_~i~1 18), 123239#(<= main_~i~1 21), 123238#(<= main_~i~1 20), 123241#(<= main_~i~1 23), 123240#(<= main_~i~1 22), 123243#(<= main_~i~1 25), 123242#(<= main_~i~1 24), 123245#(<= main_~i~1 27), 123244#(<= main_~i~1 26), 123247#(<= main_~i~1 29), 123246#(<= main_~i~1 28), 123249#(<= main_~i~1 31), 123248#(<= main_~i~1 30), 123251#(<= main_~i~1 33), 123250#(<= main_~i~1 32), 123253#(<= main_~i~1 35), 123252#(<= main_~i~1 34), 123255#(<= main_~i~1 37), 123254#(<= main_~i~1 36), 123257#(<= main_~i~1 39), 123256#(<= main_~i~1 38), 123259#(<= main_~i~1 41), 123258#(<= main_~i~1 40), 123261#(<= main_~i~1 43), 123260#(<= main_~i~1 42), 123263#(<= main_~i~1 45), 123262#(<= main_~i~1 44)] [2018-04-10 15:07:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 32589 backedges. 0 proven. 17537 refuted. 0 times theorem prover too weak. 15052 trivial. 0 not checked. [2018-04-10 15:07:52,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-10 15:07:52,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-10 15:07:52,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 15:07:52,889 INFO L87 Difference]: Start difference. First operand 1404 states and 1753 transitions. Second operand 74 states. [2018-04-10 15:07:54,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:07:54,138 INFO L93 Difference]: Finished difference Result 1802 states and 2089 transitions. [2018-04-10 15:07:54,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-10 15:07:54,139 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 948 [2018-04-10 15:07:54,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:07:54,141 INFO L225 Difference]: With dead ends: 1802 [2018-04-10 15:07:54,141 INFO L226 Difference]: Without dead ends: 1802 [2018-04-10 15:07:54,141 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 15:07:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2018-04-10 15:07:54,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1423. [2018-04-10 15:07:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2018-04-10 15:07:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1777 transitions. [2018-04-10 15:07:54,155 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1777 transitions. Word has length 948 [2018-04-10 15:07:54,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:07:54,155 INFO L459 AbstractCegarLoop]: Abstraction has 1423 states and 1777 transitions. [2018-04-10 15:07:54,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-10 15:07:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1777 transitions. [2018-04-10 15:07:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2018-04-10 15:07:54,160 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:07:54,160 INFO L355 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 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-10 15:07:54,160 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:07:54,161 INFO L82 PathProgramCache]: Analyzing trace with hash -912572572, now seen corresponding path program 70 times [2018-04-10 15:07:54,161 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:07:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:07:54,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:07:57,810 INFO L134 CoverageAnalysis]: Checked inductivity of 33516 backedges. 0 proven. 18036 refuted. 0 times theorem prover too weak. 15480 trivial. 0 not checked. [2018-04-10 15:07:57,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:07:57,811 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-10 15:07:57,811 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:07:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 14283 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14283 trivial. 0 not checked. [2018-04-10 15:07:57,811 INFO L182 omatonBuilderFactory]: Interpolants [126515#true, 126517#(= main_~i~1 0), 126516#false, 126519#(<= main_~i~1 2), 126518#(<= main_~i~1 1), 126521#(<= main_~i~1 4), 126520#(<= main_~i~1 3), 126523#(<= main_~i~1 6), 126522#(<= main_~i~1 5), 126525#(<= main_~i~1 8), 126524#(<= main_~i~1 7), 126527#(<= main_~i~1 10), 126526#(<= main_~i~1 9), 126529#(<= main_~i~1 12), 126528#(<= main_~i~1 11), 126531#(<= main_~i~1 14), 126530#(<= main_~i~1 13), 126533#(<= main_~i~1 16), 126532#(<= main_~i~1 15), 126535#(<= main_~i~1 18), 126534#(<= main_~i~1 17), 126537#(<= main_~i~1 20), 126536#(<= main_~i~1 19), 126539#(<= main_~i~1 22), 126538#(<= main_~i~1 21), 126541#(<= main_~i~1 24), 126540#(<= main_~i~1 23), 126543#(<= main_~i~1 26), 126542#(<= main_~i~1 25), 126545#(<= main_~i~1 28), 126544#(<= main_~i~1 27), 126547#(<= main_~i~1 30), 126546#(<= main_~i~1 29), 126549#(<= main_~i~1 32), 126548#(<= main_~i~1 31), 126551#(<= main_~i~1 34), 126550#(<= main_~i~1 33), 126553#(<= main_~i~1 36), 126552#(<= main_~i~1 35), 126555#(<= main_~i~1 38), 126554#(<= main_~i~1 37), 126557#(<= main_~i~1 40), 126556#(<= main_~i~1 39), 126559#(<= main_~i~1 42), 126558#(<= main_~i~1 41), 126561#(<= main_~i~1 44), 126560#(<= main_~i~1 43), 126563#(<= main_~i~1 46), 126562#(<= main_~i~1 45), 126565#(<= main_~i~1 48), 126564#(<= main_~i~1 47), 126567#(<= main_~i~1 50), 126566#(<= main_~i~1 49), 126569#(<= main_~i~1 52), 126568#(<= main_~i~1 51), 126571#(<= main_~i~1 54), 126570#(<= main_~i~1 53), 126573#(<= main_~i~1 56), 126572#(<= main_~i~1 55), 126575#(<= main_~i~1 58), 126574#(<= main_~i~1 57), 126577#(<= main_~i~1 60), 126576#(<= main_~i~1 59), 126579#(<= main_~i~1 62), 126578#(<= main_~i~1 61), 126581#(<= main_~i~1 64), 126580#(<= main_~i~1 63), 126583#(<= main_~i~1 66), 126582#(<= main_~i~1 65), 126585#(<= main_~i~1 68), 126584#(<= main_~i~1 67), 126587#(<= main_~i~1 70), 126586#(<= main_~i~1 69), 126589#(<= main_~i~1 72), 126588#(<= main_~i~1 71)] [2018-04-10 15:07:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 33516 backedges. 0 proven. 18036 refuted. 0 times theorem prover too weak. 15480 trivial. 0 not checked. [2018-04-10 15:07:57,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-10 15:07:57,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-10 15:07:57,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 15:07:57,813 INFO L87 Difference]: Start difference. First operand 1423 states and 1777 transitions. Second operand 75 states. [2018-04-10 15:07:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:07:59,547 INFO L93 Difference]: Finished difference Result 1826 states and 2117 transitions. [2018-04-10 15:07:59,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-10 15:07:59,548 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 961 [2018-04-10 15:07:59,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:07:59,550 INFO L225 Difference]: With dead ends: 1826 [2018-04-10 15:07:59,550 INFO L226 Difference]: Without dead ends: 1826 [2018-04-10 15:07:59,550 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-04-10 15:07:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2018-04-10 15:07:59,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1442. [2018-04-10 15:07:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1442 states. [2018-04-10 15:07:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 1801 transitions. [2018-04-10 15:07:59,561 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 1801 transitions. Word has length 961 [2018-04-10 15:07:59,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:07:59,562 INFO L459 AbstractCegarLoop]: Abstraction has 1442 states and 1801 transitions. [2018-04-10 15:07:59,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-10 15:07:59,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1801 transitions. [2018-04-10 15:07:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 975 [2018-04-10 15:07:59,568 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:07:59,568 INFO L355 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 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-10 15:07:59,568 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:07:59,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1429629698, now seen corresponding path program 71 times [2018-04-10 15:07:59,569 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:07:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:07:59,628 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:08:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 34456 backedges. 0 proven. 18542 refuted. 0 times theorem prover too weak. 15914 trivial. 0 not checked. [2018-04-10 15:08:03,627 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:08:03,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-04-10 15:08:03,627 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:08:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 14700 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14700 trivial. 0 not checked. [2018-04-10 15:08:03,628 INFO L182 omatonBuilderFactory]: Interpolants [129921#(<= main_~i~1 61), 129920#(<= main_~i~1 60), 129923#(<= main_~i~1 63), 129922#(<= main_~i~1 62), 129925#(<= main_~i~1 65), 129924#(<= main_~i~1 64), 129927#(<= main_~i~1 67), 129926#(<= main_~i~1 66), 129929#(<= main_~i~1 69), 129928#(<= main_~i~1 68), 129931#(<= main_~i~1 71), 129930#(<= main_~i~1 70), 129933#(<= main_~i~1 73), 129932#(<= main_~i~1 72), 129859#false, 129858#true, 129861#(<= main_~i~1 1), 129860#(= main_~i~1 0), 129863#(<= main_~i~1 3), 129862#(<= main_~i~1 2), 129865#(<= main_~i~1 5), 129864#(<= main_~i~1 4), 129867#(<= main_~i~1 7), 129866#(<= main_~i~1 6), 129869#(<= main_~i~1 9), 129868#(<= main_~i~1 8), 129871#(<= main_~i~1 11), 129870#(<= main_~i~1 10), 129873#(<= main_~i~1 13), 129872#(<= main_~i~1 12), 129875#(<= main_~i~1 15), 129874#(<= main_~i~1 14), 129877#(<= main_~i~1 17), 129876#(<= main_~i~1 16), 129879#(<= main_~i~1 19), 129878#(<= main_~i~1 18), 129881#(<= main_~i~1 21), 129880#(<= main_~i~1 20), 129883#(<= main_~i~1 23), 129882#(<= main_~i~1 22), 129885#(<= main_~i~1 25), 129884#(<= main_~i~1 24), 129887#(<= main_~i~1 27), 129886#(<= main_~i~1 26), 129889#(<= main_~i~1 29), 129888#(<= main_~i~1 28), 129891#(<= main_~i~1 31), 129890#(<= main_~i~1 30), 129893#(<= main_~i~1 33), 129892#(<= main_~i~1 32), 129895#(<= main_~i~1 35), 129894#(<= main_~i~1 34), 129897#(<= main_~i~1 37), 129896#(<= main_~i~1 36), 129899#(<= main_~i~1 39), 129898#(<= main_~i~1 38), 129901#(<= main_~i~1 41), 129900#(<= main_~i~1 40), 129903#(<= main_~i~1 43), 129902#(<= main_~i~1 42), 129905#(<= main_~i~1 45), 129904#(<= main_~i~1 44), 129907#(<= main_~i~1 47), 129906#(<= main_~i~1 46), 129909#(<= main_~i~1 49), 129908#(<= main_~i~1 48), 129911#(<= main_~i~1 51), 129910#(<= main_~i~1 50), 129913#(<= main_~i~1 53), 129912#(<= main_~i~1 52), 129915#(<= main_~i~1 55), 129914#(<= main_~i~1 54), 129917#(<= main_~i~1 57), 129916#(<= main_~i~1 56), 129919#(<= main_~i~1 59), 129918#(<= main_~i~1 58)] [2018-04-10 15:08:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 34456 backedges. 0 proven. 18542 refuted. 0 times theorem prover too weak. 15914 trivial. 0 not checked. [2018-04-10 15:08:03,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-10 15:08:03,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-10 15:08:03,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-04-10 15:08:03,630 INFO L87 Difference]: Start difference. First operand 1442 states and 1801 transitions. Second operand 76 states. [2018-04-10 15:08:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:08:05,405 INFO L93 Difference]: Finished difference Result 1850 states and 2145 transitions. [2018-04-10 15:08:05,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-10 15:08:05,405 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 974 [2018-04-10 15:08:05,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:08:05,408 INFO L225 Difference]: With dead ends: 1850 [2018-04-10 15:08:05,409 INFO L226 Difference]: Without dead ends: 1850 [2018-04-10 15:08:05,409 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-04-10 15:08:05,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2018-04-10 15:08:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1461. [2018-04-10 15:08:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2018-04-10 15:08:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1825 transitions. [2018-04-10 15:08:05,425 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1825 transitions. Word has length 974 [2018-04-10 15:08:05,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:08:05,426 INFO L459 AbstractCegarLoop]: Abstraction has 1461 states and 1825 transitions. [2018-04-10 15:08:05,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-10 15:08:05,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1825 transitions. [2018-04-10 15:08:05,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2018-04-10 15:08:05,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:08:05,435 INFO L355 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 74, 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-10 15:08:05,435 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:08:05,435 INFO L82 PathProgramCache]: Analyzing trace with hash 666413476, now seen corresponding path program 72 times [2018-04-10 15:08:05,436 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:08:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:08:05,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:08:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 35409 backedges. 0 proven. 19055 refuted. 0 times theorem prover too weak. 16354 trivial. 0 not checked. [2018-04-10 15:08:09,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:08:09,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-04-10 15:08:09,629 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:08:09,630 INFO L134 CoverageAnalysis]: Checked inductivity of 15123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15123 trivial. 0 not checked. [2018-04-10 15:08:09,630 INFO L182 omatonBuilderFactory]: Interpolants [133250#(<= main_~i~1 3), 133251#(<= main_~i~1 4), 133248#(<= main_~i~1 1), 133249#(<= main_~i~1 2), 133254#(<= main_~i~1 7), 133255#(<= main_~i~1 8), 133252#(<= main_~i~1 5), 133253#(<= main_~i~1 6), 133258#(<= main_~i~1 11), 133259#(<= main_~i~1 12), 133256#(<= main_~i~1 9), 133257#(<= main_~i~1 10), 133262#(<= main_~i~1 15), 133263#(<= main_~i~1 16), 133260#(<= main_~i~1 13), 133261#(<= main_~i~1 14), 133266#(<= main_~i~1 19), 133267#(<= main_~i~1 20), 133264#(<= main_~i~1 17), 133265#(<= main_~i~1 18), 133270#(<= main_~i~1 23), 133271#(<= main_~i~1 24), 133268#(<= main_~i~1 21), 133269#(<= main_~i~1 22), 133274#(<= main_~i~1 27), 133275#(<= main_~i~1 28), 133272#(<= main_~i~1 25), 133273#(<= main_~i~1 26), 133278#(<= main_~i~1 31), 133279#(<= main_~i~1 32), 133276#(<= main_~i~1 29), 133277#(<= main_~i~1 30), 133282#(<= main_~i~1 35), 133283#(<= main_~i~1 36), 133280#(<= main_~i~1 33), 133281#(<= main_~i~1 34), 133286#(<= main_~i~1 39), 133287#(<= main_~i~1 40), 133284#(<= main_~i~1 37), 133285#(<= main_~i~1 38), 133290#(<= main_~i~1 43), 133291#(<= main_~i~1 44), 133288#(<= main_~i~1 41), 133289#(<= main_~i~1 42), 133294#(<= main_~i~1 47), 133295#(<= main_~i~1 48), 133292#(<= main_~i~1 45), 133293#(<= main_~i~1 46), 133298#(<= main_~i~1 51), 133299#(<= main_~i~1 52), 133296#(<= main_~i~1 49), 133297#(<= main_~i~1 50), 133302#(<= main_~i~1 55), 133303#(<= main_~i~1 56), 133300#(<= main_~i~1 53), 133301#(<= main_~i~1 54), 133306#(<= main_~i~1 59), 133307#(<= main_~i~1 60), 133304#(<= main_~i~1 57), 133305#(<= main_~i~1 58), 133310#(<= main_~i~1 63), 133311#(<= main_~i~1 64), 133308#(<= main_~i~1 61), 133309#(<= main_~i~1 62), 133314#(<= main_~i~1 67), 133315#(<= main_~i~1 68), 133312#(<= main_~i~1 65), 133313#(<= main_~i~1 66), 133318#(<= main_~i~1 71), 133319#(<= main_~i~1 72), 133316#(<= main_~i~1 69), 133317#(<= main_~i~1 70), 133320#(<= main_~i~1 73), 133321#(<= main_~i~1 74), 133246#false, 133247#(= main_~i~1 0), 133245#true] [2018-04-10 15:08:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 35409 backedges. 0 proven. 19055 refuted. 0 times theorem prover too weak. 16354 trivial. 0 not checked. [2018-04-10 15:08:09,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-04-10 15:08:09,631 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-04-10 15:08:09,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-04-10 15:08:09,632 INFO L87 Difference]: Start difference. First operand 1461 states and 1825 transitions. Second operand 77 states. [2018-04-10 15:08:11,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:08:11,650 INFO L93 Difference]: Finished difference Result 1874 states and 2173 transitions. [2018-04-10 15:08:11,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-10 15:08:11,650 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 987 [2018-04-10 15:08:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:08:11,652 INFO L225 Difference]: With dead ends: 1874 [2018-04-10 15:08:11,652 INFO L226 Difference]: Without dead ends: 1874 [2018-04-10 15:08:11,653 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-04-10 15:08:11,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2018-04-10 15:08:11,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1480. [2018-04-10 15:08:11,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2018-04-10 15:08:11,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1849 transitions. [2018-04-10 15:08:11,664 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1849 transitions. Word has length 987 [2018-04-10 15:08:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:08:11,665 INFO L459 AbstractCegarLoop]: Abstraction has 1480 states and 1849 transitions. [2018-04-10 15:08:11,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-04-10 15:08:11,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1849 transitions. [2018-04-10 15:08:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1001 [2018-04-10 15:08:11,672 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:08:11,672 INFO L355 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 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-10 15:08:11,672 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:08:11,672 INFO L82 PathProgramCache]: Analyzing trace with hash 817550014, now seen corresponding path program 73 times [2018-04-10 15:08:11,673 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:08:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:08:11,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:08:15,839 INFO L134 CoverageAnalysis]: Checked inductivity of 36375 backedges. 0 proven. 19575 refuted. 0 times theorem prover too weak. 16800 trivial. 0 not checked. [2018-04-10 15:08:15,839 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:08:15,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-04-10 15:08:15,839 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:08:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15552 trivial. 0 not checked. [2018-04-10 15:08:15,840 INFO L182 omatonBuilderFactory]: Interpolants [136706#(<= main_~i~1 28), 136707#(<= main_~i~1 29), 136704#(<= main_~i~1 26), 136705#(<= main_~i~1 27), 136710#(<= main_~i~1 32), 136711#(<= main_~i~1 33), 136708#(<= main_~i~1 30), 136709#(<= main_~i~1 31), 136714#(<= main_~i~1 36), 136715#(<= main_~i~1 37), 136712#(<= main_~i~1 34), 136713#(<= main_~i~1 35), 136718#(<= main_~i~1 40), 136719#(<= main_~i~1 41), 136716#(<= main_~i~1 38), 136717#(<= main_~i~1 39), 136722#(<= main_~i~1 44), 136723#(<= main_~i~1 45), 136720#(<= main_~i~1 42), 136721#(<= main_~i~1 43), 136726#(<= main_~i~1 48), 136727#(<= main_~i~1 49), 136724#(<= main_~i~1 46), 136725#(<= main_~i~1 47), 136730#(<= main_~i~1 52), 136731#(<= main_~i~1 53), 136728#(<= main_~i~1 50), 136729#(<= main_~i~1 51), 136734#(<= main_~i~1 56), 136735#(<= main_~i~1 57), 136732#(<= main_~i~1 54), 136733#(<= main_~i~1 55), 136738#(<= main_~i~1 60), 136739#(<= main_~i~1 61), 136736#(<= main_~i~1 58), 136737#(<= main_~i~1 59), 136742#(<= main_~i~1 64), 136743#(<= main_~i~1 65), 136740#(<= main_~i~1 62), 136741#(<= main_~i~1 63), 136746#(<= main_~i~1 68), 136747#(<= main_~i~1 69), 136744#(<= main_~i~1 66), 136745#(<= main_~i~1 67), 136750#(<= main_~i~1 72), 136751#(<= main_~i~1 73), 136748#(<= main_~i~1 70), 136749#(<= main_~i~1 71), 136752#(<= main_~i~1 74), 136753#(<= main_~i~1 75), 136678#(= main_~i~1 0), 136679#(<= main_~i~1 1), 136676#true, 136677#false, 136682#(<= main_~i~1 4), 136683#(<= main_~i~1 5), 136680#(<= main_~i~1 2), 136681#(<= main_~i~1 3), 136686#(<= main_~i~1 8), 136687#(<= main_~i~1 9), 136684#(<= main_~i~1 6), 136685#(<= main_~i~1 7), 136690#(<= main_~i~1 12), 136691#(<= main_~i~1 13), 136688#(<= main_~i~1 10), 136689#(<= main_~i~1 11), 136694#(<= main_~i~1 16), 136695#(<= main_~i~1 17), 136692#(<= main_~i~1 14), 136693#(<= main_~i~1 15), 136698#(<= main_~i~1 20), 136699#(<= main_~i~1 21), 136696#(<= main_~i~1 18), 136697#(<= main_~i~1 19), 136702#(<= main_~i~1 24), 136703#(<= main_~i~1 25), 136700#(<= main_~i~1 22), 136701#(<= main_~i~1 23)] [2018-04-10 15:08:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 36375 backedges. 0 proven. 19575 refuted. 0 times theorem prover too weak. 16800 trivial. 0 not checked. [2018-04-10 15:08:15,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-10 15:08:15,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-10 15:08:15,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 15:08:15,842 INFO L87 Difference]: Start difference. First operand 1480 states and 1849 transitions. Second operand 78 states. [2018-04-10 15:08:17,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:08:17,223 INFO L93 Difference]: Finished difference Result 1898 states and 2201 transitions. [2018-04-10 15:08:17,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-10 15:08:17,223 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 1000 [2018-04-10 15:08:17,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:08:17,225 INFO L225 Difference]: With dead ends: 1898 [2018-04-10 15:08:17,225 INFO L226 Difference]: Without dead ends: 1898 [2018-04-10 15:08:17,225 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 15:08:17,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-04-10 15:08:17,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1499. [2018-04-10 15:08:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1499 states. [2018-04-10 15:08:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 1873 transitions. [2018-04-10 15:08:17,236 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 1873 transitions. Word has length 1000 [2018-04-10 15:08:17,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:08:17,236 INFO L459 AbstractCegarLoop]: Abstraction has 1499 states and 1873 transitions. [2018-04-10 15:08:17,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-10 15:08:17,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 1873 transitions. [2018-04-10 15:08:17,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1014 [2018-04-10 15:08:17,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:08:17,241 INFO L355 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 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-10 15:08:17,241 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:08:17,242 INFO L82 PathProgramCache]: Analyzing trace with hash -792083484, now seen corresponding path program 74 times [2018-04-10 15:08:17,242 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:08:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:08:17,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:08:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 37354 backedges. 0 proven. 20102 refuted. 0 times theorem prover too weak. 17252 trivial. 0 not checked. [2018-04-10 15:08:21,515 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:08:21,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-04-10 15:08:21,516 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:08:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15987 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15987 trivial. 0 not checked. [2018-04-10 15:08:21,516 INFO L182 omatonBuilderFactory]: Interpolants [140162#(<= main_~i~1 9), 140163#(<= main_~i~1 10), 140160#(<= main_~i~1 7), 140161#(<= main_~i~1 8), 140166#(<= main_~i~1 13), 140167#(<= main_~i~1 14), 140164#(<= main_~i~1 11), 140165#(<= main_~i~1 12), 140170#(<= main_~i~1 17), 140171#(<= main_~i~1 18), 140168#(<= main_~i~1 15), 140169#(<= main_~i~1 16), 140174#(<= main_~i~1 21), 140175#(<= main_~i~1 22), 140172#(<= main_~i~1 19), 140173#(<= main_~i~1 20), 140178#(<= main_~i~1 25), 140179#(<= main_~i~1 26), 140176#(<= main_~i~1 23), 140177#(<= main_~i~1 24), 140182#(<= main_~i~1 29), 140183#(<= main_~i~1 30), 140180#(<= main_~i~1 27), 140181#(<= main_~i~1 28), 140186#(<= main_~i~1 33), 140187#(<= main_~i~1 34), 140184#(<= main_~i~1 31), 140185#(<= main_~i~1 32), 140190#(<= main_~i~1 37), 140191#(<= main_~i~1 38), 140188#(<= main_~i~1 35), 140189#(<= main_~i~1 36), 140194#(<= main_~i~1 41), 140195#(<= main_~i~1 42), 140192#(<= main_~i~1 39), 140193#(<= main_~i~1 40), 140198#(<= main_~i~1 45), 140199#(<= main_~i~1 46), 140196#(<= main_~i~1 43), 140197#(<= main_~i~1 44), 140202#(<= main_~i~1 49), 140203#(<= main_~i~1 50), 140200#(<= main_~i~1 47), 140201#(<= main_~i~1 48), 140206#(<= main_~i~1 53), 140207#(<= main_~i~1 54), 140204#(<= main_~i~1 51), 140205#(<= main_~i~1 52), 140210#(<= main_~i~1 57), 140211#(<= main_~i~1 58), 140208#(<= main_~i~1 55), 140209#(<= main_~i~1 56), 140214#(<= main_~i~1 61), 140215#(<= main_~i~1 62), 140212#(<= main_~i~1 59), 140213#(<= main_~i~1 60), 140218#(<= main_~i~1 65), 140219#(<= main_~i~1 66), 140216#(<= main_~i~1 63), 140217#(<= main_~i~1 64), 140222#(<= main_~i~1 69), 140223#(<= main_~i~1 70), 140220#(<= main_~i~1 67), 140221#(<= main_~i~1 68), 140226#(<= main_~i~1 73), 140227#(<= main_~i~1 74), 140224#(<= main_~i~1 71), 140225#(<= main_~i~1 72), 140228#(<= main_~i~1 75), 140229#(<= main_~i~1 76), 140151#true, 140154#(<= main_~i~1 1), 140155#(<= main_~i~1 2), 140152#false, 140153#(= main_~i~1 0), 140158#(<= main_~i~1 5), 140159#(<= main_~i~1 6), 140156#(<= main_~i~1 3), 140157#(<= main_~i~1 4)] [2018-04-10 15:08:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 37354 backedges. 0 proven. 20102 refuted. 0 times theorem prover too weak. 17252 trivial. 0 not checked. [2018-04-10 15:08:21,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-10 15:08:21,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-10 15:08:21,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-04-10 15:08:21,519 INFO L87 Difference]: Start difference. First operand 1499 states and 1873 transitions. Second operand 79 states. [2018-04-10 15:08:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:08:23,433 INFO L93 Difference]: Finished difference Result 1922 states and 2229 transitions. [2018-04-10 15:08:23,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-10 15:08:23,433 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 1013 [2018-04-10 15:08:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:08:23,436 INFO L225 Difference]: With dead ends: 1922 [2018-04-10 15:08:23,436 INFO L226 Difference]: Without dead ends: 1922 [2018-04-10 15:08:23,437 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-04-10 15:08:23,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2018-04-10 15:08:23,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1518. [2018-04-10 15:08:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1518 states. [2018-04-10 15:08:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 1897 transitions. [2018-04-10 15:08:23,449 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 1897 transitions. Word has length 1013 [2018-04-10 15:08:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:08:23,450 INFO L459 AbstractCegarLoop]: Abstraction has 1518 states and 1897 transitions. [2018-04-10 15:08:23,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-10 15:08:23,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 1897 transitions. [2018-04-10 15:08:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1027 [2018-04-10 15:08:23,456 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:08:23,456 INFO L355 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 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-10 15:08:23,456 INFO L408 AbstractCegarLoop]: === Iteration 88 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:08:23,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1992925058, now seen corresponding path program 75 times [2018-04-10 15:08:23,457 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:08:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:08:23,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:08:27,980 INFO L134 CoverageAnalysis]: Checked inductivity of 38346 backedges. 0 proven. 20636 refuted. 0 times theorem prover too weak. 17710 trivial. 0 not checked. [2018-04-10 15:08:27,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:08:27,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-04-10 15:08:27,980 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:08:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 16428 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16428 trivial. 0 not checked. [2018-04-10 15:08:27,981 INFO L182 omatonBuilderFactory]: Interpolants [143746#(<= main_~i~1 74), 143747#(<= main_~i~1 75), 143744#(<= main_~i~1 72), 143745#(<= main_~i~1 73), 143748#(<= main_~i~1 76), 143749#(<= main_~i~1 77), 143670#true, 143671#false, 143674#(<= main_~i~1 2), 143675#(<= main_~i~1 3), 143672#(= main_~i~1 0), 143673#(<= main_~i~1 1), 143678#(<= main_~i~1 6), 143679#(<= main_~i~1 7), 143676#(<= main_~i~1 4), 143677#(<= main_~i~1 5), 143682#(<= main_~i~1 10), 143683#(<= main_~i~1 11), 143680#(<= main_~i~1 8), 143681#(<= main_~i~1 9), 143686#(<= main_~i~1 14), 143687#(<= main_~i~1 15), 143684#(<= main_~i~1 12), 143685#(<= main_~i~1 13), 143690#(<= main_~i~1 18), 143691#(<= main_~i~1 19), 143688#(<= main_~i~1 16), 143689#(<= main_~i~1 17), 143694#(<= main_~i~1 22), 143695#(<= main_~i~1 23), 143692#(<= main_~i~1 20), 143693#(<= main_~i~1 21), 143698#(<= main_~i~1 26), 143699#(<= main_~i~1 27), 143696#(<= main_~i~1 24), 143697#(<= main_~i~1 25), 143702#(<= main_~i~1 30), 143703#(<= main_~i~1 31), 143700#(<= main_~i~1 28), 143701#(<= main_~i~1 29), 143706#(<= main_~i~1 34), 143707#(<= main_~i~1 35), 143704#(<= main_~i~1 32), 143705#(<= main_~i~1 33), 143710#(<= main_~i~1 38), 143711#(<= main_~i~1 39), 143708#(<= main_~i~1 36), 143709#(<= main_~i~1 37), 143714#(<= main_~i~1 42), 143715#(<= main_~i~1 43), 143712#(<= main_~i~1 40), 143713#(<= main_~i~1 41), 143718#(<= main_~i~1 46), 143719#(<= main_~i~1 47), 143716#(<= main_~i~1 44), 143717#(<= main_~i~1 45), 143722#(<= main_~i~1 50), 143723#(<= main_~i~1 51), 143720#(<= main_~i~1 48), 143721#(<= main_~i~1 49), 143726#(<= main_~i~1 54), 143727#(<= main_~i~1 55), 143724#(<= main_~i~1 52), 143725#(<= main_~i~1 53), 143730#(<= main_~i~1 58), 143731#(<= main_~i~1 59), 143728#(<= main_~i~1 56), 143729#(<= main_~i~1 57), 143734#(<= main_~i~1 62), 143735#(<= main_~i~1 63), 143732#(<= main_~i~1 60), 143733#(<= main_~i~1 61), 143738#(<= main_~i~1 66), 143739#(<= main_~i~1 67), 143736#(<= main_~i~1 64), 143737#(<= main_~i~1 65), 143742#(<= main_~i~1 70), 143743#(<= main_~i~1 71), 143740#(<= main_~i~1 68), 143741#(<= main_~i~1 69)] [2018-04-10 15:08:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 38346 backedges. 0 proven. 20636 refuted. 0 times theorem prover too weak. 17710 trivial. 0 not checked. [2018-04-10 15:08:27,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-10 15:08:27,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-10 15:08:27,983 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-04-10 15:08:27,983 INFO L87 Difference]: Start difference. First operand 1518 states and 1897 transitions. Second operand 80 states. [2018-04-10 15:08:29,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:08:29,967 INFO L93 Difference]: Finished difference Result 1946 states and 2257 transitions. [2018-04-10 15:08:29,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-10 15:08:29,968 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 1026 [2018-04-10 15:08:29,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:08:29,970 INFO L225 Difference]: With dead ends: 1946 [2018-04-10 15:08:29,970 INFO L226 Difference]: Without dead ends: 1946 [2018-04-10 15:08:29,970 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-04-10 15:08:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2018-04-10 15:08:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1537. [2018-04-10 15:08:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1537 states. [2018-04-10 15:08:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1537 states to 1537 states and 1921 transitions. [2018-04-10 15:08:29,982 INFO L78 Accepts]: Start accepts. Automaton has 1537 states and 1921 transitions. Word has length 1026 [2018-04-10 15:08:29,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:08:29,982 INFO L459 AbstractCegarLoop]: Abstraction has 1537 states and 1921 transitions. [2018-04-10 15:08:29,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-10 15:08:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1537 states and 1921 transitions. [2018-04-10 15:08:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2018-04-10 15:08:29,988 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:08:29,988 INFO L355 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 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-10 15:08:29,988 INFO L408 AbstractCegarLoop]: === Iteration 89 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:08:29,988 INFO L82 PathProgramCache]: Analyzing trace with hash -426602972, now seen corresponding path program 76 times [2018-04-10 15:08:29,989 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:08:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:08:30,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:08:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 39351 backedges. 0 proven. 21177 refuted. 0 times theorem prover too weak. 18174 trivial. 0 not checked. [2018-04-10 15:08:34,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:08:34,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-10 15:08:34,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:08:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 16875 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16875 trivial. 0 not checked. [2018-04-10 15:08:34,860 INFO L182 omatonBuilderFactory]: Interpolants [147234#false, 147235#(= main_~i~1 0), 147233#true, 147238#(<= main_~i~1 3), 147239#(<= main_~i~1 4), 147236#(<= main_~i~1 1), 147237#(<= main_~i~1 2), 147242#(<= main_~i~1 7), 147243#(<= main_~i~1 8), 147240#(<= main_~i~1 5), 147241#(<= main_~i~1 6), 147246#(<= main_~i~1 11), 147247#(<= main_~i~1 12), 147244#(<= main_~i~1 9), 147245#(<= main_~i~1 10), 147250#(<= main_~i~1 15), 147251#(<= main_~i~1 16), 147248#(<= main_~i~1 13), 147249#(<= main_~i~1 14), 147254#(<= main_~i~1 19), 147255#(<= main_~i~1 20), 147252#(<= main_~i~1 17), 147253#(<= main_~i~1 18), 147258#(<= main_~i~1 23), 147259#(<= main_~i~1 24), 147256#(<= main_~i~1 21), 147257#(<= main_~i~1 22), 147262#(<= main_~i~1 27), 147263#(<= main_~i~1 28), 147260#(<= main_~i~1 25), 147261#(<= main_~i~1 26), 147266#(<= main_~i~1 31), 147267#(<= main_~i~1 32), 147264#(<= main_~i~1 29), 147265#(<= main_~i~1 30), 147270#(<= main_~i~1 35), 147271#(<= main_~i~1 36), 147268#(<= main_~i~1 33), 147269#(<= main_~i~1 34), 147274#(<= main_~i~1 39), 147275#(<= main_~i~1 40), 147272#(<= main_~i~1 37), 147273#(<= main_~i~1 38), 147278#(<= main_~i~1 43), 147279#(<= main_~i~1 44), 147276#(<= main_~i~1 41), 147277#(<= main_~i~1 42), 147282#(<= main_~i~1 47), 147283#(<= main_~i~1 48), 147280#(<= main_~i~1 45), 147281#(<= main_~i~1 46), 147286#(<= main_~i~1 51), 147287#(<= main_~i~1 52), 147284#(<= main_~i~1 49), 147285#(<= main_~i~1 50), 147290#(<= main_~i~1 55), 147291#(<= main_~i~1 56), 147288#(<= main_~i~1 53), 147289#(<= main_~i~1 54), 147294#(<= main_~i~1 59), 147295#(<= main_~i~1 60), 147292#(<= main_~i~1 57), 147293#(<= main_~i~1 58), 147298#(<= main_~i~1 63), 147299#(<= main_~i~1 64), 147296#(<= main_~i~1 61), 147297#(<= main_~i~1 62), 147302#(<= main_~i~1 67), 147303#(<= main_~i~1 68), 147300#(<= main_~i~1 65), 147301#(<= main_~i~1 66), 147306#(<= main_~i~1 71), 147307#(<= main_~i~1 72), 147304#(<= main_~i~1 69), 147305#(<= main_~i~1 70), 147310#(<= main_~i~1 75), 147311#(<= main_~i~1 76), 147308#(<= main_~i~1 73), 147309#(<= main_~i~1 74), 147312#(<= main_~i~1 77), 147313#(<= main_~i~1 78)] [2018-04-10 15:08:34,861 INFO L134 CoverageAnalysis]: Checked inductivity of 39351 backedges. 0 proven. 21177 refuted. 0 times theorem prover too weak. 18174 trivial. 0 not checked. [2018-04-10 15:08:34,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-04-10 15:08:34,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-04-10 15:08:34,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 15:08:34,862 INFO L87 Difference]: Start difference. First operand 1537 states and 1921 transitions. Second operand 81 states. [2018-04-10 15:08:37,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:08:37,135 INFO L93 Difference]: Finished difference Result 1970 states and 2285 transitions. [2018-04-10 15:08:37,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-04-10 15:08:37,135 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 1039 [2018-04-10 15:08:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:08:37,137 INFO L225 Difference]: With dead ends: 1970 [2018-04-10 15:08:37,137 INFO L226 Difference]: Without dead ends: 1970 [2018-04-10 15:08:37,137 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 15:08:37,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2018-04-10 15:08:37,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1556. [2018-04-10 15:08:37,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2018-04-10 15:08:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1945 transitions. [2018-04-10 15:08:37,147 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1945 transitions. Word has length 1039 [2018-04-10 15:08:37,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:08:37,148 INFO L459 AbstractCegarLoop]: Abstraction has 1556 states and 1945 transitions. [2018-04-10 15:08:37,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-04-10 15:08:37,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1945 transitions. [2018-04-10 15:08:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1053 [2018-04-10 15:08:37,153 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:08:37,153 INFO L355 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 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-10 15:08:37,153 INFO L408 AbstractCegarLoop]: === Iteration 90 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:08:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1862779330, now seen corresponding path program 77 times [2018-04-10 15:08:37,154 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:08:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:08:37,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 15:08:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 40369 backedges. 0 proven. 21725 refuted. 0 times theorem prover too weak. 18644 trivial. 0 not checked. [2018-04-10 15:08:42,044 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 15:08:42,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-04-10 15:08:42,044 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-04-10 15:08:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 17328 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17328 trivial. 0 not checked. [2018-04-10 15:08:42,045 INFO L182 omatonBuilderFactory]: Interpolants [150914#(<= main_~i~1 72), 150915#(<= main_~i~1 73), 150912#(<= main_~i~1 70), 150913#(<= main_~i~1 71), 150918#(<= main_~i~1 76), 150919#(<= main_~i~1 77), 150916#(<= main_~i~1 74), 150917#(<= main_~i~1 75), 150920#(<= main_~i~1 78), 150921#(<= main_~i~1 79), 150842#(= main_~i~1 0), 150843#(<= main_~i~1 1), 150840#true, 150841#false, 150846#(<= main_~i~1 4), 150847#(<= main_~i~1 5), 150844#(<= main_~i~1 2), 150845#(<= main_~i~1 3), 150850#(<= main_~i~1 8), 150851#(<= main_~i~1 9), 150848#(<= main_~i~1 6), 150849#(<= main_~i~1 7), 150854#(<= main_~i~1 12), 150855#(<= main_~i~1 13), 150852#(<= main_~i~1 10), 150853#(<= main_~i~1 11), 150858#(<= main_~i~1 16), 150859#(<= main_~i~1 17), 150856#(<= main_~i~1 14), 150857#(<= main_~i~1 15), 150862#(<= main_~i~1 20), 150863#(<= main_~i~1 21), 150860#(<= main_~i~1 18), 150861#(<= main_~i~1 19), 150866#(<= main_~i~1 24), 150867#(<= main_~i~1 25), 150864#(<= main_~i~1 22), 150865#(<= main_~i~1 23), 150870#(<= main_~i~1 28), 150871#(<= main_~i~1 29), 150868#(<= main_~i~1 26), 150869#(<= main_~i~1 27), 150874#(<= main_~i~1 32), 150875#(<= main_~i~1 33), 150872#(<= main_~i~1 30), 150873#(<= main_~i~1 31), 150878#(<= main_~i~1 36), 150879#(<= main_~i~1 37), 150876#(<= main_~i~1 34), 150877#(<= main_~i~1 35), 150882#(<= main_~i~1 40), 150883#(<= main_~i~1 41), 150880#(<= main_~i~1 38), 150881#(<= main_~i~1 39), 150886#(<= main_~i~1 44), 150887#(<= main_~i~1 45), 150884#(<= main_~i~1 42), 150885#(<= main_~i~1 43), 150890#(<= main_~i~1 48), 150891#(<= main_~i~1 49), 150888#(<= main_~i~1 46), 150889#(<= main_~i~1 47), 150894#(<= main_~i~1 52), 150895#(<= main_~i~1 53), 150892#(<= main_~i~1 50), 150893#(<= main_~i~1 51), 150898#(<= main_~i~1 56), 150899#(<= main_~i~1 57), 150896#(<= main_~i~1 54), 150897#(<= main_~i~1 55), 150902#(<= main_~i~1 60), 150903#(<= main_~i~1 61), 150900#(<= main_~i~1 58), 150901#(<= main_~i~1 59), 150906#(<= main_~i~1 64), 150907#(<= main_~i~1 65), 150904#(<= main_~i~1 62), 150905#(<= main_~i~1 63), 150910#(<= main_~i~1 68), 150911#(<= main_~i~1 69), 150908#(<= main_~i~1 66), 150909#(<= main_~i~1 67)] [2018-04-10 15:08:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 40369 backedges. 0 proven. 21725 refuted. 0 times theorem prover too weak. 18644 trivial. 0 not checked. [2018-04-10 15:08:42,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-10 15:08:42,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-10 15:08:42,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-04-10 15:08:42,047 INFO L87 Difference]: Start difference. First operand 1556 states and 1945 transitions. Second operand 82 states. [2018-04-10 15:08:44,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 15:08:44,086 INFO L93 Difference]: Finished difference Result 1994 states and 2313 transitions. [2018-04-10 15:08:44,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-10 15:08:44,086 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 1052 [2018-04-10 15:08:44,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 15:08:44,089 INFO L225 Difference]: With dead ends: 1994 [2018-04-10 15:08:44,089 INFO L226 Difference]: Without dead ends: 1994 [2018-04-10 15:08:44,089 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-04-10 15:08:44,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2018-04-10 15:08:44,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1575. [2018-04-10 15:08:44,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1575 states. [2018-04-10 15:08:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1969 transitions. [2018-04-10 15:08:44,101 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1969 transitions. Word has length 1052 [2018-04-10 15:08:44,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 15:08:44,101 INFO L459 AbstractCegarLoop]: Abstraction has 1575 states and 1969 transitions. [2018-04-10 15:08:44,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-10 15:08:44,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1969 transitions. [2018-04-10 15:08:44,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2018-04-10 15:08:44,107 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 15:08:44,107 INFO L355 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 80, 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-10 15:08:44,107 INFO L408 AbstractCegarLoop]: === Iteration 91 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-04-10 15:08:44,107 INFO L82 PathProgramCache]: Analyzing trace with hash 500631652, now seen corresponding path program 78 times [2018-04-10 15:08:44,108 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-10 15:08:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 15:08:44,180 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-04-10 15:08:44,570 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:918) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:267) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:203) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedRefinementStrategy.getTraceCheck(FixedRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:408) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:417) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:363) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-04-10 15:08:44,573 INFO L168 Benchmark]: Toolchain (without parser) took 178134.99 ms. Allocated memory was 395.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 337.2 MB in the beginning and 1.1 GB in the end (delta: -742.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-04-10 15:08:44,574 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 395.3 MB. Free memory is still 358.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 15:08:44,574 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.68 ms. Allocated memory is still 395.3 MB. Free memory was 337.2 MB in the beginning and 327.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-04-10 15:08:44,574 INFO L168 Benchmark]: Boogie Preprocessor took 26.49 ms. Allocated memory is still 395.3 MB. Free memory was 327.9 MB in the beginning and 326.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-10 15:08:44,574 INFO L168 Benchmark]: RCFGBuilder took 237.40 ms. Allocated memory was 395.3 MB in the beginning and 596.6 MB in the end (delta: 201.3 MB). Free memory was 325.2 MB in the beginning and 558.7 MB in the end (delta: -233.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. [2018-04-10 15:08:44,574 INFO L168 Benchmark]: TraceAbstraction took 177717.80 ms. Allocated memory was 596.6 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 557.0 MB in the beginning and 1.1 GB in the end (delta: -522.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. [2018-04-10 15:08:44,576 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 395.3 MB. Free memory is still 358.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 150.68 ms. Allocated memory is still 395.3 MB. Free memory was 337.2 MB in the beginning and 327.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 26.49 ms. Allocated memory is still 395.3 MB. Free memory was 327.9 MB in the beginning and 326.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 237.40 ms. Allocated memory was 395.3 MB in the beginning and 596.6 MB in the end (delta: 201.3 MB). Free memory was 325.2 MB in the beginning and 558.7 MB in the end (delta: -233.5 MB). Peak memory consumption was 25.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 177717.80 ms. Allocated memory was 596.6 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 557.0 MB in the beginning and 1.1 GB in the end (delta: -522.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_15-08-44-581.csv Completed graceful shutdown