java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 13:49:09,015 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 13:49:09,016 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 13:49:09,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 13:49:09,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 13:49:09,027 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 13:49:09,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 13:49:09,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 13:49:09,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 13:49:09,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 13:49:09,031 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 13:49:09,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 13:49:09,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 13:49:09,032 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 13:49:09,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 13:49:09,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 13:49:09,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 13:49:09,037 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 13:49:09,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 13:49:09,038 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 13:49:09,039 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 13:49:09,040 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 13:49:09,040 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 13:49:09,040 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 13:49:09,041 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 13:49:09,042 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 13:49:09,042 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 13:49:09,042 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 13:49:09,043 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 13:49:09,043 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 13:49:09,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 13:49:09,043 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-10 13:49:09,052 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 13:49:09,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 13:49:09,053 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 13:49:09,053 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 13:49:09,053 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 13:49:09,053 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 13:49:09,053 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 13:49:09,053 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 13:49:09,054 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 13:49:09,054 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 13:49:09,054 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 13:49:09,054 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 13:49:09,054 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 13:49:09,054 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 13:49:09,054 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 13:49:09,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 13:49:09,055 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 13:49:09,055 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 13:49:09,055 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 13:49:09,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 13:49:09,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 13:49:09,055 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 13:49:09,055 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 13:49:09,055 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-04-10 13:49:09,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 13:49:09,090 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 13:49:09,093 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 13:49:09,094 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 13:49:09,094 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 13:49:09,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-10 13:49:09,395 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG696866d49 [2018-04-10 13:49:09,487 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 13:49:09,487 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 13:49:09,487 INFO L168 CDTParser]: Scanning ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-10 13:49:09,488 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 13:49:09,488 INFO L215 ultiparseSymbolTable]: [2018-04-10 13:49:09,488 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 13:49:09,488 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo ('foo') in ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-10 13:49:09,488 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-10 13:49:09,488 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 13:49:09,488 INFO L233 ultiparseSymbolTable]: [2018-04-10 13:49:09,500 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG696866d49 [2018-04-10 13:49:09,503 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 13:49:09,504 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 13:49:09,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 13:49:09,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 13:49:09,509 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 13:49:09,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 01:49:09" (1/1) ... [2018-04-10 13:49:09,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281311f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 01:49:09, skipping insertion in model container [2018-04-10 13:49:09,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 01:49:09" (1/1) ... [2018-04-10 13:49:09,522 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 13:49:09,530 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 13:49:09,649 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 13:49:09,670 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 13:49:09,675 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-10 13:49:09,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 01:49:09 WrapperNode [2018-04-10 13:49:09,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 13:49:09,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 13:49:09,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 13:49:09,683 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 13:49:09,694 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 01:49:09" (1/1) ... [2018-04-10 13:49:09,694 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 01:49:09" (1/1) ... [2018-04-10 13:49:09,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 01:49:09" (1/1) ... [2018-04-10 13:49:09,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 01:49:09" (1/1) ... [2018-04-10 13:49:09,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 01:49:09" (1/1) ... [2018-04-10 13:49:09,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 01:49:09" (1/1) ... [2018-04-10 13:49:09,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 01:49:09" (1/1) ... [2018-04-10 13:49:09,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 13:49:09,711 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 13:49:09,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 13:49:09,711 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 13:49:09,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 01:49:09" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 13:49:09,755 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 13:49:09,756 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 13:49:09,756 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo [2018-04-10 13:49:09,756 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 13:49:09,756 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__foo [2018-04-10 13:49:09,756 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 13:49:09,756 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 13:49:09,756 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 13:49:09,756 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 13:49:09,757 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 13:49:09,757 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 13:49:09,757 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 13:49:09,757 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 13:49:09,947 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 13:49:09,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 01:49:09 BoogieIcfgContainer [2018-04-10 13:49:09,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 13:49:09,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 13:49:09,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 13:49:09,950 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 13:49:09,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 01:49:09" (1/3) ... [2018-04-10 13:49:09,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c81fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 01:49:09, skipping insertion in model container [2018-04-10 13:49:09,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 01:49:09" (2/3) ... [2018-04-10 13:49:09,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c81fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 01:49:09, skipping insertion in model container [2018-04-10 13:49:09,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 01:49:09" (3/3) ... [2018-04-10 13:49:09,952 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-04-10 13:49:09,958 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 13:49:09,963 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-10 13:49:09,993 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 13:49:09,994 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 13:49:09,994 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 13:49:09,994 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 13:49:09,994 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 13:49:09,994 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 13:49:09,994 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 13:49:09,994 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 13:49:09,995 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 13:49:09,995 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 13:49:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-04-10 13:49:10,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-10 13:49:10,012 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:10,012 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:10,012 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:10,015 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-04-10 13:49:10,016 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:10,017 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:10,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:10,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:10,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:10,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 13:49:10,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 13:49:10,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 13:49:10,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 13:49:10,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 13:49:10,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 13:49:10,141 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-04-10 13:49:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:10,192 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-04-10 13:49:10,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 13:49:10,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-10 13:49:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:10,202 INFO L225 Difference]: With dead ends: 63 [2018-04-10 13:49:10,202 INFO L226 Difference]: Without dead ends: 59 [2018-04-10 13:49:10,203 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 13:49:10,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-10 13:49:10,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-04-10 13:49:10,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-10 13:49:10,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-04-10 13:49:10,226 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-04-10 13:49:10,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:10,226 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-04-10 13:49:10,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 13:49:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-04-10 13:49:10,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 13:49:10,228 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:10,228 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:10,228 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:10,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-04-10 13:49:10,228 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:10,228 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:10,229 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:10,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:10,229 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:10,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:10,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 13:49:10,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 13:49:10,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-10 13:49:10,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-10 13:49:10,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-10 13:49:10,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 13:49:10,270 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 3 states. [2018-04-10 13:49:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:10,316 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-04-10 13:49:10,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-10 13:49:10,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-10 13:49:10,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:10,319 INFO L225 Difference]: With dead ends: 60 [2018-04-10 13:49:10,320 INFO L226 Difference]: Without dead ends: 60 [2018-04-10 13:49:10,320 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-10 13:49:10,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-10 13:49:10,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2018-04-10 13:49:10,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-10 13:49:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-04-10 13:49:10,325 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 16 [2018-04-10 13:49:10,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:10,326 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-04-10 13:49:10,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-10 13:49:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-04-10 13:49:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 13:49:10,326 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:10,327 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:10,327 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:10,327 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-04-10 13:49:10,327 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:10,327 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:10,328 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:10,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:10,328 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:10,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 13:49:10,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 13:49:10,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-10 13:49:10,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 13:49:10,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 13:49:10,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-10 13:49:10,448 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 8 states. [2018-04-10 13:49:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:10,612 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2018-04-10 13:49:10,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 13:49:10,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-04-10 13:49:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:10,614 INFO L225 Difference]: With dead ends: 75 [2018-04-10 13:49:10,614 INFO L226 Difference]: Without dead ends: 75 [2018-04-10 13:49:10,614 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-04-10 13:49:10,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-10 13:49:10,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-04-10 13:49:10,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-10 13:49:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-04-10 13:49:10,620 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 17 [2018-04-10 13:49:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:10,620 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-04-10 13:49:10,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 13:49:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-04-10 13:49:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-04-10 13:49:10,621 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:10,621 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:10,621 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:10,621 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-04-10 13:49:10,621 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:10,622 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:10,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:10,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:10,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:10,630 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 13:49:10,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 13:49:10,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 13:49:10,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 13:49:10,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 13:49:10,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 13:49:10,653 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 5 states. [2018-04-10 13:49:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:10,675 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-04-10 13:49:10,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 13:49:10,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-04-10 13:49:10,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:10,676 INFO L225 Difference]: With dead ends: 65 [2018-04-10 13:49:10,676 INFO L226 Difference]: Without dead ends: 65 [2018-04-10 13:49:10,676 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-10 13:49:10,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-10 13:49:10,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-04-10 13:49:10,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-10 13:49:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-04-10 13:49:10,679 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2018-04-10 13:49:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:10,680 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-04-10 13:49:10,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 13:49:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-04-10 13:49:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 13:49:10,680 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:10,680 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:10,680 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:10,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-04-10 13:49:10,680 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:10,680 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:10,681 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:10,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:10,681 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:10,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:10,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 13:49:10,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:10,749 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:10,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:10,775 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 13:49:10,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:10,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2018-04-10 13:49:10,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-10 13:49:10,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-10 13:49:10,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-10 13:49:10,820 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 10 states. [2018-04-10 13:49:10,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:10,996 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-04-10 13:49:10,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 13:49:10,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-04-10 13:49:10,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:10,997 INFO L225 Difference]: With dead ends: 105 [2018-04-10 13:49:10,997 INFO L226 Difference]: Without dead ends: 105 [2018-04-10 13:49:10,997 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-04-10 13:49:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-10 13:49:11,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2018-04-10 13:49:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-04-10 13:49:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-04-10 13:49:11,001 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2018-04-10 13:49:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:11,001 INFO L459 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-04-10 13:49:11,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-10 13:49:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-04-10 13:49:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-10 13:49:11,001 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:11,001 INFO L355 BasicCegarLoop]: trace histogram [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-04-10 13:49:11,001 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:11,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1693854175, now seen corresponding path program 1 times [2018-04-10 13:49:11,002 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:11,002 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:11,002 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:11,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:11,002 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:11,011 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 13:49:11,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 13:49:11,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 13:49:11,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 13:49:11,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 13:49:11,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 13:49:11,036 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 5 states. [2018-04-10 13:49:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:11,062 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2018-04-10 13:49:11,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 13:49:11,063 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-10 13:49:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:11,065 INFO L225 Difference]: With dead ends: 85 [2018-04-10 13:49:11,065 INFO L226 Difference]: Without dead ends: 85 [2018-04-10 13:49:11,065 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-10 13:49:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-10 13:49:11,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2018-04-10 13:49:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-10 13:49:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-04-10 13:49:11,069 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 29 [2018-04-10 13:49:11,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:11,070 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-04-10 13:49:11,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 13:49:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-04-10 13:49:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-10 13:49:11,070 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:11,071 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:11,071 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:11,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-04-10 13:49:11,071 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:11,071 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:11,072 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:11,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:11,072 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:11,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-10 13:49:11,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:11,102 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:11,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:11,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 13:49:11,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:11,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-04-10 13:49:11,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-10 13:49:11,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-10 13:49:11,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-10 13:49:11,197 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 8 states. [2018-04-10 13:49:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:11,308 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-04-10 13:49:11,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 13:49:11,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-04-10 13:49:11,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:11,309 INFO L225 Difference]: With dead ends: 118 [2018-04-10 13:49:11,309 INFO L226 Difference]: Without dead ends: 109 [2018-04-10 13:49:11,309 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-04-10 13:49:11,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-10 13:49:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2018-04-10 13:49:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-10 13:49:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-10 13:49:11,314 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 37 [2018-04-10 13:49:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:11,314 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-10 13:49:11,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-10 13:49:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-10 13:49:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-10 13:49:11,315 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:11,316 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:11,316 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:11,316 INFO L82 PathProgramCache]: Analyzing trace with hash 98230391, now seen corresponding path program 1 times [2018-04-10 13:49:11,316 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:11,316 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:11,317 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:11,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:11,317 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:11,330 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-04-10 13:49:11,481 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:11,481 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:11,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:11,510 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-04-10 13:49:11,609 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:11,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-04-10 13:49:11,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 13:49:11,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 13:49:11,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-04-10 13:49:11,610 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 16 states. [2018-04-10 13:49:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:11,970 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-04-10 13:49:11,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 13:49:11,971 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-04-10 13:49:11,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:11,972 INFO L225 Difference]: With dead ends: 155 [2018-04-10 13:49:11,972 INFO L226 Difference]: Without dead ends: 155 [2018-04-10 13:49:11,972 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2018-04-10 13:49:11,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-10 13:49:11,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2018-04-10 13:49:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-10 13:49:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 134 transitions. [2018-04-10 13:49:11,978 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 134 transitions. Word has length 59 [2018-04-10 13:49:11,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:11,979 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 134 transitions. [2018-04-10 13:49:11,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 13:49:11,979 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2018-04-10 13:49:11,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-10 13:49:11,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:11,980 INFO L355 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:11,980 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:11,981 INFO L82 PathProgramCache]: Analyzing trace with hash -81663113, now seen corresponding path program 2 times [2018-04-10 13:49:11,981 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:11,981 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:11,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:11,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:11,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:11,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 37 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-04-10 13:49:12,124 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:12,124 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:12,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 13:49:12,139 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-04-10 13:49:12,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:12,141 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:12,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 13:49:12,179 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-04-10 13:49:12,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:49:12,181 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-04-10 13:49:12,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-10 13:49:12,230 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 13:49:12,231 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-04-10 13:49:12,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:49:12,233 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-04-10 13:49:12,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-04-10 13:49:12,290 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~0.base| Int)) (and (= (store |c_old(#valid)| |main_~#mask~0.base| 0) |c_#valid|) (= (select |c_old(#valid)| |main_~#mask~0.base|) 0))) is different from true [2018-04-10 13:49:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-04-10 13:49:12,331 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-10 13:49:12,331 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2018-04-10 13:49:12,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-10 13:49:12,331 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-10 13:49:12,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=130, Unknown=1, NotChecked=22, Total=182 [2018-04-10 13:49:12,332 INFO L87 Difference]: Start difference. First operand 126 states and 134 transitions. Second operand 14 states. [2018-04-10 13:49:12,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:12,555 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-04-10 13:49:12,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 13:49:12,555 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-04-10 13:49:12,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:12,556 INFO L225 Difference]: With dead ends: 105 [2018-04-10 13:49:12,556 INFO L226 Difference]: Without dead ends: 105 [2018-04-10 13:49:12,556 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=362, Unknown=1, NotChecked=40, Total=506 [2018-04-10 13:49:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-10 13:49:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-04-10 13:49:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-10 13:49:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2018-04-10 13:49:12,559 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 67 [2018-04-10 13:49:12,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:12,559 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2018-04-10 13:49:12,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-10 13:49:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2018-04-10 13:49:12,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-10 13:49:12,560 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:12,560 INFO L355 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:12,560 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:12,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1376831888, now seen corresponding path program 2 times [2018-04-10 13:49:12,560 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:12,560 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:12,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:12,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:12,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:12,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 185 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-04-10 13:49:12,650 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:12,651 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:12,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 13:49:12,688 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 13:49:12,689 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:12,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 185 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-04-10 13:49:12,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:12,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-04-10 13:49:12,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 13:49:12,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 13:49:12,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-10 13:49:12,767 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand 11 states. [2018-04-10 13:49:12,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:12,848 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2018-04-10 13:49:12,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-10 13:49:12,848 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 89 [2018-04-10 13:49:12,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:12,849 INFO L225 Difference]: With dead ends: 114 [2018-04-10 13:49:12,849 INFO L226 Difference]: Without dead ends: 108 [2018-04-10 13:49:12,850 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-04-10 13:49:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-10 13:49:12,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2018-04-10 13:49:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-10 13:49:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 108 transitions. [2018-04-10 13:49:12,853 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 108 transitions. Word has length 89 [2018-04-10 13:49:12,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:12,854 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 108 transitions. [2018-04-10 13:49:12,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 13:49:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 108 transitions. [2018-04-10 13:49:12,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-10 13:49:12,855 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:12,855 INFO L355 BasicCegarLoop]: trace histogram [12, 10, 10, 9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:12,855 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:12,855 INFO L82 PathProgramCache]: Analyzing trace with hash -30161384, now seen corresponding path program 3 times [2018-04-10 13:49:12,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:12,856 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:12,856 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:12,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:12,857 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:12,870 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:12,976 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 203 proven. 25 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-04-10 13:49:12,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:12,977 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:12,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 13:49:13,009 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 13:49:13,009 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:13,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:13,017 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-04-10 13:49:13,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:49:13,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:49:13,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:49:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 162 proven. 22 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-04-10 13:49:13,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:13,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2018-04-10 13:49:13,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 13:49:13,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 13:49:13,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-04-10 13:49:13,209 INFO L87 Difference]: Start difference. First operand 105 states and 108 transitions. Second operand 21 states. [2018-04-10 13:49:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:13,534 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-04-10 13:49:13,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-10 13:49:13,534 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 95 [2018-04-10 13:49:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:13,535 INFO L225 Difference]: With dead ends: 143 [2018-04-10 13:49:13,535 INFO L226 Difference]: Without dead ends: 143 [2018-04-10 13:49:13,536 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=875, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 13:49:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-10 13:49:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-04-10 13:49:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-10 13:49:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 145 transitions. [2018-04-10 13:49:13,538 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 145 transitions. Word has length 95 [2018-04-10 13:49:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:13,538 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 145 transitions. [2018-04-10 13:49:13,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 13:49:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 145 transitions. [2018-04-10 13:49:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-04-10 13:49:13,539 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:13,539 INFO L355 BasicCegarLoop]: trace histogram [16, 13, 13, 12, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:13,539 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:13,540 INFO L82 PathProgramCache]: Analyzing trace with hash -2114920591, now seen corresponding path program 4 times [2018-04-10 13:49:13,540 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:13,540 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:13,540 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:13,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:13,540 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:13,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 257 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-04-10 13:49:13,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:13,776 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:13,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 13:49:13,807 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 13:49:13,807 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:13,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 409 proven. 24 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-04-10 13:49:13,934 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:13,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2018-04-10 13:49:13,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 13:49:13,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 13:49:13,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2018-04-10 13:49:13,935 INFO L87 Difference]: Start difference. First operand 141 states and 145 transitions. Second operand 18 states. [2018-04-10 13:49:14,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:14,277 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2018-04-10 13:49:14,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 13:49:14,278 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 125 [2018-04-10 13:49:14,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:14,278 INFO L225 Difference]: With dead ends: 161 [2018-04-10 13:49:14,279 INFO L226 Difference]: Without dead ends: 155 [2018-04-10 13:49:14,279 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 117 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2018-04-10 13:49:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-10 13:49:14,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 147. [2018-04-10 13:49:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-10 13:49:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 150 transitions. [2018-04-10 13:49:14,282 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 150 transitions. Word has length 125 [2018-04-10 13:49:14,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:14,283 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 150 transitions. [2018-04-10 13:49:14,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 13:49:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 150 transitions. [2018-04-10 13:49:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-04-10 13:49:14,284 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:14,284 INFO L355 BasicCegarLoop]: trace histogram [18, 15, 15, 14, 14, 14, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:14,284 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:14,284 INFO L82 PathProgramCache]: Analyzing trace with hash -936202175, now seen corresponding path program 5 times [2018-04-10 13:49:14,284 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:14,284 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:14,284 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:14,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:14,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:14,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 345 proven. 80 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-04-10 13:49:14,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:14,470 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:14,475 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 13:49:14,505 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-10 13:49:14,505 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:14,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:14,647 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 425 proven. 30 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-04-10 13:49:14,664 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:14,664 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 23 [2018-04-10 13:49:14,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-10 13:49:14,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-10 13:49:14,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2018-04-10 13:49:14,665 INFO L87 Difference]: Start difference. First operand 147 states and 150 transitions. Second operand 23 states. [2018-04-10 13:49:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:15,122 INFO L93 Difference]: Finished difference Result 211 states and 216 transitions. [2018-04-10 13:49:15,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 13:49:15,164 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 137 [2018-04-10 13:49:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:15,165 INFO L225 Difference]: With dead ends: 211 [2018-04-10 13:49:15,165 INFO L226 Difference]: Without dead ends: 211 [2018-04-10 13:49:15,166 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 125 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=314, Invalid=1408, Unknown=0, NotChecked=0, Total=1722 [2018-04-10 13:49:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-04-10 13:49:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 195. [2018-04-10 13:49:15,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-10 13:49:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 200 transitions. [2018-04-10 13:49:15,170 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 200 transitions. Word has length 137 [2018-04-10 13:49:15,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:15,170 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 200 transitions. [2018-04-10 13:49:15,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-10 13:49:15,170 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 200 transitions. [2018-04-10 13:49:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-04-10 13:49:15,172 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:15,172 INFO L355 BasicCegarLoop]: trace histogram [24, 20, 20, 19, 19, 19, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:15,172 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:15,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1943695766, now seen corresponding path program 6 times [2018-04-10 13:49:15,172 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:15,173 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:15,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:15,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:15,173 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:15,188 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 905 proven. 44 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-04-10 13:49:15,292 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:15,292 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:15,297 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 13:49:15,332 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-10 13:49:15,332 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:15,334 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 716 proven. 333 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-04-10 13:49:15,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:15,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 28 [2018-04-10 13:49:15,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 13:49:15,487 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 13:49:15,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2018-04-10 13:49:15,488 INFO L87 Difference]: Start difference. First operand 195 states and 200 transitions. Second operand 28 states. [2018-04-10 13:49:15,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:15,888 INFO L93 Difference]: Finished difference Result 260 states and 264 transitions. [2018-04-10 13:49:15,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-10 13:49:15,889 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 179 [2018-04-10 13:49:15,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:15,889 INFO L225 Difference]: With dead ends: 260 [2018-04-10 13:49:15,889 INFO L226 Difference]: Without dead ends: 251 [2018-04-10 13:49:15,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=343, Invalid=1913, Unknown=0, NotChecked=0, Total=2256 [2018-04-10 13:49:15,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-04-10 13:49:15,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 243. [2018-04-10 13:49:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-10 13:49:15,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 247 transitions. [2018-04-10 13:49:15,893 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 247 transitions. Word has length 179 [2018-04-10 13:49:15,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:15,893 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 247 transitions. [2018-04-10 13:49:15,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 13:49:15,893 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 247 transitions. [2018-04-10 13:49:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-04-10 13:49:15,895 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:15,895 INFO L355 BasicCegarLoop]: trace histogram [31, 26, 26, 25, 25, 25, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:15,895 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:15,895 INFO L82 PathProgramCache]: Analyzing trace with hash -431804325, now seen corresponding path program 7 times [2018-04-10 13:49:15,895 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:15,895 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:15,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:15,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:15,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:15,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2305 backedges. 1423 proven. 70 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-04-10 13:49:16,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:16,052 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:16,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:16,092 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2305 backedges. 1423 proven. 70 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-04-10 13:49:16,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:16,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-04-10 13:49:16,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-10 13:49:16,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-10 13:49:16,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2018-04-10 13:49:16,176 INFO L87 Difference]: Start difference. First operand 243 states and 247 transitions. Second operand 20 states. [2018-04-10 13:49:16,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:16,278 INFO L93 Difference]: Finished difference Result 254 states and 256 transitions. [2018-04-10 13:49:16,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 13:49:16,278 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 227 [2018-04-10 13:49:16,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:16,279 INFO L225 Difference]: With dead ends: 254 [2018-04-10 13:49:16,280 INFO L226 Difference]: Without dead ends: 248 [2018-04-10 13:49:16,280 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2018-04-10 13:49:16,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-10 13:49:16,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 243. [2018-04-10 13:49:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-04-10 13:49:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 245 transitions. [2018-04-10 13:49:16,285 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 245 transitions. Word has length 227 [2018-04-10 13:49:16,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:16,285 INFO L459 AbstractCegarLoop]: Abstraction has 243 states and 245 transitions. [2018-04-10 13:49:16,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-10 13:49:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 245 transitions. [2018-04-10 13:49:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-04-10 13:49:16,287 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:16,288 INFO L355 BasicCegarLoop]: trace histogram [32, 27, 27, 26, 26, 26, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:16,288 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:16,288 INFO L82 PathProgramCache]: Analyzing trace with hash 944998563, now seen corresponding path program 8 times [2018-04-10 13:49:16,288 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:16,288 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:16,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:16,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:16,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:16,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 875 proven. 114 refuted. 0 times theorem prover too weak. 1480 trivial. 0 not checked. [2018-04-10 13:49:16,651 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:16,651 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:16,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 13:49:16,703 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 13:49:16,703 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:16,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:16,708 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-04-10 13:49:16,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:49:16,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:49:16,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:49:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 875 proven. 92 refuted. 0 times theorem prover too weak. 1502 trivial. 0 not checked. [2018-04-10 13:49:16,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:16,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-04-10 13:49:16,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 13:49:16,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 13:49:16,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2018-04-10 13:49:16,995 INFO L87 Difference]: Start difference. First operand 243 states and 245 transitions. Second operand 21 states. [2018-04-10 13:49:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:17,380 INFO L93 Difference]: Finished difference Result 317 states and 322 transitions. [2018-04-10 13:49:17,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-10 13:49:17,380 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 233 [2018-04-10 13:49:17,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:17,381 INFO L225 Difference]: With dead ends: 317 [2018-04-10 13:49:17,381 INFO L226 Difference]: Without dead ends: 317 [2018-04-10 13:49:17,382 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 213 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=355, Invalid=1051, Unknown=0, NotChecked=0, Total=1406 [2018-04-10 13:49:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-04-10 13:49:17,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 297. [2018-04-10 13:49:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-04-10 13:49:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 301 transitions. [2018-04-10 13:49:17,388 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 301 transitions. Word has length 233 [2018-04-10 13:49:17,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:17,388 INFO L459 AbstractCegarLoop]: Abstraction has 297 states and 301 transitions. [2018-04-10 13:49:17,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 13:49:17,388 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 301 transitions. [2018-04-10 13:49:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-04-10 13:49:17,390 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:17,390 INFO L355 BasicCegarLoop]: trace histogram [40, 34, 34, 33, 33, 33, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:17,390 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:17,390 INFO L82 PathProgramCache]: Analyzing trace with hash 733219996, now seen corresponding path program 9 times [2018-04-10 13:49:17,390 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:17,390 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:17,391 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:17,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:17,391 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:17,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 2257 proven. 102 refuted. 0 times theorem prover too weak. 1559 trivial. 0 not checked. [2018-04-10 13:49:17,678 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:17,679 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:17,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 13:49:17,758 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-10 13:49:17,758 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:17,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3918 backedges. 2051 proven. 382 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-04-10 13:49:17,981 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:17,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 34 [2018-04-10 13:49:17,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 13:49:17,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 13:49:17,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 13:49:17,983 INFO L87 Difference]: Start difference. First operand 297 states and 301 transitions. Second operand 34 states. [2018-04-10 13:49:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:18,508 INFO L93 Difference]: Finished difference Result 316 states and 318 transitions. [2018-04-10 13:49:18,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-10 13:49:18,508 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 287 [2018-04-10 13:49:18,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:18,509 INFO L225 Difference]: With dead ends: 316 [2018-04-10 13:49:18,509 INFO L226 Difference]: Without dead ends: 310 [2018-04-10 13:49:18,510 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=534, Invalid=3006, Unknown=0, NotChecked=0, Total=3540 [2018-04-10 13:49:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-04-10 13:49:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 303. [2018-04-10 13:49:18,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-04-10 13:49:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 305 transitions. [2018-04-10 13:49:18,513 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 305 transitions. Word has length 287 [2018-04-10 13:49:18,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:18,513 INFO L459 AbstractCegarLoop]: Abstraction has 303 states and 305 transitions. [2018-04-10 13:49:18,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 13:49:18,513 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 305 transitions. [2018-04-10 13:49:18,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-04-10 13:49:18,514 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:18,514 INFO L355 BasicCegarLoop]: trace histogram [41, 35, 35, 34, 34, 34, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:18,514 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:18,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1751572516, now seen corresponding path program 10 times [2018-04-10 13:49:18,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:18,515 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:18,515 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:18,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:18,515 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:18,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1344 proven. 154 refuted. 0 times theorem prover too weak. 2634 trivial. 0 not checked. [2018-04-10 13:49:18,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:18,847 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:18,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 13:49:18,898 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 13:49:18,898 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:18,902 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:18,904 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-04-10 13:49:18,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:49:18,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:49:18,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:49:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4132 backedges. 1260 proven. 663 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2018-04-10 13:49:19,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:19,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 23 [2018-04-10 13:49:19,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-10 13:49:19,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-10 13:49:19,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2018-04-10 13:49:19,221 INFO L87 Difference]: Start difference. First operand 303 states and 305 transitions. Second operand 24 states. [2018-04-10 13:49:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:19,492 INFO L93 Difference]: Finished difference Result 317 states and 320 transitions. [2018-04-10 13:49:19,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-10 13:49:19,492 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 293 [2018-04-10 13:49:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:19,493 INFO L225 Difference]: With dead ends: 317 [2018-04-10 13:49:19,493 INFO L226 Difference]: Without dead ends: 317 [2018-04-10 13:49:19,493 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 270 SyntacticMatches, 13 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=225, Invalid=767, Unknown=0, NotChecked=0, Total=992 [2018-04-10 13:49:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-04-10 13:49:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 309. [2018-04-10 13:49:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-04-10 13:49:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 312 transitions. [2018-04-10 13:49:19,496 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 312 transitions. Word has length 293 [2018-04-10 13:49:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:19,497 INFO L459 AbstractCegarLoop]: Abstraction has 309 states and 312 transitions. [2018-04-10 13:49:19,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-10 13:49:19,497 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 312 transitions. [2018-04-10 13:49:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-04-10 13:49:19,497 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:19,498 INFO L355 BasicCegarLoop]: trace histogram [42, 36, 36, 35, 35, 35, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:19,498 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:19,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1671183124, now seen corresponding path program 11 times [2018-04-10 13:49:19,498 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:19,498 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:19,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:19,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:19,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:19,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:19,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1695 proven. 137 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2018-04-10 13:49:19,819 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:19,819 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:19,835 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 13:49:19,935 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-04-10 13:49:19,935 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:19,940 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4352 backedges. 1624 proven. 613 refuted. 0 times theorem prover too weak. 2115 trivial. 0 not checked. [2018-04-10 13:49:20,196 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:20,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24] total 34 [2018-04-10 13:49:20,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 13:49:20,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 13:49:20,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 13:49:20,198 INFO L87 Difference]: Start difference. First operand 309 states and 312 transitions. Second operand 34 states. [2018-04-10 13:49:20,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:20,778 INFO L93 Difference]: Finished difference Result 368 states and 371 transitions. [2018-04-10 13:49:20,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 13:49:20,779 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 299 [2018-04-10 13:49:20,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:20,780 INFO L225 Difference]: With dead ends: 368 [2018-04-10 13:49:20,780 INFO L226 Difference]: Without dead ends: 368 [2018-04-10 13:49:20,780 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=549, Invalid=2001, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 13:49:20,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-04-10 13:49:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 363. [2018-04-10 13:49:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-04-10 13:49:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 366 transitions. [2018-04-10 13:49:20,784 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 366 transitions. Word has length 299 [2018-04-10 13:49:20,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:20,785 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 366 transitions. [2018-04-10 13:49:20,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 13:49:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 366 transitions. [2018-04-10 13:49:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-04-10 13:49:20,786 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:20,786 INFO L355 BasicCegarLoop]: trace histogram [50, 43, 43, 42, 42, 42, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:20,786 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:20,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1483763557, now seen corresponding path program 12 times [2018-04-10 13:49:20,786 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:20,786 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:20,787 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:20,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:20,787 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:20,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6223 backedges. 3357 proven. 140 refuted. 0 times theorem prover too weak. 2726 trivial. 0 not checked. [2018-04-10 13:49:21,141 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:21,141 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-04-10 13:49:21,149 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 13:49:21,250 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-04-10 13:49:21,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:21,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:21,271 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-04-10 13:49:21,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:49:21,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:49:21,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:49:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6223 backedges. 1901 proven. 170 refuted. 0 times theorem prover too weak. 4152 trivial. 0 not checked. [2018-04-10 13:49:21,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:21,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2018-04-10 13:49:21,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-10 13:49:21,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-10 13:49:21,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2018-04-10 13:49:21,907 INFO L87 Difference]: Start difference. First operand 363 states and 366 transitions. Second operand 32 states. [2018-04-10 13:49:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:23,511 INFO L93 Difference]: Finished difference Result 440 states and 442 transitions. [2018-04-10 13:49:23,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-10 13:49:23,511 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 353 [2018-04-10 13:49:23,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:23,512 INFO L225 Difference]: With dead ends: 440 [2018-04-10 13:49:23,512 INFO L226 Difference]: Without dead ends: 431 [2018-04-10 13:49:23,514 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 336 SyntacticMatches, 13 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1497, Invalid=6875, Unknown=0, NotChecked=0, Total=8372 [2018-04-10 13:49:23,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-04-10 13:49:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 423. [2018-04-10 13:49:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-04-10 13:49:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 425 transitions. [2018-04-10 13:49:23,517 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 425 transitions. Word has length 353 [2018-04-10 13:49:23,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:23,518 INFO L459 AbstractCegarLoop]: Abstraction has 423 states and 425 transitions. [2018-04-10 13:49:23,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-10 13:49:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 425 transitions. [2018-04-10 13:49:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-04-10 13:49:23,519 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:23,519 INFO L355 BasicCegarLoop]: trace histogram [60, 52, 52, 51, 51, 51, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:23,519 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:23,519 INFO L82 PathProgramCache]: Analyzing trace with hash -983766034, now seen corresponding path program 13 times [2018-04-10 13:49:23,520 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:23,520 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:23,520 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:23,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:23,520 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:23,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9062 backedges. 4485 proven. 184 refuted. 0 times theorem prover too weak. 4393 trivial. 0 not checked. [2018-04-10 13:49:24,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:24,153 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:24,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:24,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9062 backedges. 4485 proven. 184 refuted. 0 times theorem prover too weak. 4393 trivial. 0 not checked. [2018-04-10 13:49:24,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:24,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2018-04-10 13:49:24,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 13:49:24,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 13:49:24,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-04-10 13:49:24,522 INFO L87 Difference]: Start difference. First operand 423 states and 425 transitions. Second operand 29 states. [2018-04-10 13:49:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:24,901 INFO L93 Difference]: Finished difference Result 448 states and 450 transitions. [2018-04-10 13:49:24,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-10 13:49:24,901 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 419 [2018-04-10 13:49:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:24,902 INFO L225 Difference]: With dead ends: 448 [2018-04-10 13:49:24,903 INFO L226 Difference]: Without dead ends: 442 [2018-04-10 13:49:24,903 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=306, Invalid=954, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 13:49:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-04-10 13:49:24,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 433. [2018-04-10 13:49:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-10 13:49:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 435 transitions. [2018-04-10 13:49:24,907 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 435 transitions. Word has length 419 [2018-04-10 13:49:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:24,907 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 435 transitions. [2018-04-10 13:49:24,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-10 13:49:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 435 transitions. [2018-04-10 13:49:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-04-10 13:49:24,908 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:24,909 INFO L355 BasicCegarLoop]: trace histogram [61, 53, 53, 52, 52, 52, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:24,909 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:24,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1494870518, now seen corresponding path program 14 times [2018-04-10 13:49:24,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:24,909 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:24,909 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:24,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:24,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:24,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9388 backedges. 2440 proven. 200 refuted. 0 times theorem prover too weak. 6748 trivial. 0 not checked. [2018-04-10 13:49:25,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:25,410 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:25,422 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 13:49:25,521 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 13:49:25,521 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:25,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:25,532 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-04-10 13:49:25,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:49:25,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:49:25,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:49:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 9388 backedges. 2440 proven. 200 refuted. 0 times theorem prover too weak. 6748 trivial. 0 not checked. [2018-04-10 13:49:25,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:25,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 15 [2018-04-10 13:49:25,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-10 13:49:25,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-10 13:49:25,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-04-10 13:49:25,944 INFO L87 Difference]: Start difference. First operand 433 states and 435 transitions. Second operand 16 states. [2018-04-10 13:49:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:26,222 INFO L93 Difference]: Finished difference Result 441 states and 443 transitions. [2018-04-10 13:49:26,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-10 13:49:26,225 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 425 [2018-04-10 13:49:26,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:26,227 INFO L225 Difference]: With dead ends: 441 [2018-04-10 13:49:26,227 INFO L226 Difference]: Without dead ends: 441 [2018-04-10 13:49:26,228 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 406 SyntacticMatches, 18 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=216, Invalid=384, Unknown=0, NotChecked=0, Total=600 [2018-04-10 13:49:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-04-10 13:49:26,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 435. [2018-04-10 13:49:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-10 13:49:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 437 transitions. [2018-04-10 13:49:26,234 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 437 transitions. Word has length 425 [2018-04-10 13:49:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:26,234 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 437 transitions. [2018-04-10 13:49:26,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-10 13:49:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 437 transitions. [2018-04-10 13:49:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-04-10 13:49:26,237 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:26,237 INFO L355 BasicCegarLoop]: trace histogram [62, 54, 54, 53, 53, 53, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:26,237 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:26,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2009639230, now seen corresponding path program 15 times [2018-04-10 13:49:26,237 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:26,237 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:26,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:26,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:26,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:26,269 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 2720 proven. 252 refuted. 0 times theorem prover too weak. 6748 trivial. 0 not checked. [2018-04-10 13:49:27,044 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:27,044 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:27,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 13:49:27,182 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-10 13:49:27,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:27,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:27,190 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-04-10 13:49:27,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:49:27,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:49:27,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:49:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9720 backedges. 2720 proven. 252 refuted. 0 times theorem prover too weak. 6748 trivial. 0 not checked. [2018-04-10 13:49:27,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:27,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 16 [2018-04-10 13:49:27,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 13:49:27,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 13:49:27,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-04-10 13:49:27,652 INFO L87 Difference]: Start difference. First operand 435 states and 437 transitions. Second operand 17 states. [2018-04-10 13:49:27,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:27,860 INFO L93 Difference]: Finished difference Result 459 states and 463 transitions. [2018-04-10 13:49:27,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-10 13:49:27,861 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 431 [2018-04-10 13:49:27,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:27,862 INFO L225 Difference]: With dead ends: 459 [2018-04-10 13:49:27,863 INFO L226 Difference]: Without dead ends: 459 [2018-04-10 13:49:27,863 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 412 SyntacticMatches, 18 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=449, Unknown=0, NotChecked=0, Total=702 [2018-04-10 13:49:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-04-10 13:49:27,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 441. [2018-04-10 13:49:27,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-04-10 13:49:27,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 444 transitions. [2018-04-10 13:49:27,869 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 444 transitions. Word has length 431 [2018-04-10 13:49:27,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:27,870 INFO L459 AbstractCegarLoop]: Abstraction has 441 states and 444 transitions. [2018-04-10 13:49:27,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 13:49:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 444 transitions. [2018-04-10 13:49:27,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-04-10 13:49:27,872 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:27,872 INFO L355 BasicCegarLoop]: trace histogram [63, 55, 55, 54, 54, 54, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:27,872 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:27,873 INFO L82 PathProgramCache]: Analyzing trace with hash 49074822, now seen corresponding path program 16 times [2018-04-10 13:49:27,873 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:27,873 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:27,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:27,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:27,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:27,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10058 backedges. 3281 proven. 229 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-04-10 13:49:28,444 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:28,444 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:28,450 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 13:49:28,524 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 13:49:28,524 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:28,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10058 backedges. 3310 proven. 200 refuted. 0 times theorem prover too weak. 6548 trivial. 0 not checked. [2018-04-10 13:49:28,831 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:28,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 36 [2018-04-10 13:49:28,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-10 13:49:28,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-10 13:49:28,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=959, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 13:49:28,832 INFO L87 Difference]: Start difference. First operand 441 states and 444 transitions. Second operand 36 states. [2018-04-10 13:49:29,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:29,410 INFO L93 Difference]: Finished difference Result 527 states and 531 transitions. [2018-04-10 13:49:29,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 13:49:29,410 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 437 [2018-04-10 13:49:29,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:29,412 INFO L225 Difference]: With dead ends: 527 [2018-04-10 13:49:29,412 INFO L226 Difference]: Without dead ends: 527 [2018-04-10 13:49:29,413 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=792, Invalid=2178, Unknown=0, NotChecked=0, Total=2970 [2018-04-10 13:49:29,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-04-10 13:49:29,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 519. [2018-04-10 13:49:29,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2018-04-10 13:49:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 523 transitions. [2018-04-10 13:49:29,420 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 523 transitions. Word has length 437 [2018-04-10 13:49:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:29,420 INFO L459 AbstractCegarLoop]: Abstraction has 519 states and 523 transitions. [2018-04-10 13:49:29,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-10 13:49:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 523 transitions. [2018-04-10 13:49:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-04-10 13:49:29,423 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:29,424 INFO L355 BasicCegarLoop]: trace histogram [73, 64, 64, 63, 63, 63, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:29,424 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:29,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1416226959, now seen corresponding path program 17 times [2018-04-10 13:49:29,424 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:29,424 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:29,425 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:29,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:29,425 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:29,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 13599 backedges. 3599 proven. 310 refuted. 0 times theorem prover too weak. 9690 trivial. 0 not checked. [2018-04-10 13:49:30,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:30,328 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:30,333 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 13:49:30,499 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-10 13:49:30,499 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:30,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:30,883 INFO L134 CoverageAnalysis]: Checked inductivity of 13599 backedges. 6365 proven. 1285 refuted. 0 times theorem prover too weak. 5949 trivial. 0 not checked. [2018-04-10 13:49:30,901 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:30,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26] total 40 [2018-04-10 13:49:30,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-10 13:49:30,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-10 13:49:30,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1347, Unknown=0, NotChecked=0, Total=1560 [2018-04-10 13:49:30,902 INFO L87 Difference]: Start difference. First operand 519 states and 523 transitions. Second operand 40 states. [2018-04-10 13:49:32,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:32,040 INFO L93 Difference]: Finished difference Result 539 states and 542 transitions. [2018-04-10 13:49:32,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-10 13:49:32,040 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 503 [2018-04-10 13:49:32,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:32,043 INFO L225 Difference]: With dead ends: 539 [2018-04-10 13:49:32,043 INFO L226 Difference]: Without dead ends: 533 [2018-04-10 13:49:32,044 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 480 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=898, Invalid=4214, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 13:49:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-04-10 13:49:32,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 525. [2018-04-10 13:49:32,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-04-10 13:49:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 528 transitions. [2018-04-10 13:49:32,050 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 528 transitions. Word has length 503 [2018-04-10 13:49:32,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:32,050 INFO L459 AbstractCegarLoop]: Abstraction has 525 states and 528 transitions. [2018-04-10 13:49:32,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-10 13:49:32,051 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 528 transitions. [2018-04-10 13:49:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-04-10 13:49:32,056 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:32,056 INFO L355 BasicCegarLoop]: trace histogram [75, 66, 66, 65, 65, 65, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:32,056 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:32,056 INFO L82 PathProgramCache]: Analyzing trace with hash 874224735, now seen corresponding path program 18 times [2018-04-10 13:49:32,056 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:32,056 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:32,057 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:32,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:32,057 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:32,099 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14405 backedges. 4005 proven. 374 refuted. 0 times theorem prover too weak. 10026 trivial. 0 not checked. [2018-04-10 13:49:32,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:32,782 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:32,787 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 13:49:32,943 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-04-10 13:49:32,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:32,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:32,963 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-04-10 13:49:32,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:49:32,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:49:32,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:49:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 14405 backedges. 4005 proven. 274 refuted. 0 times theorem prover too weak. 10126 trivial. 0 not checked. [2018-04-10 13:49:33,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:33,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2018-04-10 13:49:33,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-10 13:49:33,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-10 13:49:33,818 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2018-04-10 13:49:33,818 INFO L87 Difference]: Start difference. First operand 525 states and 528 transitions. Second operand 31 states. [2018-04-10 13:49:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:34,611 INFO L93 Difference]: Finished difference Result 627 states and 633 transitions. [2018-04-10 13:49:34,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 13:49:34,612 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 515 [2018-04-10 13:49:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:34,613 INFO L225 Difference]: With dead ends: 627 [2018-04-10 13:49:34,613 INFO L226 Difference]: Without dead ends: 627 [2018-04-10 13:49:34,613 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 482 SyntacticMatches, 20 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=790, Invalid=2402, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 13:49:34,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2018-04-10 13:49:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 603. [2018-04-10 13:49:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-04-10 13:49:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 608 transitions. [2018-04-10 13:49:34,620 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 608 transitions. Word has length 515 [2018-04-10 13:49:34,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:34,620 INFO L459 AbstractCegarLoop]: Abstraction has 603 states and 608 transitions. [2018-04-10 13:49:34,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-10 13:49:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 608 transitions. [2018-04-10 13:49:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2018-04-10 13:49:34,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:34,624 INFO L355 BasicCegarLoop]: trace histogram [87, 77, 77, 76, 76, 76, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:34,625 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:34,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1350141368, now seen corresponding path program 19 times [2018-04-10 13:49:34,625 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:34,625 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:34,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:34,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:34,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:34,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:34,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 19534 backedges. 9017 proven. 290 refuted. 0 times theorem prover too weak. 10227 trivial. 0 not checked. [2018-04-10 13:49:35,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:35,427 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:35,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:35,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:35,919 INFO L134 CoverageAnalysis]: Checked inductivity of 19534 backedges. 9017 proven. 290 refuted. 0 times theorem prover too weak. 10227 trivial. 0 not checked. [2018-04-10 13:49:35,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:35,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 35 [2018-04-10 13:49:35,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-10 13:49:35,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-10 13:49:35,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 13:49:35,938 INFO L87 Difference]: Start difference. First operand 603 states and 608 transitions. Second operand 35 states. [2018-04-10 13:49:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:36,143 INFO L93 Difference]: Finished difference Result 622 states and 626 transitions. [2018-04-10 13:49:36,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-10 13:49:36,144 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 593 [2018-04-10 13:49:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:36,145 INFO L225 Difference]: With dead ends: 622 [2018-04-10 13:49:36,146 INFO L226 Difference]: Without dead ends: 616 [2018-04-10 13:49:36,146 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=451, Invalid=1441, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 13:49:36,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-04-10 13:49:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 609. [2018-04-10 13:49:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-04-10 13:49:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 613 transitions. [2018-04-10 13:49:36,151 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 613 transitions. Word has length 593 [2018-04-10 13:49:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:36,151 INFO L459 AbstractCegarLoop]: Abstraction has 609 states and 613 transitions. [2018-04-10 13:49:36,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-10 13:49:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 613 transitions. [2018-04-10 13:49:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-04-10 13:49:36,153 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:36,154 INFO L355 BasicCegarLoop]: trace histogram [88, 78, 78, 77, 77, 77, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:36,154 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:36,154 INFO L82 PathProgramCache]: Analyzing trace with hash -46382016, now seen corresponding path program 20 times [2018-04-10 13:49:36,154 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:36,154 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:36,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:36,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:36,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:36,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 20014 backedges. 5619 proven. 345 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-04-10 13:49:36,988 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:36,988 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:36,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 13:49:37,081 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 13:49:37,081 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:37,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 20014 backedges. 5584 proven. 380 refuted. 0 times theorem prover too weak. 14050 trivial. 0 not checked. [2018-04-10 13:49:37,808 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:37,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 56 [2018-04-10 13:49:37,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-04-10 13:49:37,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-04-10 13:49:37,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=2548, Unknown=0, NotChecked=0, Total=3080 [2018-04-10 13:49:37,810 INFO L87 Difference]: Start difference. First operand 609 states and 613 transitions. Second operand 56 states. [2018-04-10 13:49:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:38,627 INFO L93 Difference]: Finished difference Result 710 states and 715 transitions. [2018-04-10 13:49:38,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-10 13:49:38,627 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 599 [2018-04-10 13:49:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:38,629 INFO L225 Difference]: With dead ends: 710 [2018-04-10 13:49:38,629 INFO L226 Difference]: Without dead ends: 710 [2018-04-10 13:49:38,631 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 572 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1310, Invalid=5170, Unknown=0, NotChecked=0, Total=6480 [2018-04-10 13:49:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-04-10 13:49:38,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 699. [2018-04-10 13:49:38,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-04-10 13:49:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 704 transitions. [2018-04-10 13:49:38,640 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 704 transitions. Word has length 599 [2018-04-10 13:49:38,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:38,640 INFO L459 AbstractCegarLoop]: Abstraction has 699 states and 704 transitions. [2018-04-10 13:49:38,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-04-10 13:49:38,640 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 704 transitions. [2018-04-10 13:49:38,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2018-04-10 13:49:38,644 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:38,645 INFO L355 BasicCegarLoop]: trace histogram [100, 89, 89, 88, 88, 88, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:38,645 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:38,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1742682151, now seen corresponding path program 21 times [2018-04-10 13:49:38,645 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:38,645 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:38,646 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:38,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:38,646 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:38,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 25993 backedges. 14286 proven. 1218 refuted. 0 times theorem prover too weak. 10489 trivial. 0 not checked. [2018-04-10 13:49:39,753 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:39,753 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:39,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 13:49:39,892 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-04-10 13:49:39,892 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:39,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 25993 backedges. 10431 proven. 1192 refuted. 0 times theorem prover too weak. 14370 trivial. 0 not checked. [2018-04-10 13:49:40,451 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:40,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 58 [2018-04-10 13:49:40,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-10 13:49:40,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-10 13:49:40,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=2836, Unknown=0, NotChecked=0, Total=3306 [2018-04-10 13:49:40,452 INFO L87 Difference]: Start difference. First operand 699 states and 704 transitions. Second operand 58 states. [2018-04-10 13:49:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:42,174 INFO L93 Difference]: Finished difference Result 799 states and 803 transitions. [2018-04-10 13:49:42,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-10 13:49:42,174 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 677 [2018-04-10 13:49:42,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:42,176 INFO L225 Difference]: With dead ends: 799 [2018-04-10 13:49:42,176 INFO L226 Difference]: Without dead ends: 793 [2018-04-10 13:49:42,177 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3673 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1946, Invalid=10264, Unknown=0, NotChecked=0, Total=12210 [2018-04-10 13:49:42,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2018-04-10 13:49:42,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 699. [2018-04-10 13:49:42,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2018-04-10 13:49:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 702 transitions. [2018-04-10 13:49:42,181 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 702 transitions. Word has length 677 [2018-04-10 13:49:42,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:42,182 INFO L459 AbstractCegarLoop]: Abstraction has 699 states and 702 transitions. [2018-04-10 13:49:42,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-10 13:49:42,182 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 702 transitions. [2018-04-10 13:49:42,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2018-04-10 13:49:42,184 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:42,185 INFO L355 BasicCegarLoop]: trace histogram [101, 90, 90, 89, 89, 89, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:42,185 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:42,185 INFO L82 PathProgramCache]: Analyzing trace with hash -661149279, now seen corresponding path program 22 times [2018-04-10 13:49:42,185 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:42,185 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:42,185 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:42,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:42,185 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:42,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 26547 backedges. 6149 proven. 444 refuted. 0 times theorem prover too weak. 19954 trivial. 0 not checked. [2018-04-10 13:49:43,260 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:43,260 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:43,265 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 13:49:43,380 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 13:49:43,380 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:43,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:43,388 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-04-10 13:49:43,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:49:43,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:49:43,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:49:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 26547 backedges. 6015 proven. 1768 refuted. 0 times theorem prover too weak. 18764 trivial. 0 not checked. [2018-04-10 13:49:44,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:44,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 33 [2018-04-10 13:49:44,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-10 13:49:44,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-10 13:49:44,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=854, Unknown=0, NotChecked=0, Total=1122 [2018-04-10 13:49:44,521 INFO L87 Difference]: Start difference. First operand 699 states and 702 transitions. Second operand 34 states. [2018-04-10 13:49:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:45,012 INFO L93 Difference]: Finished difference Result 716 states and 720 transitions. [2018-04-10 13:49:45,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-10 13:49:45,012 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 683 [2018-04-10 13:49:45,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:45,014 INFO L225 Difference]: With dead ends: 716 [2018-04-10 13:49:45,014 INFO L226 Difference]: Without dead ends: 716 [2018-04-10 13:49:45,014 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 645 SyntacticMatches, 23 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=450, Invalid=1712, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 13:49:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-04-10 13:49:45,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 705. [2018-04-10 13:49:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-04-10 13:49:45,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 709 transitions. [2018-04-10 13:49:45,020 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 709 transitions. Word has length 683 [2018-04-10 13:49:45,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:45,020 INFO L459 AbstractCegarLoop]: Abstraction has 705 states and 709 transitions. [2018-04-10 13:49:45,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-10 13:49:45,020 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 709 transitions. [2018-04-10 13:49:45,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-04-10 13:49:45,025 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:45,025 INFO L355 BasicCegarLoop]: trace histogram [102, 91, 91, 90, 90, 90, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:45,025 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:45,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1048265559, now seen corresponding path program 23 times [2018-04-10 13:49:45,026 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:45,026 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:45,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:45,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:45,027 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:45,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 27107 backedges. 7115 proven. 412 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-04-10 13:49:45,922 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:45,923 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:45,928 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 13:49:46,157 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2018-04-10 13:49:46,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:46,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 27107 backedges. 7153 proven. 374 refuted. 0 times theorem prover too weak. 19580 trivial. 0 not checked. [2018-04-10 13:49:46,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:46,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 45 [2018-04-10 13:49:46,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-10 13:49:46,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-10 13:49:46,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=1514, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 13:49:46,650 INFO L87 Difference]: Start difference. First operand 705 states and 709 transitions. Second operand 45 states. [2018-04-10 13:49:47,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:47,406 INFO L93 Difference]: Finished difference Result 806 states and 811 transitions. [2018-04-10 13:49:47,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-10 13:49:47,406 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 689 [2018-04-10 13:49:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:47,408 INFO L225 Difference]: With dead ends: 806 [2018-04-10 13:49:47,408 INFO L226 Difference]: Without dead ends: 806 [2018-04-10 13:49:47,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1263, Invalid=3567, Unknown=0, NotChecked=0, Total=4830 [2018-04-10 13:49:47,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-04-10 13:49:47,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 795. [2018-04-10 13:49:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-04-10 13:49:47,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 800 transitions. [2018-04-10 13:49:47,416 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 800 transitions. Word has length 689 [2018-04-10 13:49:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:47,417 INFO L459 AbstractCegarLoop]: Abstraction has 795 states and 800 transitions. [2018-04-10 13:49:47,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-10 13:49:47,417 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 800 transitions. [2018-04-10 13:49:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2018-04-10 13:49:47,422 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:47,423 INFO L355 BasicCegarLoop]: trace histogram [115, 103, 103, 102, 102, 102, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:47,423 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:47,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1462874826, now seen corresponding path program 24 times [2018-04-10 13:49:47,423 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:47,423 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:47,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:47,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:47,424 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:47,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 34638 backedges. 17188 proven. 2197 refuted. 0 times theorem prover too weak. 15253 trivial. 0 not checked. [2018-04-10 13:49:48,599 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:48,599 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:48,604 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 13:49:48,836 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-04-10 13:49:48,836 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:48,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:48,844 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-04-10 13:49:48,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:49:48,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:49:48,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:49:50,240 INFO L134 CoverageAnalysis]: Checked inductivity of 34638 backedges. 7646 proven. 470 refuted. 0 times theorem prover too weak. 26522 trivial. 0 not checked. [2018-04-10 13:49:50,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:50,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 20] total 51 [2018-04-10 13:49:50,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-10 13:49:50,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-10 13:49:50,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=2205, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 13:49:50,259 INFO L87 Difference]: Start difference. First operand 795 states and 800 transitions. Second operand 51 states. [2018-04-10 13:49:52,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:52,396 INFO L93 Difference]: Finished difference Result 914 states and 919 transitions. [2018-04-10 13:49:52,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-04-10 13:49:52,397 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 773 [2018-04-10 13:49:52,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:52,398 INFO L225 Difference]: With dead ends: 914 [2018-04-10 13:49:52,398 INFO L226 Difference]: Without dead ends: 905 [2018-04-10 13:49:52,399 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 869 GetRequests, 733 SyntacticMatches, 23 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4692 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1823, Invalid=11287, Unknown=0, NotChecked=0, Total=13110 [2018-04-10 13:49:52,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-04-10 13:49:52,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 885. [2018-04-10 13:49:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2018-04-10 13:49:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 889 transitions. [2018-04-10 13:49:52,404 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 889 transitions. Word has length 773 [2018-04-10 13:49:52,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:52,404 INFO L459 AbstractCegarLoop]: Abstraction has 885 states and 889 transitions. [2018-04-10 13:49:52,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-10 13:49:52,404 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 889 transitions. [2018-04-10 13:49:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2018-04-10 13:49:52,408 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:52,408 INFO L355 BasicCegarLoop]: trace histogram [130, 117, 117, 116, 116, 116, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:52,408 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:52,408 INFO L82 PathProgramCache]: Analyzing trace with hash 593559995, now seen corresponding path program 25 times [2018-04-10 13:49:52,408 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:52,408 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:52,409 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:52,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:52,409 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:52,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 44527 backedges. 19928 proven. 3250 refuted. 0 times theorem prover too weak. 21349 trivial. 0 not checked. [2018-04-10 13:49:53,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:53,836 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:53,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:53,967 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 44527 backedges. 16915 proven. 494 refuted. 0 times theorem prover too weak. 27118 trivial. 0 not checked. [2018-04-10 13:49:54,487 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:54,487 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30] total 57 [2018-04-10 13:49:54,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-10 13:49:54,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-10 13:49:54,488 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=2648, Unknown=0, NotChecked=0, Total=3192 [2018-04-10 13:49:54,488 INFO L87 Difference]: Start difference. First operand 885 states and 889 transitions. Second operand 57 states. [2018-04-10 13:49:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:55,749 INFO L93 Difference]: Finished difference Result 916 states and 920 transitions. [2018-04-10 13:49:55,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-10 13:49:55,749 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 869 [2018-04-10 13:49:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:55,751 INFO L225 Difference]: With dead ends: 916 [2018-04-10 13:49:55,751 INFO L226 Difference]: Without dead ends: 910 [2018-04-10 13:49:55,752 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 942 GetRequests, 849 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2757 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1566, Invalid=7364, Unknown=0, NotChecked=0, Total=8930 [2018-04-10 13:49:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2018-04-10 13:49:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 895. [2018-04-10 13:49:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-04-10 13:49:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 899 transitions. [2018-04-10 13:49:55,757 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 899 transitions. Word has length 869 [2018-04-10 13:49:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:55,758 INFO L459 AbstractCegarLoop]: Abstraction has 895 states and 899 transitions. [2018-04-10 13:49:55,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-10 13:49:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 899 transitions. [2018-04-10 13:49:55,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 876 [2018-04-10 13:49:55,761 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:55,762 INFO L355 BasicCegarLoop]: trace histogram [131, 118, 118, 117, 117, 117, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:55,762 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:55,762 INFO L82 PathProgramCache]: Analyzing trace with hash -753671677, now seen corresponding path program 26 times [2018-04-10 13:49:55,762 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:55,762 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:55,763 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:55,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:49:55,763 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:55,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:57,085 INFO L134 CoverageAnalysis]: Checked inductivity of 45253 backedges. 8905 proven. 520 refuted. 0 times theorem prover too weak. 35828 trivial. 0 not checked. [2018-04-10 13:49:57,085 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:57,085 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:57,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 13:49:57,209 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 13:49:57,209 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:49:57,217 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:49:57,218 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-04-10 13:49:57,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:49:57,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:49:57,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:49:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 45253 backedges. 8905 proven. 520 refuted. 0 times theorem prover too weak. 35828 trivial. 0 not checked. [2018-04-10 13:49:58,124 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:49:58,124 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 20 [2018-04-10 13:49:58,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-10 13:49:58,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-10 13:49:58,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=256, Unknown=0, NotChecked=0, Total=420 [2018-04-10 13:49:58,125 INFO L87 Difference]: Start difference. First operand 895 states and 899 transitions. Second operand 21 states. [2018-04-10 13:49:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:49:58,416 INFO L93 Difference]: Finished difference Result 909 states and 913 transitions. [2018-04-10 13:49:58,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 13:49:58,416 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 875 [2018-04-10 13:49:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:49:58,418 INFO L225 Difference]: With dead ends: 909 [2018-04-10 13:49:58,418 INFO L226 Difference]: Without dead ends: 909 [2018-04-10 13:49:58,418 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 907 GetRequests, 846 SyntacticMatches, 28 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=431, Invalid=759, Unknown=0, NotChecked=0, Total=1190 [2018-04-10 13:49:58,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2018-04-10 13:49:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 897. [2018-04-10 13:49:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2018-04-10 13:49:58,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 901 transitions. [2018-04-10 13:49:58,424 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 901 transitions. Word has length 875 [2018-04-10 13:49:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:49:58,424 INFO L459 AbstractCegarLoop]: Abstraction has 897 states and 901 transitions. [2018-04-10 13:49:58,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-10 13:49:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 901 transitions. [2018-04-10 13:49:58,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2018-04-10 13:49:58,428 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:49:58,428 INFO L355 BasicCegarLoop]: trace histogram [132, 119, 119, 118, 118, 118, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:49:58,428 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:49:58,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1944476789, now seen corresponding path program 27 times [2018-04-10 13:49:58,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:49:58,428 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:49:58,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:58,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:49:58,429 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:49:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:49:58,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:49:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 45985 backedges. 9555 proven. 602 refuted. 0 times theorem prover too weak. 35828 trivial. 0 not checked. [2018-04-10 13:49:59,776 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:49:59,776 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:49:59,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 13:49:59,997 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-04-10 13:49:59,997 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:50:00,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:50:00,005 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-04-10 13:50:00,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:50:00,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:50:00,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:50:00,901 INFO L134 CoverageAnalysis]: Checked inductivity of 45985 backedges. 9555 proven. 602 refuted. 0 times theorem prover too weak. 35828 trivial. 0 not checked. [2018-04-10 13:50:00,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:50:00,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 21 [2018-04-10 13:50:00,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-10 13:50:00,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-10 13:50:00,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=280, Unknown=0, NotChecked=0, Total=462 [2018-04-10 13:50:00,919 INFO L87 Difference]: Start difference. First operand 897 states and 901 transitions. Second operand 22 states. [2018-04-10 13:50:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:50:01,246 INFO L93 Difference]: Finished difference Result 927 states and 933 transitions. [2018-04-10 13:50:01,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-10 13:50:01,247 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 881 [2018-04-10 13:50:01,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:50:01,248 INFO L225 Difference]: With dead ends: 927 [2018-04-10 13:50:01,248 INFO L226 Difference]: Without dead ends: 927 [2018-04-10 13:50:01,249 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 915 GetRequests, 852 SyntacticMatches, 28 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=483, Invalid=849, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 13:50:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2018-04-10 13:50:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 903. [2018-04-10 13:50:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-04-10 13:50:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 908 transitions. [2018-04-10 13:50:01,254 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 908 transitions. Word has length 881 [2018-04-10 13:50:01,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:50:01,254 INFO L459 AbstractCegarLoop]: Abstraction has 903 states and 908 transitions. [2018-04-10 13:50:01,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-10 13:50:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 908 transitions. [2018-04-10 13:50:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2018-04-10 13:50:01,260 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:50:01,261 INFO L355 BasicCegarLoop]: trace histogram [133, 120, 120, 119, 119, 119, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:50:01,261 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:50:01,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1515855635, now seen corresponding path program 28 times [2018-04-10 13:50:01,261 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:50:01,261 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:50:01,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:01,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:50:01,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:50:01,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:50:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 46723 backedges. 10851 proven. 564 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-04-10 13:50:02,712 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:50:02,712 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:50:02,718 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 13:50:02,822 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 13:50:02,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:50:02,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:50:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 46723 backedges. 10895 proven. 520 refuted. 0 times theorem prover too weak. 35308 trivial. 0 not checked. [2018-04-10 13:50:03,320 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:50:03,320 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 51 [2018-04-10 13:50:03,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-10 13:50:03,321 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-10 13:50:03,321 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=1954, Unknown=0, NotChecked=0, Total=2550 [2018-04-10 13:50:03,321 INFO L87 Difference]: Start difference. First operand 903 states and 908 transitions. Second operand 51 states. [2018-04-10 13:50:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:50:04,145 INFO L93 Difference]: Finished difference Result 1025 states and 1031 transitions. [2018-04-10 13:50:04,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-10 13:50:04,145 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 887 [2018-04-10 13:50:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:50:04,147 INFO L225 Difference]: With dead ends: 1025 [2018-04-10 13:50:04,147 INFO L226 Difference]: Without dead ends: 1025 [2018-04-10 13:50:04,147 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 949 GetRequests, 871 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1637, Invalid=4683, Unknown=0, NotChecked=0, Total=6320 [2018-04-10 13:50:04,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-04-10 13:50:04,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1011. [2018-04-10 13:50:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-04-10 13:50:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1017 transitions. [2018-04-10 13:50:04,153 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1017 transitions. Word has length 887 [2018-04-10 13:50:04,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:50:04,154 INFO L459 AbstractCegarLoop]: Abstraction has 1011 states and 1017 transitions. [2018-04-10 13:50:04,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-10 13:50:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1017 transitions. [2018-04-10 13:50:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2018-04-10 13:50:04,158 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:50:04,159 INFO L355 BasicCegarLoop]: trace histogram [148, 134, 134, 133, 133, 133, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:50:04,159 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:50:04,159 INFO L82 PathProgramCache]: Analyzing trace with hash 951248836, now seen corresponding path program 29 times [2018-04-10 13:50:04,159 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:50:04,159 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:50:04,160 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:04,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:50:04,160 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:50:04,197 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:50:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 58114 backedges. 24474 proven. 4377 refuted. 0 times theorem prover too weak. 29263 trivial. 0 not checked. [2018-04-10 13:50:05,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:50:05,877 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:50:05,882 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 13:50:06,356 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-10 13:50:06,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:50:06,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:50:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 58114 backedges. 21295 proven. 2980 refuted. 0 times theorem prover too weak. 33839 trivial. 0 not checked. [2018-04-10 13:50:07,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:50:07,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 63 [2018-04-10 13:50:07,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-10 13:50:07,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-10 13:50:07,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=3293, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 13:50:07,019 INFO L87 Difference]: Start difference. First operand 1011 states and 1017 transitions. Second operand 63 states. [2018-04-10 13:50:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:50:08,309 INFO L93 Difference]: Finished difference Result 1028 states and 1032 transitions. [2018-04-10 13:50:08,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-10 13:50:08,310 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 983 [2018-04-10 13:50:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:50:08,312 INFO L225 Difference]: With dead ends: 1028 [2018-04-10 13:50:08,312 INFO L226 Difference]: Without dead ends: 1022 [2018-04-10 13:50:08,312 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1062 GetRequests, 958 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3379 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2021, Invalid=9109, Unknown=0, NotChecked=0, Total=11130 [2018-04-10 13:50:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2018-04-10 13:50:08,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1011. [2018-04-10 13:50:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-04-10 13:50:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1015 transitions. [2018-04-10 13:50:08,318 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1015 transitions. Word has length 983 [2018-04-10 13:50:08,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:50:08,318 INFO L459 AbstractCegarLoop]: Abstraction has 1011 states and 1015 transitions. [2018-04-10 13:50:08,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-10 13:50:08,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1015 transitions. [2018-04-10 13:50:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 990 [2018-04-10 13:50:08,323 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:50:08,323 INFO L355 BasicCegarLoop]: trace histogram [149, 135, 135, 134, 134, 134, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:50:08,323 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:50:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1557282124, now seen corresponding path program 30 times [2018-04-10 13:50:08,324 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:50:08,324 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:50:08,324 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:08,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:50:08,324 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:50:08,363 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:50:09,958 INFO L134 CoverageAnalysis]: Checked inductivity of 58944 backedges. 11648 proven. 690 refuted. 0 times theorem prover too weak. 46606 trivial. 0 not checked. [2018-04-10 13:50:09,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:50:09,958 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:50:09,963 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 13:50:10,357 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2018-04-10 13:50:10,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:50:10,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:50:10,371 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-04-10 13:50:10,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:50:10,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:50:10,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:50:11,841 INFO L134 CoverageAnalysis]: Checked inductivity of 58944 backedges. 11648 proven. 632 refuted. 0 times theorem prover too weak. 46664 trivial. 0 not checked. [2018-04-10 13:50:11,864 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:50:11,865 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 38 [2018-04-10 13:50:11,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-10 13:50:11,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-10 13:50:11,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=1128, Unknown=0, NotChecked=0, Total=1482 [2018-04-10 13:50:11,865 INFO L87 Difference]: Start difference. First operand 1011 states and 1015 transitions. Second operand 39 states. [2018-04-10 13:50:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:50:12,801 INFO L93 Difference]: Finished difference Result 1145 states and 1152 transitions. [2018-04-10 13:50:12,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-10 13:50:12,801 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 989 [2018-04-10 13:50:12,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:50:12,804 INFO L225 Difference]: With dead ends: 1145 [2018-04-10 13:50:12,804 INFO L226 Difference]: Without dead ends: 1145 [2018-04-10 13:50:12,804 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 942 SyntacticMatches, 30 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2035 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1264, Invalid=4138, Unknown=0, NotChecked=0, Total=5402 [2018-04-10 13:50:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2018-04-10 13:50:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1119. [2018-04-10 13:50:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2018-04-10 13:50:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1125 transitions. [2018-04-10 13:50:12,809 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1125 transitions. Word has length 989 [2018-04-10 13:50:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:50:12,810 INFO L459 AbstractCegarLoop]: Abstraction has 1119 states and 1125 transitions. [2018-04-10 13:50:12,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-10 13:50:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1125 transitions. [2018-04-10 13:50:12,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1098 [2018-04-10 13:50:12,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:50:12,815 INFO L355 BasicCegarLoop]: trace histogram [166, 151, 151, 150, 150, 150, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:50:12,815 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:50:12,816 INFO L82 PathProgramCache]: Analyzing trace with hash 890947789, now seen corresponding path program 31 times [2018-04-10 13:50:12,816 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:50:12,816 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:50:12,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:12,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:50:12,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:50:12,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:50:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 73515 backedges. 28930 proven. 5578 refuted. 0 times theorem prover too weak. 39007 trivial. 0 not checked. [2018-04-10 13:50:14,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:50:14,977 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:50:14,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:50:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:50:15,130 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:50:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 73515 backedges. 26053 proven. 660 refuted. 0 times theorem prover too weak. 46802 trivial. 0 not checked. [2018-04-10 13:50:15,765 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:50:15,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 34] total 63 [2018-04-10 13:50:15,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-10 13:50:15,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-10 13:50:15,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=3232, Unknown=0, NotChecked=0, Total=3906 [2018-04-10 13:50:15,767 INFO L87 Difference]: Start difference. First operand 1119 states and 1125 transitions. Second operand 63 states. [2018-04-10 13:50:17,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:50:17,075 INFO L93 Difference]: Finished difference Result 1146 states and 1151 transitions. [2018-04-10 13:50:17,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-10 13:50:17,075 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 1097 [2018-04-10 13:50:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:50:17,077 INFO L225 Difference]: With dead ends: 1146 [2018-04-10 13:50:17,077 INFO L226 Difference]: Without dead ends: 1140 [2018-04-10 13:50:17,078 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1177 GetRequests, 1074 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3452 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1947, Invalid=8973, Unknown=0, NotChecked=0, Total=10920 [2018-04-10 13:50:17,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2018-04-10 13:50:17,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1125. [2018-04-10 13:50:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2018-04-10 13:50:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1130 transitions. [2018-04-10 13:50:17,083 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1130 transitions. Word has length 1097 [2018-04-10 13:50:17,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:50:17,083 INFO L459 AbstractCegarLoop]: Abstraction has 1125 states and 1130 transitions. [2018-04-10 13:50:17,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-10 13:50:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1130 transitions. [2018-04-10 13:50:17,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1104 [2018-04-10 13:50:17,089 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:50:17,089 INFO L355 BasicCegarLoop]: trace histogram [167, 152, 152, 151, 151, 151, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:50:17,089 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:50:17,089 INFO L82 PathProgramCache]: Analyzing trace with hash -80485483, now seen corresponding path program 32 times [2018-04-10 13:50:17,089 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:50:17,089 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:50:17,090 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:17,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:50:17,090 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:50:17,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:50:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 74449 backedges. 14025 proven. 784 refuted. 0 times theorem prover too weak. 59640 trivial. 0 not checked. [2018-04-10 13:50:19,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:50:19,075 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:50:19,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 13:50:19,236 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 13:50:19,236 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:50:19,245 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:50:19,247 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-04-10 13:50:19,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:50:19,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:50:19,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:50:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 74449 backedges. 14025 proven. 722 refuted. 0 times theorem prover too weak. 59702 trivial. 0 not checked. [2018-04-10 13:50:21,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:50:21,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 40 [2018-04-10 13:50:21,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-10 13:50:21,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-10 13:50:21,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=392, Invalid=1248, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 13:50:21,053 INFO L87 Difference]: Start difference. First operand 1125 states and 1130 transitions. Second operand 41 states. [2018-04-10 13:50:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:50:22,064 INFO L93 Difference]: Finished difference Result 1275 states and 1284 transitions. [2018-04-10 13:50:22,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-10 13:50:22,082 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1103 [2018-04-10 13:50:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:50:22,084 INFO L225 Difference]: With dead ends: 1275 [2018-04-10 13:50:22,084 INFO L226 Difference]: Without dead ends: 1275 [2018-04-10 13:50:22,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1161 GetRequests, 1053 SyntacticMatches, 32 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2282 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1400, Invalid=4606, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 13:50:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2018-04-10 13:50:22,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1239. [2018-04-10 13:50:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2018-04-10 13:50:22,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1246 transitions. [2018-04-10 13:50:22,091 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1246 transitions. Word has length 1103 [2018-04-10 13:50:22,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:50:22,091 INFO L459 AbstractCegarLoop]: Abstraction has 1239 states and 1246 transitions. [2018-04-10 13:50:22,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-10 13:50:22,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1246 transitions. [2018-04-10 13:50:22,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1218 [2018-04-10 13:50:22,097 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:50:22,098 INFO L355 BasicCegarLoop]: trace histogram [185, 169, 169, 168, 168, 168, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:50:22,098 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:50:22,098 INFO L82 PathProgramCache]: Analyzing trace with hash -230054690, now seen corresponding path program 33 times [2018-04-10 13:50:22,098 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:50:22,098 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:50:22,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:22,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:50:22,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:50:22,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:50:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 91768 backedges. 33976 proven. 6853 refuted. 0 times theorem prover too weak. 50939 trivial. 0 not checked. [2018-04-10 13:50:24,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:50:24,847 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:50:24,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 13:50:25,154 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-04-10 13:50:25,154 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:50:25,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:50:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 91768 backedges. 29661 proven. 2452 refuted. 0 times theorem prover too weak. 59655 trivial. 0 not checked. [2018-04-10 13:50:26,305 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:50:26,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 78 [2018-04-10 13:50:26,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-10 13:50:26,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-10 13:50:26,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=5181, Unknown=0, NotChecked=0, Total=6006 [2018-04-10 13:50:26,307 INFO L87 Difference]: Start difference. First operand 1239 states and 1246 transitions. Second operand 78 states. [2018-04-10 13:50:28,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:50:28,516 INFO L93 Difference]: Finished difference Result 1394 states and 1400 transitions. [2018-04-10 13:50:28,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-04-10 13:50:28,517 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 1217 [2018-04-10 13:50:28,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:50:28,519 INFO L225 Difference]: With dead ends: 1394 [2018-04-10 13:50:28,519 INFO L226 Difference]: Without dead ends: 1385 [2018-04-10 13:50:28,520 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1335 GetRequests, 1181 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7932 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3510, Invalid=20670, Unknown=0, NotChecked=0, Total=24180 [2018-04-10 13:50:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2018-04-10 13:50:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1368. [2018-04-10 13:50:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2018-04-10 13:50:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 1374 transitions. [2018-04-10 13:50:28,527 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 1374 transitions. Word has length 1217 [2018-04-10 13:50:28,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:50:28,527 INFO L459 AbstractCegarLoop]: Abstraction has 1368 states and 1374 transitions. [2018-04-10 13:50:28,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-10 13:50:28,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 1374 transitions. [2018-04-10 13:50:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1224 [2018-04-10 13:50:28,534 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:50:28,534 INFO L355 BasicCegarLoop]: trace histogram [186, 170, 170, 169, 169, 169, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:50:28,534 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:50:28,534 INFO L82 PathProgramCache]: Analyzing trace with hash -929947930, now seen corresponding path program 34 times [2018-04-10 13:50:28,534 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:50:28,535 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:50:28,535 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:28,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:50:28,535 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:50:28,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:50:31,126 INFO L134 CoverageAnalysis]: Checked inductivity of 92812 backedges. 16704 proven. 884 refuted. 0 times theorem prover too weak. 75224 trivial. 0 not checked. [2018-04-10 13:50:31,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:50:31,126 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:50:31,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 13:50:31,417 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 13:50:31,417 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:50:31,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:50:31,432 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-04-10 13:50:31,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:50:31,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:50:31,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:50:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 92812 backedges. 16520 proven. 3373 refuted. 0 times theorem prover too weak. 72919 trivial. 0 not checked. [2018-04-10 13:50:33,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:50:33,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 43 [2018-04-10 13:50:33,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-10 13:50:33,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-10 13:50:33,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1439, Unknown=0, NotChecked=0, Total=1892 [2018-04-10 13:50:33,447 INFO L87 Difference]: Start difference. First operand 1368 states and 1374 transitions. Second operand 44 states. [2018-04-10 13:50:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:50:34,504 INFO L93 Difference]: Finished difference Result 1401 states and 1409 transitions. [2018-04-10 13:50:34,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 13:50:34,504 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1223 [2018-04-10 13:50:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:50:34,507 INFO L225 Difference]: With dead ends: 1401 [2018-04-10 13:50:34,507 INFO L226 Difference]: Without dead ends: 1401 [2018-04-10 13:50:34,507 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1263 GetRequests, 1170 SyntacticMatches, 33 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=750, Invalid=3032, Unknown=0, NotChecked=0, Total=3782 [2018-04-10 13:50:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2018-04-10 13:50:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 1374. [2018-04-10 13:50:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2018-04-10 13:50:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1381 transitions. [2018-04-10 13:50:34,515 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1381 transitions. Word has length 1223 [2018-04-10 13:50:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:50:34,515 INFO L459 AbstractCegarLoop]: Abstraction has 1374 states and 1381 transitions. [2018-04-10 13:50:34,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-10 13:50:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1381 transitions. [2018-04-10 13:50:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2018-04-10 13:50:34,522 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:50:34,522 INFO L355 BasicCegarLoop]: trace histogram [187, 171, 171, 170, 170, 170, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:50:34,522 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:50:34,522 INFO L82 PathProgramCache]: Analyzing trace with hash -920557010, now seen corresponding path program 35 times [2018-04-10 13:50:34,522 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:50:34,523 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:50:34,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:34,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:50:34,523 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:50:34,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:50:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 93862 backedges. 18585 proven. 837 refuted. 0 times theorem prover too weak. 74440 trivial. 0 not checked. [2018-04-10 13:50:37,294 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:50:37,294 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:50:37,303 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 13:50:38,174 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-04-10 13:50:38,175 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:50:38,188 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:50:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 93862 backedges. 18471 proven. 4116 refuted. 0 times theorem prover too weak. 71275 trivial. 0 not checked. [2018-04-10 13:50:39,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:50:39,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 44] total 64 [2018-04-10 13:50:39,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-10 13:50:39,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-10 13:50:39,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=819, Invalid=3213, Unknown=0, NotChecked=0, Total=4032 [2018-04-10 13:50:39,133 INFO L87 Difference]: Start difference. First operand 1374 states and 1381 transitions. Second operand 64 states. [2018-04-10 13:50:40,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:50:40,295 INFO L93 Difference]: Finished difference Result 1517 states and 1525 transitions. [2018-04-10 13:50:40,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-10 13:50:40,295 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1229 [2018-04-10 13:50:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:50:40,297 INFO L225 Difference]: With dead ends: 1517 [2018-04-10 13:50:40,298 INFO L226 Difference]: Without dead ends: 1517 [2018-04-10 13:50:40,298 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1306 GetRequests, 1206 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1925 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2228, Invalid=8074, Unknown=0, NotChecked=0, Total=10302 [2018-04-10 13:50:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2018-04-10 13:50:40,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1500. [2018-04-10 13:50:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2018-04-10 13:50:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1508 transitions. [2018-04-10 13:50:40,308 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1508 transitions. Word has length 1229 [2018-04-10 13:50:40,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:50:40,309 INFO L459 AbstractCegarLoop]: Abstraction has 1500 states and 1508 transitions. [2018-04-10 13:50:40,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-10 13:50:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1508 transitions. [2018-04-10 13:50:40,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1344 [2018-04-10 13:50:40,317 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:50:40,317 INFO L355 BasicCegarLoop]: trace histogram [205, 188, 188, 187, 187, 187, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:50:40,317 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:50:40,317 INFO L82 PathProgramCache]: Analyzing trace with hash -710434185, now seen corresponding path program 36 times [2018-04-10 13:50:40,317 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:50:40,317 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:50:40,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:40,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:50:40,318 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:50:40,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:50:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 113203 backedges. 39648 proven. 8202 refuted. 0 times theorem prover too weak. 65353 trivial. 0 not checked. [2018-04-10 13:50:43,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:50:43,887 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:50:43,893 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 13:50:45,030 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2018-04-10 13:50:45,030 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:50:45,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:50:45,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-04-10 13:50:45,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:50:45,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:50:45,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:50:47,972 INFO L134 CoverageAnalysis]: Checked inductivity of 113203 backedges. 19591 proven. 920 refuted. 0 times theorem prover too weak. 92692 trivial. 0 not checked. [2018-04-10 13:50:47,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:50:47,996 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 25] total 66 [2018-04-10 13:50:47,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-10 13:50:47,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-10 13:50:47,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=3730, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 13:50:47,997 INFO L87 Difference]: Start difference. First operand 1500 states and 1508 transitions. Second operand 66 states. [2018-04-10 13:50:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:50:51,218 INFO L93 Difference]: Finished difference Result 1652 states and 1660 transitions. [2018-04-10 13:50:51,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-10 13:50:51,218 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 1343 [2018-04-10 13:50:51,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:50:51,221 INFO L225 Difference]: With dead ends: 1652 [2018-04-10 13:50:51,221 INFO L226 Difference]: Without dead ends: 1643 [2018-04-10 13:50:51,222 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1469 GetRequests, 1288 SyntacticMatches, 33 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8552 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2963, Invalid=19387, Unknown=0, NotChecked=0, Total=22350 [2018-04-10 13:50:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2018-04-10 13:50:51,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1620. [2018-04-10 13:50:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1620 states. [2018-04-10 13:50:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1620 states to 1620 states and 1627 transitions. [2018-04-10 13:50:51,230 INFO L78 Accepts]: Start accepts. Automaton has 1620 states and 1627 transitions. Word has length 1343 [2018-04-10 13:50:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:50:51,230 INFO L459 AbstractCegarLoop]: Abstraction has 1620 states and 1627 transitions. [2018-04-10 13:50:51,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-10 13:50:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1620 states and 1627 transitions. [2018-04-10 13:50:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1470 [2018-04-10 13:50:51,239 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:50:51,239 INFO L355 BasicCegarLoop]: trace histogram [225, 207, 207, 206, 206, 206, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:50:51,239 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:50:51,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1705644624, now seen corresponding path program 37 times [2018-04-10 13:50:51,240 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:50:51,240 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:50:51,240 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:51,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:50:51,240 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:50:51,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:50:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 136892 backedges. 44818 proven. 9625 refuted. 0 times theorem prover too weak. 82449 trivial. 0 not checked. [2018-04-10 13:50:55,637 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:50:55,647 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:50:55,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:50:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:50:55,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:50:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 136892 backedges. 42145 proven. 954 refuted. 0 times theorem prover too weak. 93793 trivial. 0 not checked. [2018-04-10 13:50:56,892 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:50:56,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 40] total 72 [2018-04-10 13:50:56,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-04-10 13:50:56,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-04-10 13:50:56,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=4213, Unknown=0, NotChecked=0, Total=5112 [2018-04-10 13:50:56,894 INFO L87 Difference]: Start difference. First operand 1620 states and 1627 transitions. Second operand 72 states. [2018-04-10 13:50:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:50:58,584 INFO L93 Difference]: Finished difference Result 1657 states and 1664 transitions. [2018-04-10 13:50:58,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-10 13:50:58,584 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 1469 [2018-04-10 13:50:58,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:50:58,587 INFO L225 Difference]: With dead ends: 1657 [2018-04-10 13:50:58,587 INFO L226 Difference]: Without dead ends: 1651 [2018-04-10 13:50:58,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1562 GetRequests, 1444 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4637 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2601, Invalid=11679, Unknown=0, NotChecked=0, Total=14280 [2018-04-10 13:50:58,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2018-04-10 13:50:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1630. [2018-04-10 13:50:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2018-04-10 13:50:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 1637 transitions. [2018-04-10 13:50:58,597 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 1637 transitions. Word has length 1469 [2018-04-10 13:50:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:50:58,597 INFO L459 AbstractCegarLoop]: Abstraction has 1630 states and 1637 transitions. [2018-04-10 13:50:58,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-04-10 13:50:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 1637 transitions. [2018-04-10 13:50:58,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1476 [2018-04-10 13:50:58,607 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:50:58,607 INFO L355 BasicCegarLoop]: trace histogram [226, 208, 208, 207, 207, 207, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:50:58,607 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:50:58,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1936089384, now seen corresponding path program 38 times [2018-04-10 13:50:58,607 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:50:58,608 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:50:58,608 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:58,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:50:58,608 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:50:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:50:58,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:51:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 138168 backedges. 21870 proven. 990 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-04-10 13:51:02,509 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:51:02,509 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:51:02,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 13:51:02,734 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 13:51:02,734 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:51:02,746 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:51:02,748 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-04-10 13:51:02,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:51:02,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:51:02,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:51:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 138168 backedges. 21870 proven. 990 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-04-10 13:51:05,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:51:05,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 25 [2018-04-10 13:51:05,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 13:51:05,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 13:51:05,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=386, Unknown=0, NotChecked=0, Total=650 [2018-04-10 13:51:05,142 INFO L87 Difference]: Start difference. First operand 1630 states and 1637 transitions. Second operand 26 states. [2018-04-10 13:51:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:51:05,579 INFO L93 Difference]: Finished difference Result 1650 states and 1657 transitions. [2018-04-10 13:51:05,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 13:51:05,579 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 1475 [2018-04-10 13:51:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:51:05,582 INFO L225 Difference]: With dead ends: 1650 [2018-04-10 13:51:05,582 INFO L226 Difference]: Without dead ends: 1650 [2018-04-10 13:51:05,582 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1517 GetRequests, 1436 SyntacticMatches, 38 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=721, Invalid=1259, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 13:51:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2018-04-10 13:51:05,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1632. [2018-04-10 13:51:05,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1632 states. [2018-04-10 13:51:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 1639 transitions. [2018-04-10 13:51:05,592 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 1639 transitions. Word has length 1475 [2018-04-10 13:51:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:51:05,592 INFO L459 AbstractCegarLoop]: Abstraction has 1632 states and 1639 transitions. [2018-04-10 13:51:05,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-10 13:51:05,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 1639 transitions. [2018-04-10 13:51:05,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1482 [2018-04-10 13:51:05,602 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:51:05,602 INFO L355 BasicCegarLoop]: trace histogram [227, 209, 209, 208, 208, 208, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:51:05,602 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:51:05,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1693559968, now seen corresponding path program 39 times [2018-04-10 13:51:05,602 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:51:05,602 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:51:05,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:51:05,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:51:05,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:51:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:51:05,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:51:09,487 INFO L134 CoverageAnalysis]: Checked inductivity of 139450 backedges. 23040 proven. 1102 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-04-10 13:51:09,487 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:51:09,487 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:51:09,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 13:51:09,827 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-04-10 13:51:09,827 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:51:09,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:51:09,839 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-04-10 13:51:09,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:51:09,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:51:09,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:51:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 139450 backedges. 23040 proven. 1102 refuted. 0 times theorem prover too weak. 115308 trivial. 0 not checked. [2018-04-10 13:51:12,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:51:12,186 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 26 [2018-04-10 13:51:12,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-10 13:51:12,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-10 13:51:12,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=415, Unknown=0, NotChecked=0, Total=702 [2018-04-10 13:51:12,187 INFO L87 Difference]: Start difference. First operand 1632 states and 1639 transitions. Second operand 27 states. [2018-04-10 13:51:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:51:12,659 INFO L93 Difference]: Finished difference Result 1668 states and 1677 transitions. [2018-04-10 13:51:12,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-10 13:51:12,660 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1481 [2018-04-10 13:51:12,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:51:12,663 INFO L225 Difference]: With dead ends: 1668 [2018-04-10 13:51:12,663 INFO L226 Difference]: Without dead ends: 1668 [2018-04-10 13:51:12,663 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1525 GetRequests, 1442 SyntacticMatches, 38 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=788, Invalid=1374, Unknown=0, NotChecked=0, Total=2162 [2018-04-10 13:51:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2018-04-10 13:51:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1638. [2018-04-10 13:51:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2018-04-10 13:51:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 1646 transitions. [2018-04-10 13:51:12,674 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 1646 transitions. Word has length 1481 [2018-04-10 13:51:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:51:12,674 INFO L459 AbstractCegarLoop]: Abstraction has 1638 states and 1646 transitions. [2018-04-10 13:51:12,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-10 13:51:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 1646 transitions. [2018-04-10 13:51:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1488 [2018-04-10 13:51:12,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:51:12,684 INFO L355 BasicCegarLoop]: trace histogram [228, 210, 210, 209, 209, 209, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:51:12,684 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:51:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1607842712, now seen corresponding path program 40 times [2018-04-10 13:51:12,684 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:51:12,684 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:51:12,685 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:51:12,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:51:12,685 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:51:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:51:12,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:51:16,960 INFO L134 CoverageAnalysis]: Checked inductivity of 140738 backedges. 25371 proven. 1049 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-04-10 13:51:16,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:51:16,960 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:51:16,965 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-10 13:51:17,165 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-10 13:51:17,166 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:51:17,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:51:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 140738 backedges. 25430 proven. 990 refuted. 0 times theorem prover too weak. 114318 trivial. 0 not checked. [2018-04-10 13:51:18,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:51:18,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43] total 66 [2018-04-10 13:51:18,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-04-10 13:51:18,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-04-10 13:51:18,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=3299, Unknown=0, NotChecked=0, Total=4290 [2018-04-10 13:51:18,234 INFO L87 Difference]: Start difference. First operand 1638 states and 1646 transitions. Second operand 66 states. [2018-04-10 13:51:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:51:19,366 INFO L93 Difference]: Finished difference Result 1796 states and 1805 transitions. [2018-04-10 13:51:19,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-04-10 13:51:19,366 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 1487 [2018-04-10 13:51:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:51:19,370 INFO L225 Difference]: With dead ends: 1796 [2018-04-10 13:51:19,370 INFO L226 Difference]: Without dead ends: 1796 [2018-04-10 13:51:19,371 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1569 GetRequests, 1466 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1823 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2782, Invalid=8138, Unknown=0, NotChecked=0, Total=10920 [2018-04-10 13:51:19,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2018-04-10 13:51:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1776. [2018-04-10 13:51:19,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-04-10 13:51:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 1785 transitions. [2018-04-10 13:51:19,384 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 1785 transitions. Word has length 1487 [2018-04-10 13:51:19,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:51:19,385 INFO L459 AbstractCegarLoop]: Abstraction has 1776 states and 1785 transitions. [2018-04-10 13:51:19,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-04-10 13:51:19,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 1785 transitions. [2018-04-10 13:51:19,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1614 [2018-04-10 13:51:19,396 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:51:19,396 INFO L355 BasicCegarLoop]: trace histogram [248, 229, 229, 228, 228, 228, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:51:19,396 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:51:19,396 INFO L82 PathProgramCache]: Analyzing trace with hash 158683713, now seen corresponding path program 41 times [2018-04-10 13:51:19,396 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:51:19,396 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:51:19,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:51:19,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:51:19,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:51:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:51:19,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:51:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 167029 backedges. 68630 proven. 3474 refuted. 0 times theorem prover too weak. 94925 trivial. 0 not checked. [2018-04-10 13:51:24,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:51:24,873 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:51:24,879 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-10 13:51:26,363 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-10 13:51:26,363 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:51:26,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:51:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 167029 backedges. 50068 proven. 6466 refuted. 0 times theorem prover too weak. 110495 trivial. 0 not checked. [2018-04-10 13:51:27,856 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:51:27,857 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45] total 86 [2018-04-10 13:51:27,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-10 13:51:27,858 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-10 13:51:27,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=6204, Unknown=0, NotChecked=0, Total=7310 [2018-04-10 13:51:27,858 INFO L87 Difference]: Start difference. First operand 1776 states and 1785 transitions. Second operand 86 states. [2018-04-10 13:51:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:51:30,360 INFO L93 Difference]: Finished difference Result 1799 states and 1806 transitions. [2018-04-10 13:51:30,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-10 13:51:30,360 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 1613 [2018-04-10 13:51:30,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:51:30,363 INFO L225 Difference]: With dead ends: 1799 [2018-04-10 13:51:30,363 INFO L226 Difference]: Without dead ends: 1793 [2018-04-10 13:51:30,364 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1721 GetRequests, 1575 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6971 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3628, Invalid=18128, Unknown=0, NotChecked=0, Total=21756 [2018-04-10 13:51:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2018-04-10 13:51:30,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1776. [2018-04-10 13:51:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1776 states. [2018-04-10 13:51:30,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 1783 transitions. [2018-04-10 13:51:30,372 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 1783 transitions. Word has length 1613 [2018-04-10 13:51:30,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:51:30,373 INFO L459 AbstractCegarLoop]: Abstraction has 1776 states and 1783 transitions. [2018-04-10 13:51:30,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-10 13:51:30,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 1783 transitions. [2018-04-10 13:51:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1620 [2018-04-10 13:51:30,383 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:51:30,384 INFO L355 BasicCegarLoop]: trace histogram [249, 230, 230, 229, 229, 229, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:51:30,384 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:51:30,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2037889527, now seen corresponding path program 42 times [2018-04-10 13:51:30,384 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:51:30,384 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:51:30,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:51:30,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:51:30,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:51:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:51:30,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:51:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 168439 backedges. 26733 proven. 1220 refuted. 0 times theorem prover too weak. 140486 trivial. 0 not checked. [2018-04-10 13:51:35,016 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:51:35,016 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:51:35,021 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-10 13:51:35,995 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2018-04-10 13:51:35,995 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:51:36,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:51:36,014 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-04-10 13:51:36,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:51:36,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:51:36,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 13:51:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 168439 backedges. 26733 proven. 1220 refuted. 0 times theorem prover too weak. 140486 trivial. 0 not checked. [2018-04-10 13:51:38,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:51:38,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 27 [2018-04-10 13:51:38,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-10 13:51:38,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-10 13:51:38,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=445, Unknown=0, NotChecked=0, Total=756 [2018-04-10 13:51:38,776 INFO L87 Difference]: Start difference. First operand 1776 states and 1783 transitions. Second operand 28 states. [2018-04-10 13:51:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:51:39,291 INFO L93 Difference]: Finished difference Result 1802 states and 1810 transitions. [2018-04-10 13:51:39,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 13:51:39,291 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1619 [2018-04-10 13:51:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:51:39,294 INFO L225 Difference]: With dead ends: 1802 [2018-04-10 13:51:39,294 INFO L226 Difference]: Without dead ends: 1802 [2018-04-10 13:51:39,294 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1665 GetRequests, 1578 SyntacticMatches, 40 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=858, Invalid=1494, Unknown=0, NotChecked=0, Total=2352 [2018-04-10 13:51:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2018-04-10 13:51:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1782. [2018-04-10 13:51:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1782 states. [2018-04-10 13:51:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 1790 transitions. [2018-04-10 13:51:39,303 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 1790 transitions. Word has length 1619 [2018-04-10 13:51:39,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:51:39,303 INFO L459 AbstractCegarLoop]: Abstraction has 1782 states and 1790 transitions. [2018-04-10 13:51:39,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-10 13:51:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 1790 transitions. [2018-04-10 13:51:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1626 [2018-04-10 13:51:39,314 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:51:39,314 INFO L355 BasicCegarLoop]: trace histogram [250, 231, 231, 230, 230, 230, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:51:39,315 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:51:39,315 INFO L82 PathProgramCache]: Analyzing trace with hash 85486353, now seen corresponding path program 43 times [2018-04-10 13:51:39,315 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:51:39,315 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:51:39,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:51:39,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:51:39,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:51:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:51:39,404 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:51:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 169855 backedges. 29307 proven. 1164 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-04-10 13:51:44,583 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:51:44,583 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:51:44,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:51:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:51:44,843 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:51:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 169855 backedges. 29369 proven. 1102 refuted. 0 times theorem prover too weak. 139384 trivial. 0 not checked. [2018-04-10 13:51:46,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:51:46,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45] total 69 [2018-04-10 13:51:46,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-10 13:51:46,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-10 13:51:46,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1082, Invalid=3610, Unknown=0, NotChecked=0, Total=4692 [2018-04-10 13:51:46,087 INFO L87 Difference]: Start difference. First operand 1782 states and 1790 transitions. Second operand 69 states. [2018-04-10 13:51:47,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:51:47,279 INFO L93 Difference]: Finished difference Result 1940 states and 1949 transitions. [2018-04-10 13:51:47,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-10 13:51:47,279 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 1625 [2018-04-10 13:51:47,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:51:47,282 INFO L225 Difference]: With dead ends: 1940 [2018-04-10 13:51:47,282 INFO L226 Difference]: Without dead ends: 1940 [2018-04-10 13:51:47,283 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1711 GetRequests, 1603 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=3047, Invalid=8943, Unknown=0, NotChecked=0, Total=11990 [2018-04-10 13:51:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2018-04-10 13:51:47,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1920. [2018-04-10 13:51:47,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2018-04-10 13:51:47,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 1929 transitions. [2018-04-10 13:51:47,293 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 1929 transitions. Word has length 1625 [2018-04-10 13:51:47,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:51:47,293 INFO L459 AbstractCegarLoop]: Abstraction has 1920 states and 1929 transitions. [2018-04-10 13:51:47,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-10 13:51:47,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 1929 transitions. [2018-04-10 13:51:47,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1758 [2018-04-10 13:51:47,306 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:51:47,306 INFO L355 BasicCegarLoop]: trace histogram [271, 251, 251, 250, 250, 250, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:51:47,306 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:51:47,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1662420850, now seen corresponding path program 44 times [2018-04-10 13:51:47,307 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:51:47,307 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:51:47,307 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:51:47,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 13:51:47,307 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:51:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:51:47,414 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:51:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 200170 backedges. 76348 proven. 6069 refuted. 0 times theorem prover too weak. 117753 trivial. 0 not checked. [2018-04-10 13:51:54,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:51:54,127 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:51:54,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 13:51:54,383 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 13:51:54,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:51:54,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:51:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 200170 backedges. 58243 proven. 1180 refuted. 0 times theorem prover too weak. 140747 trivial. 0 not checked. [2018-04-10 13:51:55,898 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:51:55,899 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 44] total 86 [2018-04-10 13:51:55,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-10 13:51:55,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-10 13:51:55,900 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1201, Invalid=6109, Unknown=0, NotChecked=0, Total=7310 [2018-04-10 13:51:55,900 INFO L87 Difference]: Start difference. First operand 1920 states and 1929 transitions. Second operand 86 states. [2018-04-10 13:51:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 13:51:58,425 INFO L93 Difference]: Finished difference Result 1943 states and 1950 transitions. [2018-04-10 13:51:58,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-10 13:51:58,425 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 1757 [2018-04-10 13:51:58,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 13:51:58,428 INFO L225 Difference]: With dead ends: 1943 [2018-04-10 13:51:58,428 INFO L226 Difference]: Without dead ends: 1937 [2018-04-10 13:51:58,429 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1865 GetRequests, 1721 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7026 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3432, Invalid=17738, Unknown=0, NotChecked=0, Total=21170 [2018-04-10 13:51:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-04-10 13:51:58,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1920. [2018-04-10 13:51:58,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2018-04-10 13:51:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 1927 transitions. [2018-04-10 13:51:58,440 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 1927 transitions. Word has length 1757 [2018-04-10 13:51:58,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 13:51:58,441 INFO L459 AbstractCegarLoop]: Abstraction has 1920 states and 1927 transitions. [2018-04-10 13:51:58,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-10 13:51:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 1927 transitions. [2018-04-10 13:51:58,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1764 [2018-04-10 13:51:58,454 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 13:51:58,455 INFO L355 BasicCegarLoop]: trace histogram [272, 252, 252, 251, 251, 251, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 13:51:58,455 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_false_valid_deref_read_c__fooErr1RequiresViolation, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-10 13:51:58,455 INFO L82 PathProgramCache]: Analyzing trace with hash -840334726, now seen corresponding path program 45 times [2018-04-10 13:51:58,455 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-10 13:51:58,455 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-10 13:51:58,456 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:51:58,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 13:51:58,456 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 13:51:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 13:51:58,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 13:52:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 201714 backedges. 30800 proven. 1344 refuted. 0 times theorem prover too weak. 169570 trivial. 0 not checked. [2018-04-10 13:52:04,112 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 13:52:04,112 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-10 13:52:04,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 13:52:04,585 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-10 13:52:04,585 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 13:52:04,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 13:52:04,600 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-04-10 13:52:04,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 13:52:04,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 13:52:04,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 Received shutdown request... [2018-04-10 13:52:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 201714 backedges. 30800 proven. 1344 refuted. 0 times theorem prover too weak. 169570 trivial. 0 not checked. [2018-04-10 13:52:07,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 13:52:07,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 28 [2018-04-10 13:52:07,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-10 13:52:07,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-10 13:52:07,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=476, Unknown=0, NotChecked=0, Total=812 [2018-04-10 13:52:07,850 INFO L87 Difference]: Start difference. First operand 1920 states and 1927 transitions. Second operand 29 states. [2018-04-10 13:52:07,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-10 13:52:07,850 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 13:52:07,854 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 13:52:07,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 01:52:07 BoogieIcfgContainer [2018-04-10 13:52:07,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 13:52:07,854 INFO L168 Benchmark]: Toolchain (without parser) took 178350.95 ms. Allocated memory was 396.9 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 339.2 MB in the beginning and 1.8 GB in the end (delta: -1.5 GB). Peak memory consumption was 480.5 MB. Max. memory is 5.3 GB. [2018-04-10 13:52:07,855 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 396.9 MB. Free memory is still 358.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 13:52:07,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.53 ms. Allocated memory is still 396.9 MB. Free memory was 339.2 MB in the beginning and 328.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-04-10 13:52:07,855 INFO L168 Benchmark]: Boogie Preprocessor took 28.14 ms. Allocated memory is still 396.9 MB. Free memory is still 328.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 13:52:07,856 INFO L168 Benchmark]: RCFGBuilder took 236.71 ms. Allocated memory was 396.9 MB in the beginning and 600.3 MB in the end (delta: 203.4 MB). Free memory was 328.6 MB in the beginning and 562.8 MB in the end (delta: -234.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. [2018-04-10 13:52:07,856 INFO L168 Benchmark]: TraceAbstraction took 177905.83 ms. Allocated memory was 600.3 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 562.8 MB in the beginning and 1.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 500.6 MB. Max. memory is 5.3 GB. [2018-04-10 13:52:07,857 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.17 ms. Allocated memory is still 396.9 MB. Free memory is still 358.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 177.53 ms. Allocated memory is still 396.9 MB. Free memory was 339.2 MB in the beginning and 328.6 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.14 ms. Allocated memory is still 396.9 MB. Free memory is still 328.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 236.71 ms. Allocated memory was 396.9 MB in the beginning and 600.3 MB in the end (delta: 203.4 MB). Free memory was 328.6 MB in the beginning and 562.8 MB in the end (delta: -234.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 177905.83 ms. Allocated memory was 600.3 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 562.8 MB in the beginning and 1.8 GB in the end (delta: -1.3 GB). Peak memory consumption was 500.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (1920states) and interpolant automaton (currently 2 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (1920states) and interpolant automaton (currently 2 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (1920states) and interpolant automaton (currently 2 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (1920states) and interpolant automaton (currently 2 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (1920states) and interpolant automaton (currently 2 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (1920states) and interpolant automaton (currently 2 states, 29 states before enhancement), while ReachableStatesComputation was computing reachable states (1 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 177.8s OverallTime, 53 OverallIterations, 272 TraceHistogramMax, 41.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1883 SDtfs, 20333 SDslu, 20417 SDs, 0 SdLazy, 66864 SolverSat, 2831 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38670 GetRequests, 35098 SyntacticMatches, 493 SemanticMatches, 3079 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 81250 ImplicationChecksByTransitivity, 42.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1920occurred in iteration=51, 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.3s AutomataMinimizationTime, 52 MinimizatonAttempts, 835 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.3s SsaConstructionTime, 11.5s SatisfiabilityAnalysisTime, 107.8s InterpolantComputationTime, 72552 NumberOfCodeBlocks, 67747 NumberOfCodeBlocksAsserted, 541 NumberOfCheckSat, 72451 ConstructedInterpolants, 13388 QuantifiedInterpolants, 254633540 SizeOfPredicates, 170 NumberOfNonLiveVariables, 71875 ConjunctsInSsa, 1380 ConjunctsInUnsatCore, 101 InterpolantComputations, 6 PerfectInterpolantSequences, 4987743/5096981 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_13-52-07-861.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_13-52-07-861.csv Completed graceful shutdown