java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d4a2356 [2018-03-23 11:54:17,783 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-03-23 11:54:17,785 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-03-23 11:54:17,802 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-03-23 11:54:17,803 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-03-23 11:54:17,804 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-03-23 11:54:17,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-03-23 11:54:17,807 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-03-23 11:54:17,810 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-03-23 11:54:17,811 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-03-23 11:54:17,812 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-03-23 11:54:17,812 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-03-23 11:54:17,813 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-03-23 11:54:17,814 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-03-23 11:54:17,815 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-03-23 11:54:17,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-03-23 11:54:17,820 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-03-23 11:54:17,822 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-03-23 11:54:17,823 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-03-23 11:54:17,824 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-03-23 11:54:17,827 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-03-23 11:54:17,827 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-03-23 11:54:17,827 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-03-23 11:54:17,828 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-03-23 11:54:17,829 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-03-23 11:54:17,831 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-03-23 11:54:17,831 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-03-23 11:54:17,831 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-03-23 11:54:17,832 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-03-23 11:54:17,832 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-03-23 11:54:17,833 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-03-23 11:54:17,834 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-03-23 11:54:17,843 INFO L110 SettingsManager]: Loading preferences was successful [2018-03-23 11:54:17,843 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-03-23 11:54:17,844 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-03-23 11:54:17,844 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-03-23 11:54:17,844 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-03-23 11:54:17,844 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-03-23 11:54:17,845 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-03-23 11:54:17,845 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-03-23 11:54:17,846 INFO L133 SettingsManager]: * sizeof long=4 [2018-03-23 11:54:17,846 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-03-23 11:54:17,846 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-03-23 11:54:17,846 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-03-23 11:54:17,846 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-03-23 11:54:17,846 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-03-23 11:54:17,847 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-03-23 11:54:17,847 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-03-23 11:54:17,847 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-03-23 11:54:17,847 INFO L133 SettingsManager]: * sizeof long double=12 [2018-03-23 11:54:17,847 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-03-23 11:54:17,848 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-03-23 11:54:17,848 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-03-23 11:54:17,848 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-03-23 11:54:17,848 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-03-23 11:54:17,848 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 11:54:17,848 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-03-23 11:54:17,849 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-03-23 11:54:17,849 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-03-23 11:54:17,849 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-03-23 11:54:17,849 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-03-23 11:54:17,849 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-03-23 11:54:17,850 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-03-23 11:54:17,850 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-03-23 11:54:17,851 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-03-23 11:54:17,851 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-03-23 11:54:17,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-03-23 11:54:17,900 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-03-23 11:54:17,905 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-03-23 11:54:17,906 INFO L271 PluginConnector]: Initializing CDTParser... [2018-03-23 11:54:17,907 INFO L276 PluginConnector]: CDTParser initialized [2018-03-23 11:54:17,908 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-03-23 11:54:18,255 INFO L228 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG666c9a974 [2018-03-23 11:54:18,384 INFO L291 CDTParser]: IsIndexed: true [2018-03-23 11:54:18,384 INFO L292 CDTParser]: Found 1 translation units. [2018-03-23 11:54:18,385 INFO L171 CDTParser]: Scanning ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-03-23 11:54:18,386 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-03-23 11:54:18,386 INFO L215 ultiparseSymbolTable]: [2018-03-23 11:54:18,387 INFO L218 ultiparseSymbolTable]: Function table: [2018-03-23 11:54:18,387 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-03-23 11:54:18,387 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo ('foo') in ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-03-23 11:54:18,387 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-03-23 11:54:18,387 INFO L233 ultiparseSymbolTable]: [2018-03-23 11:54:18,402 INFO L334 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG666c9a974 [2018-03-23 11:54:18,406 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-03-23 11:54:18,408 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-03-23 11:54:18,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-03-23 11:54:18,409 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-03-23 11:54:18,414 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-03-23 11:54:18,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 11:54:18" (1/1) ... [2018-03-23 11:54:18,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d205c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:54:18, skipping insertion in model container [2018-03-23 11:54:18,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.03 11:54:18" (1/1) ... [2018-03-23 11:54:18,431 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 11:54:18,443 INFO L167 Dispatcher]: Using SV-COMP mode [2018-03-23 11:54:18,571 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 11:54:18,594 INFO L175 PostProcessor]: Settings: Checked method=main [2018-03-23 11:54:18,598 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-03-23 11:54:18,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:54:18 WrapperNode [2018-03-23 11:54:18,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-03-23 11:54:18,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-03-23 11:54:18,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-03-23 11:54:18,607 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-03-23 11:54:18,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:54:18" (1/1) ... [2018-03-23 11:54:18,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:54:18" (1/1) ... [2018-03-23 11:54:18,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:54:18" (1/1) ... [2018-03-23 11:54:18,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:54:18" (1/1) ... [2018-03-23 11:54:18,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:54:18" (1/1) ... [2018-03-23 11:54:18,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:54:18" (1/1) ... [2018-03-23 11:54:18,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:54:18" (1/1) ... [2018-03-23 11:54:18,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-03-23 11:54:18,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-03-23 11:54:18,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-03-23 11:54:18,640 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-03-23 11:54:18,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:54:18" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-03-23 11:54:18,688 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-03-23 11:54:18,688 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-03-23 11:54:18,688 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo [2018-03-23 11:54:18,688 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-03-23 11:54:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo [2018-03-23 11:54:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-03-23 11:54:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-03-23 11:54:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-03-23 11:54:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-03-23 11:54:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-03-23 11:54:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-03-23 11:54:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-03-23 11:54:18,689 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-03-23 11:54:18,973 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-03-23 11:54:18,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 11:54:18 BoogieIcfgContainer [2018-03-23 11:54:18,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-03-23 11:54:18,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-03-23 11:54:18,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-03-23 11:54:18,977 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-03-23 11:54:18,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.03 11:54:18" (1/3) ... [2018-03-23 11:54:18,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb20103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 11:54:18, skipping insertion in model container [2018-03-23 11:54:18,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.03 11:54:18" (2/3) ... [2018-03-23 11:54:18,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb20103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.03 11:54:18, skipping insertion in model container [2018-03-23 11:54:18,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.03 11:54:18" (3/3) ... [2018-03-23 11:54:18,980 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2018-03-23 11:54:18,989 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-03-23 11:54:18,995 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-03-23 11:54:19,039 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-03-23 11:54:19,040 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-03-23 11:54:19,040 INFO L370 AbstractCegarLoop]: Hoare is true [2018-03-23 11:54:19,040 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-03-23 11:54:19,041 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-03-23 11:54:19,041 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-03-23 11:54:19,041 INFO L374 AbstractCegarLoop]: Difference is false [2018-03-23 11:54:19,041 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-03-23 11:54:19,041 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-03-23 11:54:19,042 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-03-23 11:54:19,057 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-03-23 11:54:19,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-03-23 11:54:19,064 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:19,065 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:19,065 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:19,071 INFO L82 PathProgramCache]: Analyzing trace with hash 924065095, now seen corresponding path program 1 times [2018-03-23 11:54:19,072 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:19,073 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:19,115 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:19,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:19,115 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:19,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:19,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:54:19,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-03-23 11:54:19,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-03-23 11:54:19,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-03-23 11:54:19,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-03-23 11:54:19,249 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 3 states. [2018-03-23 11:54:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:19,341 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2018-03-23 11:54:19,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-03-23 11:54:19,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-03-23 11:54:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:19,356 INFO L225 Difference]: With dead ends: 133 [2018-03-23 11:54:19,356 INFO L226 Difference]: Without dead ends: 78 [2018-03-23 11:54:19,361 INFO L568 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-03-23 11:54:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-03-23 11:54:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-03-23 11:54:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-03-23 11:54:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-03-23 11:54:19,407 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 13 [2018-03-23 11:54:19,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:19,407 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-03-23 11:54:19,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-03-23 11:54:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-03-23 11:54:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-03-23 11:54:19,408 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:19,409 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:19,409 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:19,409 INFO L82 PathProgramCache]: Analyzing trace with hash 591861313, now seen corresponding path program 1 times [2018-03-23 11:54:19,409 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:19,409 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:19,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:19,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:19,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:19,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:19,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:54:19,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-03-23 11:54:19,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-03-23 11:54:19,532 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-03-23 11:54:19,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-03-23 11:54:19,532 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 7 states. [2018-03-23 11:54:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:19,681 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-03-23 11:54:19,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-03-23 11:54:19,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-03-23 11:54:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:19,686 INFO L225 Difference]: With dead ends: 172 [2018-03-23 11:54:19,686 INFO L226 Difference]: Without dead ends: 121 [2018-03-23 11:54:19,688 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-03-23 11:54:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-03-23 11:54:19,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 88. [2018-03-23 11:54:19,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-03-23 11:54:19,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-03-23 11:54:19,701 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 22 [2018-03-23 11:54:19,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:19,701 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-03-23 11:54:19,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-03-23 11:54:19,701 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-03-23 11:54:19,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-03-23 11:54:19,702 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:19,702 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:19,702 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:19,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1167831631, now seen corresponding path program 1 times [2018-03-23 11:54:19,703 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:19,703 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:19,704 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:19,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:19,704 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:19,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:19,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:54:19,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-03-23 11:54:19,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 11:54:19,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 11:54:19,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:54:19,780 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 5 states. [2018-03-23 11:54:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:19,842 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-03-23 11:54:19,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-03-23 11:54:19,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-03-23 11:54:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:19,844 INFO L225 Difference]: With dead ends: 88 [2018-03-23 11:54:19,844 INFO L226 Difference]: Without dead ends: 87 [2018-03-23 11:54:19,845 INFO L568 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-03-23 11:54:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-03-23 11:54:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-03-23 11:54:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-03-23 11:54:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2018-03-23 11:54:19,857 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 23 [2018-03-23 11:54:19,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:19,857 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2018-03-23 11:54:19,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 11:54:19,858 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2018-03-23 11:54:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-03-23 11:54:19,858 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:19,858 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:19,858 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:19,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1167831632, now seen corresponding path program 1 times [2018-03-23 11:54:19,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:19,859 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:19,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:19,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:19,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:19,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:19,945 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-03-23 11:54:19,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-03-23 11:54:19,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-03-23 11:54:19,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-03-23 11:54:19,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-03-23 11:54:19,947 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand 6 states. [2018-03-23 11:54:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:20,040 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-03-23 11:54:20,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 11:54:20,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-03-23 11:54:20,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:20,042 INFO L225 Difference]: With dead ends: 101 [2018-03-23 11:54:20,042 INFO L226 Difference]: Without dead ends: 100 [2018-03-23 11:54:20,042 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-03-23 11:54:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-03-23 11:54:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2018-03-23 11:54:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-03-23 11:54:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-03-23 11:54:20,052 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 23 [2018-03-23 11:54:20,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:20,052 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-03-23 11:54:20,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-03-23 11:54:20,053 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-03-23 11:54:20,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-03-23 11:54:20,053 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:20,053 INFO L353 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] [2018-03-23 11:54:20,053 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:20,054 INFO L82 PathProgramCache]: Analyzing trace with hash -572236607, now seen corresponding path program 1 times [2018-03-23 11:54:20,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:20,054 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:20,055 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:20,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:20,055 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:20,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:20,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:20,172 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:20,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:20,232 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-03-23 11:54:20,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:54:20,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2018-03-23 11:54:20,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-03-23 11:54:20,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-03-23 11:54:20,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-03-23 11:54:20,349 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 14 states. [2018-03-23 11:54:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:20,548 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2018-03-23 11:54:20,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-23 11:54:20,549 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2018-03-23 11:54:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:20,550 INFO L225 Difference]: With dead ends: 166 [2018-03-23 11:54:20,550 INFO L226 Difference]: Without dead ends: 100 [2018-03-23 11:54:20,551 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-03-23 11:54:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-03-23 11:54:20,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2018-03-23 11:54:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-03-23 11:54:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2018-03-23 11:54:20,562 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 31 [2018-03-23 11:54:20,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:20,563 INFO L459 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2018-03-23 11:54:20,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-03-23 11:54:20,564 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2018-03-23 11:54:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-03-23 11:54:20,565 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:20,565 INFO L353 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:20,565 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:20,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1153304147, now seen corresponding path program 1 times [2018-03-23 11:54:20,566 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:20,566 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:20,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:20,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:20,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:20,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-23 11:54:20,653 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:20,653 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:20,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:20,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-23 11:54:20,736 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:54:20,736 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-03-23 11:54:20,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-03-23 11:54:20,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-03-23 11:54:20,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-03-23 11:54:20,737 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 8 states. [2018-03-23 11:54:20,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:20,928 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-03-23 11:54:20,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-03-23 11:54:20,929 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-03-23 11:54:20,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:20,930 INFO L225 Difference]: With dead ends: 125 [2018-03-23 11:54:20,930 INFO L226 Difference]: Without dead ends: 104 [2018-03-23 11:54:20,931 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-03-23 11:54:20,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-03-23 11:54:20,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2018-03-23 11:54:20,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-03-23 11:54:20,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-03-23 11:54:20,941 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 42 [2018-03-23 11:54:20,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:20,941 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-03-23 11:54:20,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-03-23 11:54:20,941 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-03-23 11:54:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-03-23 11:54:20,943 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:20,943 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:20,943 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:20,944 INFO L82 PathProgramCache]: Analyzing trace with hash -364733747, now seen corresponding path program 1 times [2018-03-23 11:54:20,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:20,944 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:20,945 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:20,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:20,945 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:20,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:21,018 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-03-23 11:54:21,018 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:21,018 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:21,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:21,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-03-23 11:54:21,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:21,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-03-23 11:54:21,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-03-23 11:54:21,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-03-23 11:54:21,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-03-23 11:54:21,086 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 5 states. [2018-03-23 11:54:21,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:21,131 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-03-23 11:54:21,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-03-23 11:54:21,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-03-23 11:54:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:21,133 INFO L225 Difference]: With dead ends: 115 [2018-03-23 11:54:21,133 INFO L226 Difference]: Without dead ends: 114 [2018-03-23 11:54:21,134 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-03-23 11:54:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-03-23 11:54:21,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2018-03-23 11:54:21,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-03-23 11:54:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2018-03-23 11:54:21,143 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 60 [2018-03-23 11:54:21,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:21,143 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2018-03-23 11:54:21,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-03-23 11:54:21,143 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2018-03-23 11:54:21,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-03-23 11:54:21,145 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:21,146 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:21,146 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:21,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1578155844, now seen corresponding path program 1 times [2018-03-23 11:54:21,146 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:21,146 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:21,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:21,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:21,147 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:21,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-03-23 11:54:21,372 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:21,372 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:21,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:21,395 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:21,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:54:21,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:21,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:21,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:54:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-03-23 11:54:21,554 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:21,554 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-03-23 11:54:21,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-03-23 11:54:21,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-03-23 11:54:21,554 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-03-23 11:54:21,555 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand 9 states. [2018-03-23 11:54:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:21,732 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-03-23 11:54:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-03-23 11:54:21,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-03-23 11:54:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:21,734 INFO L225 Difference]: With dead ends: 114 [2018-03-23 11:54:21,734 INFO L226 Difference]: Without dead ends: 113 [2018-03-23 11:54:21,734 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-03-23 11:54:21,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-03-23 11:54:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2018-03-23 11:54:21,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-03-23 11:54:21,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2018-03-23 11:54:21,742 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 61 [2018-03-23 11:54:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:21,742 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2018-03-23 11:54:21,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-03-23 11:54:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-03-23 11:54:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-03-23 11:54:21,743 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:21,743 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:21,743 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:21,743 INFO L82 PathProgramCache]: Analyzing trace with hash 935802293, now seen corresponding path program 2 times [2018-03-23 11:54:21,744 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:21,744 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:21,744 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:21,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:21,744 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:21,759 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 37 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-23 11:54:21,883 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:21,883 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:21,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:54:21,925 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:54:21,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:21,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-03-23 11:54:22,108 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:22,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-03-23 11:54:22,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-23 11:54:22,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-23 11:54:22,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-03-23 11:54:22,109 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 19 states. [2018-03-23 11:54:22,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:22,476 INFO L93 Difference]: Finished difference Result 214 states and 228 transitions. [2018-03-23 11:54:22,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-03-23 11:54:22,477 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-03-23 11:54:22,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:22,479 INFO L225 Difference]: With dead ends: 214 [2018-03-23 11:54:22,479 INFO L226 Difference]: Without dead ends: 152 [2018-03-23 11:54:22,480 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2018-03-23 11:54:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-03-23 11:54:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 133. [2018-03-23 11:54:22,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-03-23 11:54:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2018-03-23 11:54:22,492 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 69 [2018-03-23 11:54:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:22,493 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2018-03-23 11:54:22,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-23 11:54:22,493 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2018-03-23 11:54:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-03-23 11:54:22,495 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:22,495 INFO L353 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:22,495 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:22,495 INFO L82 PathProgramCache]: Analyzing trace with hash -804474268, now seen corresponding path program 1 times [2018-03-23 11:54:22,495 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:22,496 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:22,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:22,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:22,497 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:22,511 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:22,585 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-03-23 11:54:22,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:22,586 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:22,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:22,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-03-23 11:54:22,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:54:22,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2018-03-23 11:54:22,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-03-23 11:54:22,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-03-23 11:54:22,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-03-23 11:54:22,729 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 13 states. [2018-03-23 11:54:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:22,915 INFO L93 Difference]: Finished difference Result 226 states and 240 transitions. [2018-03-23 11:54:22,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-03-23 11:54:22,915 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2018-03-23 11:54:22,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:22,916 INFO L225 Difference]: With dead ends: 226 [2018-03-23 11:54:22,917 INFO L226 Difference]: Without dead ends: 158 [2018-03-23 11:54:22,918 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2018-03-23 11:54:22,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-03-23 11:54:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 141. [2018-03-23 11:54:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-03-23 11:54:22,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2018-03-23 11:54:22,927 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 70 [2018-03-23 11:54:22,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:22,928 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2018-03-23 11:54:22,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-03-23 11:54:22,928 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2018-03-23 11:54:22,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-03-23 11:54:22,929 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:22,930 INFO L353 BasicCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:22,930 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:22,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1248687423, now seen corresponding path program 3 times [2018-03-23 11:54:22,930 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:22,930 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:22,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:22,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:22,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:22,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 99 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-03-23 11:54:23,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:23,065 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:23,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 11:54:23,103 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-03-23 11:54:23,103 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:23,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 68 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-03-23 11:54:23,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:23,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-03-23 11:54:23,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-03-23 11:54:23,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-03-23 11:54:23,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-03-23 11:54:23,324 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 19 states. [2018-03-23 11:54:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:24,003 INFO L93 Difference]: Finished difference Result 230 states and 239 transitions. [2018-03-23 11:54:24,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-03-23 11:54:24,004 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 98 [2018-03-23 11:54:24,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:24,005 INFO L225 Difference]: With dead ends: 230 [2018-03-23 11:54:24,005 INFO L226 Difference]: Without dead ends: 157 [2018-03-23 11:54:24,007 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=310, Invalid=1412, Unknown=0, NotChecked=0, Total=1722 [2018-03-23 11:54:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-03-23 11:54:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 140. [2018-03-23 11:54:24,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-03-23 11:54:24,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2018-03-23 11:54:24,026 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 98 [2018-03-23 11:54:24,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:24,026 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2018-03-23 11:54:24,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-03-23 11:54:24,026 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2018-03-23 11:54:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-03-23 11:54:24,027 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:24,027 INFO L353 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:24,027 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:24,027 INFO L82 PathProgramCache]: Analyzing trace with hash 952319464, now seen corresponding path program 2 times [2018-03-23 11:54:24,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:24,027 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:24,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:24,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:24,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:24,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 88 proven. 17 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-03-23 11:54:24,234 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:24,234 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:24,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:54:24,261 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:54:24,262 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:24,266 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:24,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:54:24,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:24,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:24,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:54:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 88 proven. 17 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-03-23 11:54:24,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:24,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 10 [2018-03-23 11:54:24,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-03-23 11:54:24,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-03-23 11:54:24,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-03-23 11:54:24,439 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand 11 states. [2018-03-23 11:54:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:24,651 INFO L93 Difference]: Finished difference Result 160 states and 165 transitions. [2018-03-23 11:54:24,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-03-23 11:54:24,658 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 108 [2018-03-23 11:54:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:24,659 INFO L225 Difference]: With dead ends: 160 [2018-03-23 11:54:24,659 INFO L226 Difference]: Without dead ends: 159 [2018-03-23 11:54:24,660 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 100 SyntacticMatches, 9 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-03-23 11:54:24,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-03-23 11:54:24,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2018-03-23 11:54:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-03-23 11:54:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 154 transitions. [2018-03-23 11:54:24,670 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 154 transitions. Word has length 108 [2018-03-23 11:54:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:24,670 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 154 transitions. [2018-03-23 11:54:24,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-03-23 11:54:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 154 transitions. [2018-03-23 11:54:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-03-23 11:54:24,672 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:24,672 INFO L353 BasicCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:24,673 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:24,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2108396480, now seen corresponding path program 2 times [2018-03-23 11:54:24,673 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:24,673 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:24,674 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:24,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:24,674 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:24,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 76 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2018-03-23 11:54:24,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:24,877 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:24,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:54:24,906 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-03-23 11:54:24,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:24,911 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:24,942 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:24,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-03-23 11:54:24,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:24,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:24,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-03-23 11:54:24,994 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:24,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-03-23 11:54:24,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:24,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:24,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-03-23 11:54:25,075 INFO L700 Elim1Store]: detected not equals via solver [2018-03-23 11:54:25,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-03-23 11:54:25,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:25,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-03-23 11:54:25,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-03-23 11:54:25,123 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-03-23 11:54:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-03-23 11:54:25,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-03-23 11:54:25,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2018-03-23 11:54:25,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-03-23 11:54:25,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-03-23 11:54:25,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=179, Unknown=1, NotChecked=26, Total=240 [2018-03-23 11:54:25,190 INFO L87 Difference]: Start difference. First operand 149 states and 154 transitions. Second operand 16 states. [2018-03-23 11:54:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:25,788 INFO L93 Difference]: Finished difference Result 229 states and 241 transitions. [2018-03-23 11:54:25,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-03-23 11:54:25,788 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2018-03-23 11:54:25,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:25,789 INFO L225 Difference]: With dead ends: 229 [2018-03-23 11:54:25,789 INFO L226 Difference]: Without dead ends: 144 [2018-03-23 11:54:25,790 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 110 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=1112, Unknown=1, NotChecked=70, Total=1406 [2018-03-23 11:54:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-03-23 11:54:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-03-23 11:54:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-03-23 11:54:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 144 transitions. [2018-03-23 11:54:25,802 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 144 transitions. Word has length 117 [2018-03-23 11:54:25,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:25,803 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 144 transitions. [2018-03-23 11:54:25,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-03-23 11:54:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2018-03-23 11:54:25,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-03-23 11:54:25,804 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:25,804 INFO L353 BasicCegarLoop]: trace histogram [9, 7, 7, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:25,805 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:25,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1936145208, now seen corresponding path program 3 times [2018-03-23 11:54:25,805 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:25,805 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:25,806 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:25,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:25,806 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:25,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 139 proven. 6 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-03-23 11:54:26,069 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:26,069 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:26,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-03-23 11:54:26,091 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-03-23 11:54:26,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:26,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:26,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-03-23 11:54:26,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-03-23 11:54:26,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-03-23 11:54:26,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-03-23 11:54:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 139 proven. 6 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-03-23 11:54:26,400 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:26,400 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2018-03-23 11:54:26,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-03-23 11:54:26,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-03-23 11:54:26,401 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-03-23 11:54:26,401 INFO L87 Difference]: Start difference. First operand 141 states and 144 transitions. Second operand 21 states. [2018-03-23 11:54:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:26,668 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-03-23 11:54:26,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-03-23 11:54:26,668 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 117 [2018-03-23 11:54:26,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:26,669 INFO L225 Difference]: With dead ends: 141 [2018-03-23 11:54:26,669 INFO L226 Difference]: Without dead ends: 140 [2018-03-23 11:54:26,670 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=606, Unknown=0, NotChecked=0, Total=812 [2018-03-23 11:54:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-03-23 11:54:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2018-03-23 11:54:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-03-23 11:54:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2018-03-23 11:54:26,681 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 117 [2018-03-23 11:54:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:26,681 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-03-23 11:54:26,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-03-23 11:54:26,681 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-03-23 11:54:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-03-23 11:54:26,683 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:26,683 INFO L353 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:26,683 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:26,684 INFO L82 PathProgramCache]: Analyzing trace with hash 430549878, now seen corresponding path program 1 times [2018-03-23 11:54:26,684 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:26,684 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:26,684 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:26,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-03-23 11:54:26,685 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:26,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-03-23 11:54:26,763 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:26,763 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:26,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:26,796 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 120 proven. 13 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-03-23 11:54:26,918 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:26,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 14] total 17 [2018-03-23 11:54:26,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-03-23 11:54:26,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-03-23 11:54:26,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-03-23 11:54:26,919 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 17 states. [2018-03-23 11:54:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:27,175 INFO L93 Difference]: Finished difference Result 207 states and 213 transitions. [2018-03-23 11:54:27,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-03-23 11:54:27,175 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 128 [2018-03-23 11:54:27,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:27,176 INFO L225 Difference]: With dead ends: 207 [2018-03-23 11:54:27,176 INFO L226 Difference]: Without dead ends: 154 [2018-03-23 11:54:27,177 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=996, Unknown=0, NotChecked=0, Total=1190 [2018-03-23 11:54:27,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-03-23 11:54:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 145. [2018-03-23 11:54:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-03-23 11:54:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-03-23 11:54:27,187 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 128 [2018-03-23 11:54:27,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:27,187 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-03-23 11:54:27,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-03-23 11:54:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-03-23 11:54:27,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-03-23 11:54:27,188 INFO L345 BasicCegarLoop]: Found error trace [2018-03-23 11:54:27,188 INFO L353 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-03-23 11:54:27,188 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX]=== [2018-03-23 11:54:27,189 INFO L82 PathProgramCache]: Analyzing trace with hash 223685147, now seen corresponding path program 2 times [2018-03-23 11:54:27,189 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-03-23 11:54:27,189 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-03-23 11:54:27,189 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:27,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-03-23 11:54:27,190 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-03-23 11:54:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-03-23 11:54:27,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-03-23 11:54:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2018-03-23 11:54:27,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-03-23 11:54:27,317 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-03-23 11:54:27,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-03-23 11:54:27,365 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-03-23 11:54:27,365 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-03-23 11:54:27,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-03-23 11:54:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2018-03-23 11:54:27,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-03-23 11:54:27,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2018-03-23 11:54:27,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-03-23 11:54:27,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-03-23 11:54:27,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-03-23 11:54:27,470 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 15 states. [2018-03-23 11:54:27,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-03-23 11:54:27,610 INFO L93 Difference]: Finished difference Result 183 states and 189 transitions. [2018-03-23 11:54:27,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-03-23 11:54:27,610 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 144 [2018-03-23 11:54:27,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-03-23 11:54:27,611 INFO L225 Difference]: With dead ends: 183 [2018-03-23 11:54:27,611 INFO L226 Difference]: Without dead ends: 0 [2018-03-23 11:54:27,612 INFO L568 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2018-03-23 11:54:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-03-23 11:54:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-03-23 11:54:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-03-23 11:54:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-03-23 11:54:27,613 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 144 [2018-03-23 11:54:27,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-03-23 11:54:27,613 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-03-23 11:54:27,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-03-23 11:54:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-03-23 11:54:27,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-03-23 11:54:27,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-03-23 11:54:28,140 WARN L151 SmtUtils]: Spent 278ms on a formula simplification. DAG size of input: 79 DAG size of output 52 [2018-03-23 11:54:28,214 INFO L416 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-03-23 11:54:28,214 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-03-23 11:54:28,214 INFO L412 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-03-23 11:54:28,214 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-03-23 11:54:28,214 INFO L419 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-03-23 11:54:28,214 INFO L419 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-03-23 11:54:28,214 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-03-23 11:54:28,214 INFO L416 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-03-23 11:54:28,214 INFO L416 ceAbstractionStarter]: For program point mainErr2EnsuresViolationMEMORY_LEAK(lines 23 35) no Hoare annotation was computed. [2018-03-23 11:54:28,215 INFO L416 ceAbstractionStarter]: For program point mainErr1AssertViolationARRAY_INDEX(line 30) no Hoare annotation was computed. [2018-03-23 11:54:28,215 INFO L416 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-03-23 11:54:28,215 INFO L416 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-03-23 11:54:28,215 INFO L416 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-03-23 11:54:28,215 INFO L416 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-03-23 11:54:28,215 INFO L416 ceAbstractionStarter]: For program point L26''''''(lines 26 28) no Hoare annotation was computed. [2018-03-23 11:54:28,215 INFO L416 ceAbstractionStarter]: For program point L29(lines 29 33) no Hoare annotation was computed. [2018-03-23 11:54:28,215 INFO L416 ceAbstractionStarter]: For program point L27''''(line 27) no Hoare annotation was computed. [2018-03-23 11:54:28,215 INFO L412 ceAbstractionStarter]: At program point L27'(line 27) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#mask~0.base| 1))) (.cse1 (= 32 (select |#length| |main_~#mask~0.base|))) (.cse2 (= 0 |main_~#mask~0.offset|)) (.cse3 (= (select |old(#valid)| |main_~#mask~0.base|) 0))) (or (and (= 0 main_~i~1) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (< main_~i~1 32) .cse2 (<= 1 main_~i~1) .cse3))) [2018-03-23 11:54:28,215 INFO L416 ceAbstractionStarter]: For program point L27'''(line 27) no Hoare annotation was computed. [2018-03-23 11:54:28,215 INFO L416 ceAbstractionStarter]: For program point L29''''''(lines 29 33) no Hoare annotation was computed. [2018-03-23 11:54:28,215 INFO L416 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-03-23 11:54:28,215 INFO L416 ceAbstractionStarter]: For program point mainFINAL(lines 23 35) no Hoare annotation was computed. [2018-03-23 11:54:28,215 INFO L416 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-03-23 11:54:28,215 INFO L416 ceAbstractionStarter]: For program point mainEXIT(lines 23 35) no Hoare annotation was computed. [2018-03-23 11:54:28,216 INFO L412 ceAbstractionStarter]: At program point mainENTRY(lines 23 35) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-03-23 11:54:28,216 INFO L416 ceAbstractionStarter]: For program point L29''''(line 29) no Hoare annotation was computed. [2018-03-23 11:54:28,216 INFO L416 ceAbstractionStarter]: For program point L26''(lines 26 28) no Hoare annotation was computed. [2018-03-23 11:54:28,216 INFO L416 ceAbstractionStarter]: For program point L26'''(line 26) no Hoare annotation was computed. [2018-03-23 11:54:28,216 INFO L416 ceAbstractionStarter]: For program point L30'(lines 30 32) no Hoare annotation was computed. [2018-03-23 11:54:28,216 INFO L416 ceAbstractionStarter]: For program point L25'''''(line 25) no Hoare annotation was computed. [2018-03-23 11:54:28,216 INFO L416 ceAbstractionStarter]: For program point mainErr0AssertViolationARRAY_INDEX(line 27) no Hoare annotation was computed. [2018-03-23 11:54:28,216 INFO L416 ceAbstractionStarter]: For program point L25'''(line 25) no Hoare annotation was computed. [2018-03-23 11:54:28,216 INFO L416 ceAbstractionStarter]: For program point L25'(line 25) no Hoare annotation was computed. [2018-03-23 11:54:28,216 INFO L416 ceAbstractionStarter]: For program point L29'''(line 29) no Hoare annotation was computed. [2018-03-23 11:54:28,216 INFO L416 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-03-23 11:54:28,216 INFO L416 ceAbstractionStarter]: For program point L26''''(line 26) no Hoare annotation was computed. [2018-03-23 11:54:28,216 INFO L416 ceAbstractionStarter]: For program point L25''(line 25) no Hoare annotation was computed. [2018-03-23 11:54:28,216 INFO L416 ceAbstractionStarter]: For program point L29''(lines 29 33) no Hoare annotation was computed. [2018-03-23 11:54:28,216 INFO L416 ceAbstractionStarter]: For program point L27''(line 27) no Hoare annotation was computed. [2018-03-23 11:54:28,217 INFO L412 ceAbstractionStarter]: At program point L26'''''(lines 26 28) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#mask~0.base| 1))) (.cse1 (= 32 (select |#length| |main_~#mask~0.base|))) (.cse2 (= 0 |main_~#mask~0.offset|)) (.cse3 (= (select |old(#valid)| |main_~#mask~0.base|) 0))) (or (and .cse0 .cse1 .cse2 (<= 1 main_~i~1) .cse3) (and .cse0 .cse1 .cse2 (= main_~i~1 0) .cse3))) [2018-03-23 11:54:28,217 INFO L412 ceAbstractionStarter]: At program point L29'''''(lines 29 33) the Hoare annotation is: (let ((.cse0 (= |#valid| (store |old(#valid)| |main_~#mask~0.base| 1))) (.cse1 (= 32 (select |#length| |main_~#mask~0.base|))) (.cse2 (= 0 |main_~#mask~0.offset|)) (.cse3 (= (select |old(#valid)| |main_~#mask~0.base|) 0))) (or (and .cse0 .cse1 .cse2 (<= 1 main_~i~1) .cse3) (and .cse0 .cse1 .cse2 (= main_~i~1 0) .cse3))) [2018-03-23 11:54:28,217 INFO L419 ceAbstractionStarter]: At program point __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooENTRY(lines 14 21) the Hoare annotation is: true [2018-03-23 11:54:28,217 INFO L416 ceAbstractionStarter]: For program point L18'''(line 18) no Hoare annotation was computed. [2018-03-23 11:54:28,217 INFO L416 ceAbstractionStarter]: For program point L17'''''(line 17) no Hoare annotation was computed. [2018-03-23 11:54:28,217 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooEXIT(lines 14 21) no Hoare annotation was computed. [2018-03-23 11:54:28,217 INFO L416 ceAbstractionStarter]: For program point L17'''''''(lines 17 19) no Hoare annotation was computed. [2018-03-23 11:54:28,217 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooFINAL(lines 14 21) no Hoare annotation was computed. [2018-03-23 11:54:28,217 INFO L416 ceAbstractionStarter]: For program point L18''(line 18) no Hoare annotation was computed. [2018-03-23 11:54:28,217 INFO L416 ceAbstractionStarter]: For program point L17'(lines 17 19) no Hoare annotation was computed. [2018-03-23 11:54:28,217 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX(line 18) no Hoare annotation was computed. [2018-03-23 11:54:28,217 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr1RequiresViolation(line 18) no Hoare annotation was computed. [2018-03-23 11:54:28,217 INFO L416 ceAbstractionStarter]: For program point L17''''(line 17) no Hoare annotation was computed. [2018-03-23 11:54:28,218 INFO L416 ceAbstractionStarter]: For program point __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__fooErr2RequiresViolation(line 18) no Hoare annotation was computed. [2018-03-23 11:54:28,218 INFO L416 ceAbstractionStarter]: For program point L17'''(lines 17 19) no Hoare annotation was computed. [2018-03-23 11:54:28,218 INFO L416 ceAbstractionStarter]: For program point L14(lines 14 21) no Hoare annotation was computed. [2018-03-23 11:54:28,218 INFO L416 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-03-23 11:54:28,218 INFO L416 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-03-23 11:54:28,218 INFO L416 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-03-23 11:54:28,218 INFO L416 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-03-23 11:54:28,218 INFO L412 ceAbstractionStarter]: At program point L17''''''(lines 17 19) the Hoare annotation is: (let ((.cse0 (not (= 0 |__U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_#in~b.offset|))) (.cse1 (not (= (select |#valid| |__U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_#in~b.base|) 1))) (.cse2 (not (= (select |#length| |__U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_#in~b.base|) 32)))) (and (or .cse0 .cse1 .cse2 (< 1 |__U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_#in~size|) (and (<= __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_~i~0 2) (<= __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_~size 1))) (let ((.cse3 (= 1 (select |#valid| __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_~b.base))) (.cse4 (= (select |#length| __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_~b.base) 32)) (.cse5 (<= __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_~size 31)) (.cse6 (<= |__U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_~size)) (.cse7 (= __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_~b.offset 0))) (or .cse0 .cse1 (and .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_~i~0)) .cse2 (and .cse3 (<= 1 (+ __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_~b.offset __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_~i~0)) .cse4 .cse5 .cse6 .cse7) (< 31 |__U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_#in~size|))) (or .cse0 .cse1 (not (= 0 |__U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_#in~size|)) .cse2 (and (= __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_~size 0) (<= (+ |__U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_#in~size| __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_~i~0) (+ __U_MULTI_fArraysWithLenghtAtDeclaration_true_valid_memsafety_true_termination_c__foo_~size 1)))))) [2018-03-23 11:54:28,218 INFO L416 ceAbstractionStarter]: For program point L18'(line 18) no Hoare annotation was computed. [2018-03-23 11:54:28,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,225 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,228 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,231 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,232 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,235 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,236 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,237 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,237 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,238 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.03 11:54:28 BoogieIcfgContainer [2018-03-23 11:54:28,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-03-23 11:54:28,241 INFO L168 Benchmark]: Toolchain (without parser) took 9834.52 ms. Allocated memory was 306.7 MB in the beginning and 613.9 MB in the end (delta: 307.2 MB). Free memory was 251.6 MB in the beginning and 529.9 MB in the end (delta: -278.2 MB). Peak memory consumption was 220.4 MB. Max. memory is 5.3 GB. [2018-03-23 11:54:28,243 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 306.7 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-03-23 11:54:28,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.57 ms. Allocated memory is still 306.7 MB. Free memory was 250.6 MB in the beginning and 241.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-03-23 11:54:28,243 INFO L168 Benchmark]: Boogie Preprocessor took 32.90 ms. Allocated memory is still 306.7 MB. Free memory was 241.5 MB in the beginning and 239.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-03-23 11:54:28,244 INFO L168 Benchmark]: RCFGBuilder took 333.99 ms. Allocated memory was 306.7 MB in the beginning and 468.7 MB in the end (delta: 162.0 MB). Free memory was 239.4 MB in the beginning and 435.6 MB in the end (delta: -196.2 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. [2018-03-23 11:54:28,244 INFO L168 Benchmark]: TraceAbstraction took 9265.88 ms. Allocated memory was 468.7 MB in the beginning and 613.9 MB in the end (delta: 145.2 MB). Free memory was 435.6 MB in the beginning and 529.9 MB in the end (delta: -94.3 MB). Peak memory consumption was 242.4 MB. Max. memory is 5.3 GB. [2018-03-23 11:54:28,246 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 306.7 MB. Free memory is still 270.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 197.57 ms. Allocated memory is still 306.7 MB. Free memory was 250.6 MB in the beginning and 241.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.90 ms. Allocated memory is still 306.7 MB. Free memory was 241.5 MB in the beginning and 239.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 333.99 ms. Allocated memory was 306.7 MB in the beginning and 468.7 MB in the end (delta: 162.0 MB). Free memory was 239.4 MB in the beginning and 435.6 MB in the end (delta: -196.2 MB). Peak memory consumption was 24.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9265.88 ms. Allocated memory was 468.7 MB in the beginning and 613.9 MB in the end (delta: 145.2 MB). Free memory was 435.6 MB in the beginning and 529.9 MB in the end (delta: -94.3 MB). Peak memory consumption was 242.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 30]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 23]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 27]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant [2018-03-23 11:54:28,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,250 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,251 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,251 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((\valid == \old(\valid)[mask := 1] && 32 == unknown-#length-unknown[mask]) && 0 == mask) && 1 <= i) && \old(\valid)[mask] == 0) || ((((\valid == \old(\valid)[mask := 1] && 32 == unknown-#length-unknown[mask]) && 0 == mask) && i == 0) && \old(\valid)[mask] == 0) - InvariantResult [Line: 17]: Loop Invariant [2018-03-23 11:54:28,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,253 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,254 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,255 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,255 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,255 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((!(0 == b) || !(\valid[b] == 1)) || !(unknown-#length-unknown[b] == 32)) || 1 < \old(size)) || (i <= 2 && size <= 1)) && (((((!(0 == b) || !(\valid[b] == 1)) || (((((1 == \valid[b] && unknown-#length-unknown[b] == 32) && size <= 31) && \old(size) <= size) && b == 0) && 0 == i)) || !(unknown-#length-unknown[b] == 32)) || (((((1 == \valid[b] && 1 <= b + i) && unknown-#length-unknown[b] == 32) && size <= 31) && \old(size) <= size) && b == 0)) || 31 < \old(size))) && ((((!(0 == b) || !(\valid[b] == 1)) || !(0 == \old(size))) || !(unknown-#length-unknown[b] == 32)) || (size == 0 && \old(size) + i <= size + 1)) - InvariantResult [Line: 29]: Loop Invariant [2018-03-23 11:54:28,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,256 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-03-23 11:54:28,257 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((\valid == \old(\valid)[mask := 1] && 32 == unknown-#length-unknown[mask]) && 0 == mask) && 1 <= i) && \old(\valid)[mask] == 0) || ((((\valid == \old(\valid)[mask := 1] && 32 == unknown-#length-unknown[mask]) && 0 == mask) && i == 0) && \old(\valid)[mask] == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 6 error locations. SAFE Result, 9.1s OverallTime, 16 OverallIterations, 9 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 800 SDtfs, 1657 SDslu, 3831 SDs, 0 SdLazy, 2669 SolverSat, 219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1287 GetRequests, 969 SyntacticMatches, 29 SemanticMatches, 289 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1517 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=12, 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.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 189 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 33 PreInvPairs, 60 NumberOfFragments, 283 HoareAnnotationTreeSize, 33 FomulaSimplifications, 1061 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 972 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2171 NumberOfCodeBlocks, 1963 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2143 ConstructedInterpolants, 181 QuantifiedInterpolants, 788392 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1716 ConjunctsInSsa, 135 ConjunctsInUnsatCore, 28 InterpolantComputations, 8 PerfectInterpolantSequences, 2320/2510 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-03-23_11-54-28-262.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-03-23_11-54-28-262.csv Received shutdown request...