java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d4a2356 [2018-03-23 11:53:58,712 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-23 11:53:58,714 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-23 11:53:58,731 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-23 11:53:58,731 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-23 11:53:58,732 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-23 11:53:58,733 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-23 11:53:58,735 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-23 11:53:58,737 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-23 11:53:58,738 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-23 11:53:58,739 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-23 11:53:58,739 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-23 11:53:58,740 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-23 11:53:58,741 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-23 11:53:58,742 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-23 11:53:58,745 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-23 11:53:58,747 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-23 11:53:58,749 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-23 11:53:58,750 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-23 11:53:58,751 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-23 11:53:58,754 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-23 11:53:58,754 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-23 11:53:58,754 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-23 11:53:58,755 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-23 11:53:58,756 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-23 11:53:58,757 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-23 11:53:58,758 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-23 11:53:58,758 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-23 11:53:58,759 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-23 11:53:58,759 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-23 11:53:58,760 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-23 11:53:58,760 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-03-23 11:53:58,769 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-23 11:53:58,769 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-23 11:53:58,770 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-23 11:53:58,770 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-23 11:53:58,771 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-23 11:53:58,771 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-23 11:53:58,771 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-23 11:53:58,772 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-23 11:53:58,772 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-23 11:53:58,772 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-23 11:53:58,772 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-23 11:53:58,772 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-23 11:53:58,772 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-23 11:53:58,773 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-23 11:53:58,773 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-03-23 11:53:58,773 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-23 11:53:58,773 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-23 11:53:58,773 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-23 11:53:58,774 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-23 11:53:58,774 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-23 11:53:58,774 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-03-23 11:53:58,774 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-23 11:53:58,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-23 11:53:58,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 11:53:58,775 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-23 11:53:58,775 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-23 11:53:58,775 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-23 11:53:58,775 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-23 11:53:58,776 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-03-23 11:53:58,776 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-23 11:53:58,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-23 11:53:58,776 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-23 11:53:58,777 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-23 11:53:58,777 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-23 11:53:58,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-23 11:53:58,825 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-23 11:53:58,829 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-23 11:53:58,831 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-23 11:53:58,831 INFO L276 PluginConnector]: CDTParser initialized [2018-03-23 11:53:58,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-03-23 11:53:59,172 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6da944b82 [2018-03-23 11:53:59,288 INFO L291 CDTParser]: IsIndexed: true [2018-03-23 11:53:59,288 INFO L292 CDTParser]: Found 1 translation units. [2018-03-23 11:53:59,289 INFO L171 CDTParser]: Scanning ArraysOfVariableLength_true-valid-memsafety.c [2018-03-23 11:53:59,289 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-23 11:53:59,290 INFO L215 ultiparseSymbolTable]: [2018-03-23 11:53:59,290 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-23 11:53:59,290 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength_true-valid-memsafety.c [2018-03-23 11:53:59,290 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo ('foo') in ArraysOfVariableLength_true-valid-memsafety.c [2018-03-23 11:53:59,290 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-23 11:53:59,290 INFO L233 ultiparseSymbolTable]: [2018-03-23 11:53:59,305 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6da944b82 [2018-03-23 11:53:59,310 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-23 11:53:59,313 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-23 11:53:59,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-23 11:53:59,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-23 11:53:59,322 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-23 11:53:59,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 11:53:59" (1/1) ... [2018-03-23 11:53:59,326 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3acb22bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:59, skipping insertion in model container [2018-03-23 11:53:59,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 11:53:59" (1/1) ... [2018-03-23 11:53:59,342 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 11:53:59,355 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 11:53:59,500 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 11:53:59,530 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 11:53:59,534 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-03-23 11:53:59,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:59 WrapperNode [2018-03-23 11:53:59,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-23 11:53:59,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-23 11:53:59,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-23 11:53:59,542 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-23 11:53:59,553 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:59" (1/1) ... [2018-03-23 11:53:59,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:59" (1/1) ... [2018-03-23 11:53:59,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:59" (1/1) ... [2018-03-23 11:53:59,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:59" (1/1) ... [2018-03-23 11:53:59,566 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:59" (1/1) ... [2018-03-23 11:53:59,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:59" (1/1) ... [2018-03-23 11:53:59,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:59" (1/1) ... [2018-03-23 11:53:59,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-23 11:53:59,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-23 11:53:59,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-23 11:53:59,573 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-23 11:53:59,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:59" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 11:53:59,624 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-23 11:53:59,625 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-23 11:53:59,625 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo [2018-03-23 11:53:59,625 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-23 11:53:59,625 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo [2018-03-23 11:53:59,625 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-23 11:53:59,625 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-23 11:53:59,625 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-23 11:53:59,626 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-23 11:53:59,626 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-23 11:53:59,626 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-23 11:53:59,626 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-23 11:53:59,626 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-23 11:53:59,913 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-23 11:53:59,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 11:53:59 BoogieIcfgContainer [2018-03-23 11:53:59,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-23 11:53:59,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-23 11:53:59,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-23 11:53:59,918 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-23 11:53:59,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.03 11:53:59" (1/3) ... [2018-03-23 11:53:59,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78df6500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 11:53:59, skipping insertion in model container [2018-03-23 11:53:59,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:53:59" (2/3) ... [2018-03-23 11:53:59,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78df6500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 11:53:59, skipping insertion in model container [2018-03-23 11:53:59,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 11:53:59" (3/3) ... [2018-03-23 11:53:59,921 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-03-23 11:53:59,929 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-23 11:53:59,935 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-03-23 11:53:59,975 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-23 11:53:59,976 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-23 11:53:59,977 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-23 11:53:59,977 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-23 11:53:59,977 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-23 11:53:59,977 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-23 11:53:59,977 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-23 11:53:59,978 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-23 11:53:59,978 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-23 11:53:59,979 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-23 11:54:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-03-23 11:54:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-03-23 11:54:00,009 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:00,010 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:00,010 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-03-23 11:54:00,015 INFO L82 PathProgramCache]: Analyzing trace with hash -338374626, now seen corresponding path program 1 times [2018-03-23 11:54:00,017 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:00,018 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:00,057 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:00,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:00,058 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:00,103 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:00,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:54:00,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-03-23 11:54:00,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-03-23 11:54:00,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-03-23 11:54:00,148 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-03-23 11:54:00,150 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-03-23 11:54:00,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:00,181 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-03-23 11:54:00,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-03-23 11:54:00,182 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-03-23 11:54:00,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:00,192 INFO L225 Difference]: With dead ends: 119 [2018-03-23 11:54:00,192 INFO L226 Difference]: Without dead ends: 61 [2018-03-23 11:54:00,196 INFO L568 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-03-23 11:54:00,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-03-23 11:54:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-03-23 11:54:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-03-23 11:54:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-03-23 11:54:00,227 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 14 [2018-03-23 11:54:00,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:00,228 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-03-23 11:54:00,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-03-23 11:54:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-03-23 11:54:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-03-23 11:54:00,229 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:00,229 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:00,229 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-03-23 11:54:00,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1893692590, now seen corresponding path program 1 times [2018-03-23 11:54:00,229 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:00,229 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:00,231 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:00,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:00,231 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:00,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:00,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:54:00,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-03-23 11:54:00,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-23 11:54:00,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-23 11:54:00,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 11:54:00,292 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 3 states. [2018-03-23 11:54:00,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:00,366 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-03-23 11:54:00,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-23 11:54:00,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-03-23 11:54:00,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:00,370 INFO L225 Difference]: With dead ends: 106 [2018-03-23 11:54:00,370 INFO L226 Difference]: Without dead ends: 86 [2018-03-23 11:54:00,371 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 11:54:00,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-03-23 11:54:00,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 65. [2018-03-23 11:54:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-03-23 11:54:00,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-03-23 11:54:00,386 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 15 [2018-03-23 11:54:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:00,386 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-03-23 11:54:00,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-23 11:54:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-03-23 11:54:00,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-03-23 11:54:00,387 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:00,387 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:00,388 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-03-23 11:54:00,388 INFO L82 PathProgramCache]: Analyzing trace with hash 217610606, now seen corresponding path program 1 times [2018-03-23 11:54:00,388 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:00,388 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:00,389 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:00,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:00,389 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:00,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:00,505 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:54:00,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-03-23 11:54:00,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 11:54:00,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 11:54:00,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-03-23 11:54:00,507 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 6 states. [2018-03-23 11:54:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:00,639 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2018-03-23 11:54:00,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 11:54:00,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-03-23 11:54:00,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:00,641 INFO L225 Difference]: With dead ends: 151 [2018-03-23 11:54:00,641 INFO L226 Difference]: Without dead ends: 97 [2018-03-23 11:54:00,642 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-03-23 11:54:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-03-23 11:54:00,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 77. [2018-03-23 11:54:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-03-23 11:54:00,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-03-23 11:54:00,652 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 21 [2018-03-23 11:54:00,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:00,652 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-03-23 11:54:00,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 11:54:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-03-23 11:54:00,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-03-23 11:54:00,654 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:00,654 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:00,654 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-03-23 11:54:00,654 INFO L82 PathProgramCache]: Analyzing trace with hash 2108346150, now seen corresponding path program 1 times [2018-03-23 11:54:00,655 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:00,655 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:00,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:00,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:00,656 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:00,669 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:00,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:54:00,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-03-23 11:54:00,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-23 11:54:00,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-23 11:54:00,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 11:54:00,697 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 3 states. [2018-03-23 11:54:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:00,734 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2018-03-23 11:54:00,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-23 11:54:00,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-03-23 11:54:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:00,737 INFO L225 Difference]: With dead ends: 77 [2018-03-23 11:54:00,737 INFO L226 Difference]: Without dead ends: 75 [2018-03-23 11:54:00,737 INFO L568 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-03-23 11:54:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-03-23 11:54:00,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-03-23 11:54:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-03-23 11:54:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-03-23 11:54:00,744 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 25 [2018-03-23 11:54:00,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:00,744 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-03-23 11:54:00,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-23 11:54:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-03-23 11:54:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-03-23 11:54:00,745 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:00,745 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:00,745 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-03-23 11:54:00,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2108346151, now seen corresponding path program 1 times [2018-03-23 11:54:00,745 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:00,746 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:00,746 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:00,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:00,747 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:00,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:00,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:54:00,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-03-23 11:54:00,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-03-23 11:54:00,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-03-23 11:54:00,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-03-23 11:54:00,810 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 4 states. [2018-03-23 11:54:00,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:00,896 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-03-23 11:54:00,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-03-23 11:54:00,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-03-23 11:54:00,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:00,897 INFO L225 Difference]: With dead ends: 91 [2018-03-23 11:54:00,897 INFO L226 Difference]: Without dead ends: 89 [2018-03-23 11:54:00,898 INFO L568 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-03-23 11:54:00,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-03-23 11:54:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2018-03-23 11:54:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-03-23 11:54:00,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-03-23 11:54:00,908 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 25 [2018-03-23 11:54:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:00,908 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-03-23 11:54:00,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-03-23 11:54:00,909 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-03-23 11:54:00,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-03-23 11:54:00,910 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:00,910 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:00,911 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-03-23 11:54:00,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1601375567, now seen corresponding path program 1 times [2018-03-23 11:54:00,911 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:00,911 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:00,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:00,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:00,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:00,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-23 11:54:01,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:54:01,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-03-23 11:54:01,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-23 11:54:01,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-23 11:54:01,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-03-23 11:54:01,050 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 7 states. [2018-03-23 11:54:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:01,163 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2018-03-23 11:54:01,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-23 11:54:01,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-03-23 11:54:01,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:01,165 INFO L225 Difference]: With dead ends: 92 [2018-03-23 11:54:01,166 INFO L226 Difference]: Without dead ends: 91 [2018-03-23 11:54:01,166 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-03-23 11:54:01,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-03-23 11:54:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2018-03-23 11:54:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-03-23 11:54:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-03-23 11:54:01,178 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 41 [2018-03-23 11:54:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:01,178 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-03-23 11:54:01,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-23 11:54:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-03-23 11:54:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-03-23 11:54:01,180 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:01,180 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:01,180 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-03-23 11:54:01,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1896965090, now seen corresponding path program 1 times [2018-03-23 11:54:01,181 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:01,181 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:01,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:01,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:01,182 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:01,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:01,274 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:54:01,274 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-03-23 11:54:01,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 11:54:01,275 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 11:54:01,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:54:01,275 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 5 states. [2018-03-23 11:54:01,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:01,414 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-03-23 11:54:01,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-23 11:54:01,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-03-23 11:54:01,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:01,415 INFO L225 Difference]: With dead ends: 81 [2018-03-23 11:54:01,416 INFO L226 Difference]: Without dead ends: 80 [2018-03-23 11:54:01,416 INFO L568 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-03-23 11:54:01,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-03-23 11:54:01,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-03-23 11:54:01,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-03-23 11:54:01,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-03-23 11:54:01,425 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 42 [2018-03-23 11:54:01,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:01,426 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-03-23 11:54:01,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 11:54:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-03-23 11:54:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-03-23 11:54:01,427 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:01,428 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:01,429 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-03-23 11:54:01,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1896965091, now seen corresponding path program 1 times [2018-03-23 11:54:01,430 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:01,430 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:01,431 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:01,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:01,431 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:01,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:01,602 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:01,603 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:01,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:01,643 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:01,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:54:01,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:01,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:01,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:54:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-23 11:54:01,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:54:01,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2018-03-23 11:54:01,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-03-23 11:54:01,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-03-23 11:54:01,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-03-23 11:54:01,831 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 14 states. [2018-03-23 11:54:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:02,244 INFO L93 Difference]: Finished difference Result 163 states and 173 transitions. [2018-03-23 11:54:02,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-03-23 11:54:02,245 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2018-03-23 11:54:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:02,246 INFO L225 Difference]: With dead ends: 163 [2018-03-23 11:54:02,246 INFO L226 Difference]: Without dead ends: 140 [2018-03-23 11:54:02,247 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2018-03-23 11:54:02,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-03-23 11:54:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 87. [2018-03-23 11:54:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-03-23 11:54:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-03-23 11:54:02,264 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 42 [2018-03-23 11:54:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:02,265 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-03-23 11:54:02,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-03-23 11:54:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-03-23 11:54:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-03-23 11:54:02,266 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:02,267 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2018-03-23 11:54:02,267 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-03-23 11:54:02,267 INFO L82 PathProgramCache]: Analyzing trace with hash -737480982, now seen corresponding path program 1 times [2018-03-23 11:54:02,267 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:02,267 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:02,268 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:02,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:02,268 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:02,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-23 11:54:02,398 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:02,398 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:02,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:02,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-03-23 11:54:02,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:54:02,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 12 [2018-03-23 11:54:02,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-03-23 11:54:02,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-03-23 11:54:02,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-03-23 11:54:02,521 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 12 states. [2018-03-23 11:54:02,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:02,662 INFO L93 Difference]: Finished difference Result 162 states and 169 transitions. [2018-03-23 11:54:02,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-03-23 11:54:02,663 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-03-23 11:54:02,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:02,664 INFO L225 Difference]: With dead ends: 162 [2018-03-23 11:54:02,664 INFO L226 Difference]: Without dead ends: 103 [2018-03-23 11:54:02,665 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-03-23 11:54:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-03-23 11:54:02,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2018-03-23 11:54:02,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-03-23 11:54:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2018-03-23 11:54:02,672 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 45 [2018-03-23 11:54:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:02,673 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2018-03-23 11:54:02,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-03-23 11:54:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-03-23 11:54:02,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-03-23 11:54:02,674 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:02,674 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:02,675 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-03-23 11:54:02,675 INFO L82 PathProgramCache]: Analyzing trace with hash 335887572, now seen corresponding path program 1 times [2018-03-23 11:54:02,675 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:02,675 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:02,676 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:02,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:02,676 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:02,688 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:02,795 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:02,795 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:02,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:02,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:02,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:02,907 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-03-23 11:54:02,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-03-23 11:54:02,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-03-23 11:54:02,909 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-03-23 11:54:02,909 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand 15 states. [2018-03-23 11:54:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:03,113 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-03-23 11:54:03,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-03-23 11:54:03,113 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-03-23 11:54:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:03,114 INFO L225 Difference]: With dead ends: 180 [2018-03-23 11:54:03,115 INFO L226 Difference]: Without dead ends: 124 [2018-03-23 11:54:03,116 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-03-23 11:54:03,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-03-23 11:54:03,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 108. [2018-03-23 11:54:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-03-23 11:54:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2018-03-23 11:54:03,127 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 50 [2018-03-23 11:54:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:03,127 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2018-03-23 11:54:03,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-03-23 11:54:03,128 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2018-03-23 11:54:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-03-23 11:54:03,128 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:03,129 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1, 1] [2018-03-23 11:54:03,129 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-03-23 11:54:03,129 INFO L82 PathProgramCache]: Analyzing trace with hash -532975731, now seen corresponding path program 1 times [2018-03-23 11:54:03,129 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:03,129 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:03,130 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:03,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:03,130 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:03,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-03-23 11:54:03,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:03,269 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:03,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:03,304 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:03,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:54:03,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:03,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:03,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:54:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-03-23 11:54:03,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:03,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2018-03-23 11:54:03,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 11:54:03,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 11:54:03,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-03-23 11:54:03,443 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand 9 states. [2018-03-23 11:54:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:03,556 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2018-03-23 11:54:03,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-23 11:54:03,556 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-03-23 11:54:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:03,557 INFO L225 Difference]: With dead ends: 122 [2018-03-23 11:54:03,557 INFO L226 Difference]: Without dead ends: 121 [2018-03-23 11:54:03,557 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-03-23 11:54:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-03-23 11:54:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 110. [2018-03-23 11:54:03,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-03-23 11:54:03,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 113 transitions. [2018-03-23 11:54:03,564 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 113 transitions. Word has length 54 [2018-03-23 11:54:03,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:03,564 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 113 transitions. [2018-03-23 11:54:03,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 11:54:03,565 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 113 transitions. [2018-03-23 11:54:03,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-03-23 11:54:03,565 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:03,565 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:03,566 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-03-23 11:54:03,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1781640666, now seen corresponding path program 1 times [2018-03-23 11:54:03,566 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:03,566 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:03,566 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:03,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:03,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:03,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:03,655 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-03-23 11:54:03,655 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:03,655 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:03,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:03,689 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-03-23 11:54:03,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:03,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-03-23 11:54:03,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 11:54:03,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 11:54:03,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-03-23 11:54:03,769 INFO L87 Difference]: Start difference. First operand 110 states and 113 transitions. Second operand 9 states. [2018-03-23 11:54:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:03,949 INFO L93 Difference]: Finished difference Result 155 states and 161 transitions. [2018-03-23 11:54:03,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-23 11:54:03,950 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-03-23 11:54:03,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:03,951 INFO L225 Difference]: With dead ends: 155 [2018-03-23 11:54:03,951 INFO L226 Difference]: Without dead ends: 133 [2018-03-23 11:54:03,952 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-03-23 11:54:03,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-03-23 11:54:03,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 116. [2018-03-23 11:54:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-03-23 11:54:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 119 transitions. [2018-03-23 11:54:03,962 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 119 transitions. Word has length 70 [2018-03-23 11:54:03,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:03,962 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 119 transitions. [2018-03-23 11:54:03,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 11:54:03,962 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 119 transitions. [2018-03-23 11:54:03,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-03-23 11:54:03,963 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:03,964 INFO L353 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:03,964 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-03-23 11:54:03,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1140833070, now seen corresponding path program 2 times [2018-03-23 11:54:03,964 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:03,964 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:03,965 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:03,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:03,965 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:03,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-03-23 11:54:04,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:04,105 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:04,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:54:04,131 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:54:04,131 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:04,135 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-03-23 11:54:04,246 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:04,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-03-23 11:54:04,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-03-23 11:54:04,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-03-23 11:54:04,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-03-23 11:54:04,247 INFO L87 Difference]: Start difference. First operand 116 states and 119 transitions. Second operand 18 states. [2018-03-23 11:54:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:04,772 INFO L93 Difference]: Finished difference Result 138 states and 141 transitions. [2018-03-23 11:54:04,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-03-23 11:54:04,773 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 79 [2018-03-23 11:54:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:04,774 INFO L225 Difference]: With dead ends: 138 [2018-03-23 11:54:04,775 INFO L226 Difference]: Without dead ends: 137 [2018-03-23 11:54:04,777 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=1137, Unknown=0, NotChecked=0, Total=1406 [2018-03-23 11:54:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-03-23 11:54:04,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2018-03-23 11:54:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-03-23 11:54:04,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2018-03-23 11:54:04,789 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 79 [2018-03-23 11:54:04,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:04,789 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2018-03-23 11:54:04,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-03-23 11:54:04,789 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2018-03-23 11:54:04,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-03-23 11:54:04,790 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:04,790 INFO L353 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:04,790 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-03-23 11:54:04,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1006086918, now seen corresponding path program 1 times [2018-03-23 11:54:04,791 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:04,791 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:04,792 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:04,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:04,792 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:04,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:05,008 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-03-23 11:54:05,009 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:05,009 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:05,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:05,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:05,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:54:05,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:05,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:05,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:54:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 33 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-03-23 11:54:05,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:05,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-03-23 11:54:05,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 11:54:05,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 11:54:05,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-03-23 11:54:05,197 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand 9 states. [2018-03-23 11:54:05,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:05,385 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2018-03-23 11:54:05,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-23 11:54:05,385 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-03-23 11:54:05,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:05,386 INFO L225 Difference]: With dead ends: 132 [2018-03-23 11:54:05,387 INFO L226 Difference]: Without dead ends: 131 [2018-03-23 11:54:05,387 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-03-23 11:54:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-03-23 11:54:05,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2018-03-23 11:54:05,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-03-23 11:54:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2018-03-23 11:54:05,396 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 80 [2018-03-23 11:54:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:05,397 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2018-03-23 11:54:05,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 11:54:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2018-03-23 11:54:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-03-23 11:54:05,398 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:05,398 INFO L353 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:05,398 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-03-23 11:54:05,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2008756455, now seen corresponding path program 2 times [2018-03-23 11:54:05,398 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:05,399 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:05,399 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:05,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:05,399 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:05,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-03-23 11:54:05,539 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:05,539 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:05,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:54:05,565 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:54:05,565 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:05,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-03-23 11:54:05,644 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:05,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-03-23 11:54:05,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-03-23 11:54:05,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-03-23 11:54:05,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-03-23 11:54:05,646 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 17 states. [2018-03-23 11:54:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:05,921 INFO L93 Difference]: Finished difference Result 207 states and 214 transitions. [2018-03-23 11:54:05,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-03-23 11:54:05,921 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 83 [2018-03-23 11:54:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:05,922 INFO L225 Difference]: With dead ends: 207 [2018-03-23 11:54:05,922 INFO L226 Difference]: Without dead ends: 140 [2018-03-23 11:54:05,923 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-03-23 11:54:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-03-23 11:54:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 124. [2018-03-23 11:54:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-03-23 11:54:05,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 127 transitions. [2018-03-23 11:54:05,930 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 127 transitions. Word has length 83 [2018-03-23 11:54:05,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:05,930 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 127 transitions. [2018-03-23 11:54:05,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-03-23 11:54:05,930 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2018-03-23 11:54:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-03-23 11:54:05,931 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:05,931 INFO L353 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:05,931 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-03-23 11:54:05,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1223061085, now seen corresponding path program 2 times [2018-03-23 11:54:05,931 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:05,931 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:05,932 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:05,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:05,932 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:05,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 53 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-03-23 11:54:06,100 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:06,100 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:06,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:54:06,128 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:54:06,128 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:06,132 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 63 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-03-23 11:54:06,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:06,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-03-23 11:54:06,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-03-23 11:54:06,231 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-03-23 11:54:06,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-03-23 11:54:06,231 INFO L87 Difference]: Start difference. First operand 124 states and 127 transitions. Second operand 21 states. [2018-03-23 11:54:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:06,504 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2018-03-23 11:54:06,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-03-23 11:54:06,504 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2018-03-23 11:54:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:06,506 INFO L225 Difference]: With dead ends: 234 [2018-03-23 11:54:06,506 INFO L226 Difference]: Without dead ends: 170 [2018-03-23 11:54:06,507 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2018-03-23 11:54:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-03-23 11:54:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 154. [2018-03-23 11:54:06,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-03-23 11:54:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 157 transitions. [2018-03-23 11:54:06,517 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 157 transitions. Word has length 89 [2018-03-23 11:54:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:06,518 INFO L459 AbstractCegarLoop]: Abstraction has 154 states and 157 transitions. [2018-03-23 11:54:06,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-03-23 11:54:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 157 transitions. [2018-03-23 11:54:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-03-23 11:54:06,519 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:06,519 INFO L353 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:06,519 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-03-23 11:54:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1960385072, now seen corresponding path program 3 times [2018-03-23 11:54:06,520 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:06,520 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:06,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:06,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:06,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:06,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-03-23 11:54:06,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:06,658 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:06,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 11:54:06,679 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-03-23 11:54:06,679 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:06,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:06,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:54:06,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:06,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:54:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 52 proven. 11 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-03-23 11:54:06,961 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:06,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-03-23 11:54:06,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-23 11:54:06,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-23 11:54:06,962 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-03-23 11:54:06,962 INFO L87 Difference]: Start difference. First operand 154 states and 157 transitions. Second operand 19 states. [2018-03-23 11:54:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:07,465 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2018-03-23 11:54:07,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-03-23 11:54:07,465 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2018-03-23 11:54:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:07,466 INFO L225 Difference]: With dead ends: 167 [2018-03-23 11:54:07,467 INFO L226 Difference]: Without dead ends: 166 [2018-03-23 11:54:07,467 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=838, Unknown=0, NotChecked=0, Total=1056 [2018-03-23 11:54:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-03-23 11:54:07,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2018-03-23 11:54:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-03-23 11:54:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 156 transitions. [2018-03-23 11:54:07,480 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 156 transitions. Word has length 92 [2018-03-23 11:54:07,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:07,480 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 156 transitions. [2018-03-23 11:54:07,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-23 11:54:07,480 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 156 transitions. [2018-03-23 11:54:07,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-03-23 11:54:07,482 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:07,482 INFO L353 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-03-23 11:54:07,482 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-03-23 11:54:07,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2046842569, now seen corresponding path program 2 times [2018-03-23 11:54:07,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:07,482 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:07,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:07,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:07,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:07,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-03-23 11:54:07,591 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:07,591 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:07,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:54:07,617 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-03-23 11:54:07,617 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:07,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:07,637 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:07,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-03-23 11:54:07,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:07,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:07,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-03-23 11:54:07,687 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:07,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-03-23 11:54:07,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:07,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:07,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-03-23 11:54:07,750 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:07,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-03-23 11:54:07,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:07,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:07,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-03-23 11:54:07,806 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#b~0.base| Int)) (and (= (select |c_old(#valid)| |main_~#b~0.base|) 0) (= (store |c_old(#valid)| |main_~#b~0.base| 0) |c_#valid|))) is different from true [2018-03-23 11:54:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-03-23 11:54:07,849 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:54:07,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2018-03-23 11:54:07,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-03-23 11:54:07,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-03-23 11:54:07,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2018-03-23 11:54:07,850 INFO L87 Difference]: Start difference. First operand 153 states and 156 transitions. Second operand 13 states. [2018-03-23 11:54:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:08,115 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2018-03-23 11:54:08,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-03-23 11:54:08,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2018-03-23 11:54:08,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:08,116 INFO L225 Difference]: With dead ends: 198 [2018-03-23 11:54:08,116 INFO L226 Difference]: Without dead ends: 162 [2018-03-23 11:54:08,117 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=442, Unknown=1, NotChecked=46, Total=650 [2018-03-23 11:54:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-03-23 11:54:08,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 152. [2018-03-23 11:54:08,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-03-23 11:54:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-03-23 11:54:08,131 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 108 [2018-03-23 11:54:08,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:08,132 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-03-23 11:54:08,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-03-23 11:54:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-03-23 11:54:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-03-23 11:54:08,134 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:08,134 INFO L353 BasicCegarLoop]: trace histogram [9, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:08,134 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-03-23 11:54:08,134 INFO L82 PathProgramCache]: Analyzing trace with hash -958830374, now seen corresponding path program 3 times [2018-03-23 11:54:08,134 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:08,135 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:08,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:08,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:08,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:08,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 108 proven. 14 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-03-23 11:54:08,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:08,394 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:08,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 11:54:08,415 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-03-23 11:54:08,416 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:08,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:08,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:54:08,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:08,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:08,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:54:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 114 proven. 4 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-03-23 11:54:08,694 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:08,694 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-03-23 11:54:08,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-03-23 11:54:08,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-03-23 11:54:08,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2018-03-23 11:54:08,695 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 23 states. [2018-03-23 11:54:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:09,173 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-03-23 11:54:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-03-23 11:54:09,173 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 127 [2018-03-23 11:54:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:09,174 INFO L225 Difference]: With dead ends: 156 [2018-03-23 11:54:09,174 INFO L226 Difference]: Without dead ends: 155 [2018-03-23 11:54:09,175 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 112 SyntacticMatches, 6 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=267, Invalid=855, Unknown=0, NotChecked=0, Total=1122 [2018-03-23 11:54:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-03-23 11:54:09,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 149. [2018-03-23 11:54:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-03-23 11:54:09,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2018-03-23 11:54:09,187 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 127 [2018-03-23 11:54:09,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:09,188 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2018-03-23 11:54:09,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-03-23 11:54:09,188 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2018-03-23 11:54:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-03-23 11:54:09,189 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:09,189 INFO L353 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:09,189 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-03-23 11:54:09,189 INFO L82 PathProgramCache]: Analyzing trace with hash 123702859, now seen corresponding path program 1 times [2018-03-23 11:54:09,190 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:09,190 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:09,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:09,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:09,191 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:09,209 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2018-03-23 11:54:09,298 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:09,298 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:09,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:09,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 158 proven. 13 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-03-23 11:54:09,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:09,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2018-03-23 11:54:09,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-03-23 11:54:09,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-03-23 11:54:09,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2018-03-23 11:54:09,491 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand 25 states. [2018-03-23 11:54:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:09,950 INFO L93 Difference]: Finished difference Result 237 states and 247 transitions. [2018-03-23 11:54:09,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-03-23 11:54:09,950 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 148 [2018-03-23 11:54:09,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:09,951 INFO L225 Difference]: With dead ends: 237 [2018-03-23 11:54:09,951 INFO L226 Difference]: Without dead ends: 183 [2018-03-23 11:54:09,952 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=373, Invalid=2177, Unknown=0, NotChecked=0, Total=2550 [2018-03-23 11:54:09,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-03-23 11:54:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 167. [2018-03-23 11:54:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-03-23 11:54:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 170 transitions. [2018-03-23 11:54:09,963 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 170 transitions. Word has length 148 [2018-03-23 11:54:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:09,964 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 170 transitions. [2018-03-23 11:54:09,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-03-23 11:54:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 170 transitions. [2018-03-23 11:54:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-03-23 11:54:09,966 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:09,967 INFO L353 BasicCegarLoop]: trace histogram [14, 9, 9, 9, 9, 9, 9, 9, 9, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:09,967 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-03-23 11:54:09,967 INFO L82 PathProgramCache]: Analyzing trace with hash 190707240, now seen corresponding path program 2 times [2018-03-23 11:54:09,967 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:09,967 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:09,967 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:09,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:09,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:09,990 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2018-03-23 11:54:10,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:10,248 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:10,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:54:10,299 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:54:10,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:10,304 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 330 proven. 33 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-03-23 11:54:10,655 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:10,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 31 [2018-03-23 11:54:10,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-03-23 11:54:10,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-03-23 11:54:10,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2018-03-23 11:54:10,657 INFO L87 Difference]: Start difference. First operand 167 states and 170 transitions. Second operand 31 states. [2018-03-23 11:54:11,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:11,431 INFO L93 Difference]: Finished difference Result 317 states and 330 transitions. [2018-03-23 11:54:11,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-03-23 11:54:11,431 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 204 [2018-03-23 11:54:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:11,433 INFO L225 Difference]: With dead ends: 317 [2018-03-23 11:54:11,433 INFO L226 Difference]: Without dead ends: 257 [2018-03-23 11:54:11,434 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=563, Invalid=3597, Unknown=0, NotChecked=0, Total=4160 [2018-03-23 11:54:11,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-03-23 11:54:11,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 223. [2018-03-23 11:54:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-03-23 11:54:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 228 transitions. [2018-03-23 11:54:11,454 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 228 transitions. Word has length 204 [2018-03-23 11:54:11,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:11,455 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 228 transitions. [2018-03-23 11:54:11,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-03-23 11:54:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 228 transitions. [2018-03-23 11:54:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-03-23 11:54:11,457 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:11,457 INFO L353 BasicCegarLoop]: trace histogram [20, 14, 14, 14, 14, 14, 14, 14, 14, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:11,457 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-03-23 11:54:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash 713037826, now seen corresponding path program 3 times [2018-03-23 11:54:11,458 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:11,458 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:11,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:11,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:11,459 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:11,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 1155 trivial. 0 not checked. [2018-03-23 11:54:11,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:11,767 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:11,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 11:54:11,797 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-03-23 11:54:11,798 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:11,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:11,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:54:11,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:11,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:11,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:54:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1299 trivial. 0 not checked. [2018-03-23 11:54:12,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:54:12,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2018-03-23 11:54:12,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-03-23 11:54:12,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-03-23 11:54:12,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2018-03-23 11:54:12,175 INFO L87 Difference]: Start difference. First operand 223 states and 228 transitions. Second operand 21 states. [2018-03-23 11:54:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:12,919 INFO L93 Difference]: Finished difference Result 254 states and 263 transitions. [2018-03-23 11:54:12,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-03-23 11:54:12,922 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 269 [2018-03-23 11:54:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:12,923 INFO L225 Difference]: With dead ends: 254 [2018-03-23 11:54:12,923 INFO L226 Difference]: Without dead ends: 0 [2018-03-23 11:54:12,925 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 253 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=1695, Unknown=0, NotChecked=0, Total=2256 [2018-03-23 11:54:12,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-03-23 11:54:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-03-23 11:54:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-03-23 11:54:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-03-23 11:54:12,926 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 269 [2018-03-23 11:54:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:12,926 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-03-23 11:54:12,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-03-23 11:54:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-03-23 11:54:12,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-03-23 11:54:12,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-03-23 11:54:12,985 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-03-23 11:54:12,990 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-03-23 11:54:13,440 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 92 DAG size of output 1 [2018-03-23 11:54:13,722 WARN L151 SmtUtils]: Spent 278ms on a formula simplification. DAG size of input: 56 DAG size of output 30 [2018-03-23 11:54:15,486 WARN L151 SmtUtils]: Spent 1755ms on a formula simplification. DAG size of input: 157 DAG size of output 92 [2018-03-23 11:54:15,646 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 45 DAG size of output 24 [2018-03-23 11:54:15,649 INFO L416 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-03-23 11:54:15,649 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-03-23 11:54:15,649 INFO L412 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-03-23 11:54:15,649 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-03-23 11:54:15,649 INFO L419 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-03-23 11:54:15,649 INFO L419 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-03-23 11:54:15,649 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-03-23 11:54:15,649 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-03-23 11:54:15,649 INFO L412 ceAbstractionStarter]: At program point L22'''''(lines 22 24) the Hoare annotation is: (let ((.cse0 (= (select |old(#valid)| |main_~#b~0.base|) 0)) (.cse1 (= 400 (select |#length| |main_~#b~0.base|))) (.cse2 (= |#valid| (store |old(#valid)| |main_~#b~0.base| 1))) (.cse3 (= 0 |main_~#b~0.offset|))) (or (and .cse0 .cse1 (<= 4 (+ (* 4 main_~i~1) |main_~#b~0.offset|)) .cse2 .cse3) (and .cse0 .cse1 (= main_~i~1 0) .cse2 .cse3))) [2018-03-23 11:54:15,650 INFO L416 ceAbstractionStarter]: For program point mainErr1RequiresViolation(line 23) no Hoare annotation was computed. [2018-03-23 11:54:15,650 INFO L416 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-03-23 11:54:15,650 INFO L412 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (= (select |old(#valid)| |main_~#b~0.base|) 0)) (.cse1 (= 400 (select |#length| |main_~#b~0.base|))) (.cse2 (= |#valid| (store |old(#valid)| |main_~#b~0.base| 1))) (.cse3 (= 0 |main_~#b~0.offset|))) (or (and .cse0 .cse1 (<= main_~i~1 1) (<= 4 (+ (* 4 main_~i~1) |main_~#b~0.offset|)) .cse2 .cse3) (and .cse0 .cse1 (= main_~i~1 0) .cse2 .cse3) (and .cse0 .cse1 (< main_~i~1 100) .cse2 .cse3 (<= 2 main_~i~1)))) [2018-03-23 11:54:15,650 INFO L416 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-03-23 11:54:15,650 INFO L416 ceAbstractionStarter]: For program point mainErr0RequiresViolation(line 23) no Hoare annotation was computed. [2018-03-23 11:54:15,650 INFO L416 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2018-03-23 11:54:15,650 INFO L416 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-03-23 11:54:15,650 INFO L416 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-03-23 11:54:15,650 INFO L416 ceAbstractionStarter]: For program point L23'''(line 23) no Hoare annotation was computed. [2018-03-23 11:54:15,650 INFO L416 ceAbstractionStarter]: For program point mainErr2RequiresViolation(line 26) no Hoare annotation was computed. [2018-03-23 11:54:15,650 INFO L416 ceAbstractionStarter]: For program point L23'(line 23) no Hoare annotation was computed. [2018-03-23 11:54:15,650 INFO L416 ceAbstractionStarter]: For program point L21'''''(line 21) no Hoare annotation was computed. [2018-03-23 11:54:15,651 INFO L416 ceAbstractionStarter]: For program point L22''''''(lines 22 24) no Hoare annotation was computed. [2018-03-23 11:54:15,651 INFO L416 ceAbstractionStarter]: For program point mainFINAL(lines 20 31) no Hoare annotation was computed. [2018-03-23 11:54:15,651 INFO L416 ceAbstractionStarter]: For program point L22''(lines 22 24) no Hoare annotation was computed. [2018-03-23 11:54:15,651 INFO L416 ceAbstractionStarter]: For program point mainEXIT(lines 20 31) no Hoare annotation was computed. [2018-03-23 11:54:15,651 INFO L412 ceAbstractionStarter]: At program point mainENTRY(lines 20 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-03-23 11:54:15,651 INFO L416 ceAbstractionStarter]: For program point L22''''(line 22) no Hoare annotation was computed. [2018-03-23 11:54:15,651 INFO L416 ceAbstractionStarter]: For program point L22'''(line 22) no Hoare annotation was computed. [2018-03-23 11:54:15,651 INFO L416 ceAbstractionStarter]: For program point L26'(line 26) no Hoare annotation was computed. [2018-03-23 11:54:15,651 INFO L416 ceAbstractionStarter]: For program point L26''(line 26) no Hoare annotation was computed. [2018-03-23 11:54:15,651 INFO L416 ceAbstractionStarter]: For program point L21''''(line 21) no Hoare annotation was computed. [2018-03-23 11:54:15,652 INFO L416 ceAbstractionStarter]: For program point L26'''(line 26) no Hoare annotation was computed. [2018-03-23 11:54:15,652 INFO L412 ceAbstractionStarter]: At program point L25'''''(lines 25 29) the Hoare annotation is: (let ((.cse0 (= (select |old(#valid)| |main_~#b~0.base|) 0)) (.cse1 (= 400 (select |#length| |main_~#b~0.base|))) (.cse2 (= |#valid| (store |old(#valid)| |main_~#b~0.base| 1))) (.cse3 (= 0 |main_~#b~0.offset|))) (or (and .cse0 .cse1 (= main_~i~1 0) .cse2 .cse3) (and .cse0 .cse1 (<= 1 main_~i~1) .cse2 .cse3))) [2018-03-23 11:54:15,652 INFO L416 ceAbstractionStarter]: For program point L25'''(line 25) no Hoare annotation was computed. [2018-03-23 11:54:15,652 INFO L416 ceAbstractionStarter]: For program point L25''''''(lines 25 29) no Hoare annotation was computed. [2018-03-23 11:54:15,652 INFO L416 ceAbstractionStarter]: For program point L21'''(line 21) no Hoare annotation was computed. [2018-03-23 11:54:15,652 INFO L416 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-03-23 11:54:15,652 INFO L416 ceAbstractionStarter]: For program point mainErr3RequiresViolation(line 26) no Hoare annotation was computed. [2018-03-23 11:54:15,652 INFO L416 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-03-23 11:54:15,652 INFO L416 ceAbstractionStarter]: For program point L25''(lines 25 29) no Hoare annotation was computed. [2018-03-23 11:54:15,652 INFO L416 ceAbstractionStarter]: For program point L23''(line 23) no Hoare annotation was computed. [2018-03-23 11:54:15,652 INFO L416 ceAbstractionStarter]: For program point mainErr4EnsuresViolationMEMORY_LEAK(lines 20 31) no Hoare annotation was computed. [2018-03-23 11:54:15,652 INFO L416 ceAbstractionStarter]: For program point L21''(line 21) no Hoare annotation was computed. [2018-03-23 11:54:15,652 INFO L416 ceAbstractionStarter]: For program point L14'''(lines 14 16) no Hoare annotation was computed. [2018-03-23 11:54:15,653 INFO L416 ceAbstractionStarter]: For program point L14'''''''(lines 14 16) no Hoare annotation was computed. [2018-03-23 11:54:15,653 INFO L419 ceAbstractionStarter]: At program point __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooENTRY(lines 12 18) the Hoare annotation is: true [2018-03-23 11:54:15,653 INFO L416 ceAbstractionStarter]: For program point L14'''''(line 14) no Hoare annotation was computed. [2018-03-23 11:54:15,653 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr2RequiresViolation(line 15) no Hoare annotation was computed. [2018-03-23 11:54:15,653 INFO L416 ceAbstractionStarter]: For program point L14''''(line 14) no Hoare annotation was computed. [2018-03-23 11:54:15,653 INFO L416 ceAbstractionStarter]: For program point L15'(line 15) no Hoare annotation was computed. [2018-03-23 11:54:15,653 INFO L416 ceAbstractionStarter]: For program point L15''(line 15) no Hoare annotation was computed. [2018-03-23 11:54:15,653 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr0AssertViolationARRAY_INDEX(line 15) no Hoare annotation was computed. [2018-03-23 11:54:15,653 INFO L416 ceAbstractionStarter]: For program point L13'(line 13) no Hoare annotation was computed. [2018-03-23 11:54:15,653 INFO L416 ceAbstractionStarter]: For program point L12(lines 12 18) no Hoare annotation was computed. [2018-03-23 11:54:15,654 INFO L416 ceAbstractionStarter]: For program point L15'''(line 15) no Hoare annotation was computed. [2018-03-23 11:54:15,654 INFO L416 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-03-23 11:54:15,654 INFO L416 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-03-23 11:54:15,654 INFO L416 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-03-23 11:54:15,654 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooErr1RequiresViolation(line 15) no Hoare annotation was computed. [2018-03-23 11:54:15,654 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooEXIT(lines 12 18) no Hoare annotation was computed. [2018-03-23 11:54:15,654 INFO L416 ceAbstractionStarter]: For program point L12'(lines 12 18) no Hoare annotation was computed. [2018-03-23 11:54:15,654 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__fooFINAL(lines 12 18) no Hoare annotation was computed. [2018-03-23 11:54:15,654 INFO L416 ceAbstractionStarter]: For program point L14'(lines 14 16) no Hoare annotation was computed. [2018-03-23 11:54:15,654 INFO L412 ceAbstractionStarter]: At program point L14''''''(lines 14 16) the Hoare annotation is: (let ((.cse12 (not (= (select |#valid| |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base|) 1))) (.cse13 (not (= (select |#length| |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base|) 400))) (.cse7 (= 0 __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0)) (.cse5 (<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n)) (.cse14 (<= 2 __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n))) (let ((.cse2 (<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size|)) (.cse1 (<= |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size)) (.cse3 (and (<= 1 __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0) (let ((.cse15 (= 400 (select |#length| __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base))) (.cse16 (= 1 (select |#valid| __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base)))) (or (and (<= |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size| 1) .cse15 (<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size 1) .cse16) (and .cse15 (= 0 __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset) .cse16 (<= |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size| __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~n) (<= |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size| |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n|) .cse5))) (<= 2 |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n|) .cse14)) (.cse6 (= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset 0)) (.cse0 (= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.base |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.base|)) (.cse9 (< |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n| |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size|)) (.cse11 (and .cse14 .cse7)) (.cse4 (< |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~n| 2)) (.cse10 (exists ((__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 Int)) (and (<= (+ __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 1) |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size|) (<= 0 (+ |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset| (* 4 __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0)))))) (.cse8 (or (not (= |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset| 0)) .cse12 .cse13))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 (and .cse5 .cse0 .cse1 .cse2 .cse6 .cse7) (< 99 |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size|) .cse8 .cse9) (or (and .cse6 .cse2 .cse5 .cse0 .cse1 .cse7) (and (exists ((v_prenex_1 Int)) (and (<= (+ v_prenex_1 1) __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0) (<= 0 (+ (* 4 v_prenex_1) __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset)))) (<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 1) .cse2 .cse5 (<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~b.offset |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset|) .cse0 .cse1) (not .cse10) .cse8 (< 1 |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size|) .cse9) (or .cse11 .cse4 (and (<= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 2) .cse3) .cse8 (< 2 |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size|)) (or (and .cse6 (= __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~size 0) .cse5 .cse0 .cse7) (not (= 0 |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~size|)) (not (= 0 |__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_#in~b.offset|)) .cse12 .cse13 .cse9) (or .cse11 .cse4 .cse10 .cse8)))) [2018-03-23 11:54:15,664 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-03-23 11:54:15,665 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-03-23 11:54:15,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,666 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,667 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,671 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,671 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,671 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,682 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-03-23 11:54:15,682 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-03-23 11:54:15,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,683 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,684 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,684 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,685 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,685 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,685 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,686 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,687 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,687 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,687 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,690 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,691 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,692 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,693 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,694 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,694 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 11:54:15 BoogieIcfgContainer [2018-03-23 11:54:15,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-23 11:54:15,698 INFO L168 Benchmark]: Toolchain (without parser) took 16387.32 ms. Allocated memory was 306.2 MB in the beginning and 695.7 MB in the end (delta: 389.5 MB). Free memory was 251.4 MB in the beginning and 549.3 MB in the end (delta: -297.8 MB). Peak memory consumption was 326.2 MB. Max. memory is 5.3 GB. [2018-03-23 11:54:15,699 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 306.2 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-23 11:54:15,700 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.48 ms. Allocated memory is still 306.2 MB. Free memory was 251.4 MB in the beginning and 241.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-03-23 11:54:15,700 INFO L168 Benchmark]: Boogie Preprocessor took 31.05 ms. Allocated memory is still 306.2 MB. Free memory was 241.5 MB in the beginning and 240.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-03-23 11:54:15,700 INFO L168 Benchmark]: RCFGBuilder took 341.06 ms. Allocated memory was 306.2 MB in the beginning and 469.8 MB in the end (delta: 163.6 MB). Free memory was 239.5 MB in the beginning and 435.4 MB in the end (delta: -195.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-03-23 11:54:15,701 INFO L168 Benchmark]: TraceAbstraction took 15781.89 ms. Allocated memory was 469.8 MB in the beginning and 695.7 MB in the end (delta: 226.0 MB). Free memory was 435.4 MB in the beginning and 549.3 MB in the end (delta: -113.9 MB). Peak memory consumption was 346.6 MB. Max. memory is 5.3 GB. [2018-03-23 11:54:15,703 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.20 ms. Allocated memory is still 306.2 MB. Free memory is still 270.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 227.48 ms. Allocated memory is still 306.2 MB. Free memory was 251.4 MB in the beginning and 241.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.05 ms. Allocated memory is still 306.2 MB. Free memory was 241.5 MB in the beginning and 240.5 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 341.06 ms. Allocated memory was 306.2 MB in the beginning and 469.8 MB in the end (delta: 163.6 MB). Free memory was 239.5 MB in the beginning and 435.4 MB in the end (delta: -195.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 15781.89 ms. Allocated memory was 469.8 MB in the beginning and 695.7 MB in the end (delta: 226.0 MB). Free memory was 435.4 MB in the beginning and 549.3 MB in the end (delta: -113.9 MB). Peak memory consumption was 346.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant [2018-03-23 11:54:15,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-03-23 11:54:15,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-03-23 11:54:15,712 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,713 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,713 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,713 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,714 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,714 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,714 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,715 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,716 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,719 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-03-23 11:54:15,719 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-03-23 11:54:15,720 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,720 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,721 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,721 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[__U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0,QUANTIFIED] [2018-03-23 11:54:15,721 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,722 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,723 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((b == b && \old(size) <= size) && size <= \old(size)) && ((1 <= i && ((((\old(size) <= 1 && 400 == unknown-#length-unknown[b]) && size <= 1) && 1 == \valid[b]) || (((((400 == unknown-#length-unknown[b] && 0 == b) && 1 == \valid[b]) && \old(size) <= n) && \old(size) <= \old(n)) && size <= n))) && 2 <= \old(n)) && 2 <= n) || \old(n) < 2) || (((((size <= n && b == b) && \old(size) <= size) && size <= \old(size)) && b == 0) && 0 == i)) || 99 < \old(size)) || (!(b == 0) || !(\valid[b] == 1)) || !(unknown-#length-unknown[b] == 400)) || \old(n) < \old(size)) && ((((((((((b == 0 && size <= \old(size)) && size <= n) && b == b) && \old(size) <= size) && 0 == i) || (((((((\exists v_prenex_1 : int :: v_prenex_1 + 1 <= i && 0 <= 4 * v_prenex_1 + b) && i <= 1) && size <= \old(size)) && size <= n) && b <= b) && b == b) && \old(size) <= size)) || !(\exists __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 : int :: __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 + 1 <= \old(size) && 0 <= b + 4 * __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0)) || (!(b == 0) || !(\valid[b] == 1)) || !(unknown-#length-unknown[b] == 400)) || 1 < \old(size)) || \old(n) < \old(size))) && (((((2 <= n && 0 == i) || \old(n) < 2) || (i <= 2 && ((1 <= i && ((((\old(size) <= 1 && 400 == unknown-#length-unknown[b]) && size <= 1) && 1 == \valid[b]) || (((((400 == unknown-#length-unknown[b] && 0 == b) && 1 == \valid[b]) && \old(size) <= n) && \old(size) <= \old(n)) && size <= n))) && 2 <= \old(n)) && 2 <= n)) || (!(b == 0) || !(\valid[b] == 1)) || !(unknown-#length-unknown[b] == 400)) || 2 < \old(size))) && (((((((((b == 0 && size == 0) && size <= n) && b == b) && 0 == i) || !(0 == \old(size))) || !(0 == b)) || !(\valid[b] == 1)) || !(unknown-#length-unknown[b] == 400)) || \old(n) < \old(size))) && ((((2 <= n && 0 == i) || \old(n) < 2) || (\exists __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 : int :: __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0 + 1 <= \old(size) && 0 <= b + 4 * __U_MULTI_fArraysOfVariableLength_true_valid_memsafety_c__foo_~i~0)) || (!(b == 0) || !(\valid[b] == 1)) || !(unknown-#length-unknown[b] == 400)) - InvariantResult [Line: 25]: Loop Invariant [2018-03-23 11:54:15,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,725 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,726 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((\old(\valid)[b] == 0 && 400 == unknown-#length-unknown[b]) && i == 0) && \valid == \old(\valid)[b := 1]) && 0 == b) || ((((\old(\valid)[b] == 0 && 400 == unknown-#length-unknown[b]) && 1 <= i) && \valid == \old(\valid)[b := 1]) && 0 == b) - InvariantResult [Line: 22]: Loop Invariant [2018-03-23 11:54:15,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,727 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:15,728 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((\old(\valid)[b] == 0 && 400 == unknown-#length-unknown[b]) && 4 <= 4 * i + b) && \valid == \old(\valid)[b := 1]) && 0 == b) || ((((\old(\valid)[b] == 0 && 400 == unknown-#length-unknown[b]) && i == 0) && \valid == \old(\valid)[b := 1]) && 0 == b) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 64 locations, 8 error locations. SAFE Result, 15.6s OverallTime, 22 OverallIterations, 20 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 2.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1093 SDtfs, 2426 SDslu, 6217 SDs, 0 SdLazy, 5073 SolverSat, 332 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1933 GetRequests, 1437 SyntacticMatches, 46 SemanticMatches, 450 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3925 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 315 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 39 PreInvPairs, 82 NumberOfFragments, 563 HoareAnnotationTreeSize, 39 FomulaSimplifications, 6229 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 4762 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 3263 NumberOfCodeBlocks, 2836 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 3226 ConstructedInterpolants, 455 QuantifiedInterpolants, 1586647 SizeOfPredicates, 92 NumberOfNonLiveVariables, 2556 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 37 InterpolantComputations, 11 PerfectInterpolantSequences, 5480/6062 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-23_11-54-15-734.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-23_11-54-15-734.csv Received shutdown request...