./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32d9f155778c5c4efaa55d37fdad329bb0d271b5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 22:50:09,976 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:50:09,978 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:50:09,991 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:50:09,991 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:50:09,992 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:50:09,993 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:50:09,995 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:50:09,997 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:50:09,998 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:50:09,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:50:09,999 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:50:10,000 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:50:10,001 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:50:10,002 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:50:10,003 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:50:10,004 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:50:10,006 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:50:10,008 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:50:10,010 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:50:10,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:50:10,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:50:10,015 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:50:10,015 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:50:10,015 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:50:10,016 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:50:10,017 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:50:10,018 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:50:10,019 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:50:10,020 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:50:10,020 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:50:10,021 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:50:10,021 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:50:10,021 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:50:10,022 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:50:10,023 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:50:10,023 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:50:10,038 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:50:10,038 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:50:10,039 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:50:10,039 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:50:10,040 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:50:10,040 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:50:10,040 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:50:10,040 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:50:10,041 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:50:10,041 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:50:10,041 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:50:10,041 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:50:10,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:50:10,041 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:50:10,042 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:50:10,042 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:50:10,042 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:50:10,042 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:50:10,042 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:50:10,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:50:10,043 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:50:10,043 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:50:10,043 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:50:10,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:50:10,043 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:50:10,044 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:50:10,044 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:50:10,044 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:50:10,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 32d9f155778c5c4efaa55d37fdad329bb0d271b5 [2018-11-28 22:50:10,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:50:10,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:50:10,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:50:10,135 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:50:10,136 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:50:10,138 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-11-28 22:50:10,205 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba94b326/da1bd4f4de13420995b27124622a5a8c/FLAGb6a693802 [2018-11-28 22:50:10,660 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:50:10,660 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength5_true-valid-memsafety.c [2018-11-28 22:50:10,667 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba94b326/da1bd4f4de13420995b27124622a5a8c/FLAGb6a693802 [2018-11-28 22:50:11,047 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ba94b326/da1bd4f4de13420995b27124622a5a8c [2018-11-28 22:50:11,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:50:11,052 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:50:11,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:50:11,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:50:11,057 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:50:11,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:50:11" (1/1) ... [2018-11-28 22:50:11,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337a30ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:11, skipping insertion in model container [2018-11-28 22:50:11,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:50:11" (1/1) ... [2018-11-28 22:50:11,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:50:11,094 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:50:11,337 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:50:11,358 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:50:11,382 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:50:11,409 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:50:11,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:11 WrapperNode [2018-11-28 22:50:11,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:50:11,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:50:11,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:50:11,412 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:50:11,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:11" (1/1) ... [2018-11-28 22:50:11,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:11" (1/1) ... [2018-11-28 22:50:11,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:11" (1/1) ... [2018-11-28 22:50:11,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:11" (1/1) ... [2018-11-28 22:50:11,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:11" (1/1) ... [2018-11-28 22:50:11,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:11" (1/1) ... [2018-11-28 22:50:11,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:11" (1/1) ... [2018-11-28 22:50:11,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:50:11,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:50:11,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:50:11,477 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:50:11,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:11" (1/1) ... No working directory specified, using /storage/repos/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-11-28 22:50:11,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:50:11,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:50:11,616 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-28 22:50:11,616 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:50:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-28 22:50:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:50:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:50:11,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:50:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:50:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:50:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:50:11,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:50:12,117 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:50:12,117 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 22:50:12,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:50:12 BoogieIcfgContainer [2018-11-28 22:50:12,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:50:12,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:50:12,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:50:12,123 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:50:12,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:50:11" (1/3) ... [2018-11-28 22:50:12,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4958e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:50:12, skipping insertion in model container [2018-11-28 22:50:12,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:11" (2/3) ... [2018-11-28 22:50:12,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d4958e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:50:12, skipping insertion in model container [2018-11-28 22:50:12,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:50:12" (3/3) ... [2018-11-28 22:50:12,128 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength5_true-valid-memsafety.c [2018-11-28 22:50:12,138 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:50:12,147 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-28 22:50:12,164 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-28 22:50:12,191 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:50:12,192 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:50:12,192 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:50:12,192 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:50:12,192 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:50:12,193 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:50:12,193 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:50:12,193 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:50:12,193 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:50:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-28 22:50:12,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:50:12,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:12,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:12,221 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:12,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:12,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2018-11-28 22:50:12,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:12,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:12,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:12,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:12,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:12,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:12,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:50:12,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:50:12,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:50:12,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:50:12,423 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-11-28 22:50:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:12,581 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-11-28 22:50:12,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:50:12,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:50:12,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:12,592 INFO L225 Difference]: With dead ends: 58 [2018-11-28 22:50:12,592 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 22:50:12,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:50:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 22:50:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-11-28 22:50:12,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 22:50:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-28 22:50:12,638 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2018-11-28 22:50:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:12,638 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-28 22:50:12,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:50:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-28 22:50:12,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:50:12,639 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:12,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:12,640 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:12,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:12,640 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2018-11-28 22:50:12,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:12,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:12,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:12,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:12,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:12,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:12,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:50:12,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:50:12,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:50:12,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:50:12,809 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-11-28 22:50:13,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:13,166 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-28 22:50:13,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:50:13,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-28 22:50:13,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:13,170 INFO L225 Difference]: With dead ends: 59 [2018-11-28 22:50:13,170 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 22:50:13,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:50:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 22:50:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2018-11-28 22:50:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 22:50:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-28 22:50:13,179 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2018-11-28 22:50:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:13,179 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-28 22:50:13,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:50:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-28 22:50:13,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:50:13,180 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:13,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:13,181 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:13,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:13,181 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2018-11-28 22:50:13,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:13,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:13,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:13,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:13,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:50:13,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:50:13,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:50:13,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:50:13,330 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2018-11-28 22:50:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:13,408 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-28 22:50:13,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:50:13,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-28 22:50:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:13,412 INFO L225 Difference]: With dead ends: 43 [2018-11-28 22:50:13,412 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 22:50:13,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:50:13,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 22:50:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 22:50:13,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 22:50:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-28 22:50:13,419 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 15 [2018-11-28 22:50:13,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:13,419 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-28 22:50:13,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:50:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-28 22:50:13,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:50:13,420 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:13,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:13,420 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:13,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:13,421 INFO L82 PathProgramCache]: Analyzing trace with hash 143250927, now seen corresponding path program 1 times [2018-11-28 22:50:13,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:13,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:13,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:13,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:13,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:13,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:13,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:50:13,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:50:13,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:50:13,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:50:13,553 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2018-11-28 22:50:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:13,785 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-11-28 22:50:13,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:50:13,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-28 22:50:13,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:13,788 INFO L225 Difference]: With dead ends: 47 [2018-11-28 22:50:13,788 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 22:50:13,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:50:13,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 22:50:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-28 22:50:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 22:50:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-28 22:50:13,795 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2018-11-28 22:50:13,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:13,795 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-28 22:50:13,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:50:13,796 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-28 22:50:13,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 22:50:13,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:13,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:13,797 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:13,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:13,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1902162976, now seen corresponding path program 1 times [2018-11-28 22:50:13,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:13,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:13,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:13,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:13,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:13,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:13,872 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-28 22:50:13,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:13,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:13,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:13,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 22:50:13,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:50:13,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:50:13,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:50:13,992 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2018-11-28 22:50:14,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:14,232 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-28 22:50:14,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:50:14,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-28 22:50:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:14,235 INFO L225 Difference]: With dead ends: 69 [2018-11-28 22:50:14,235 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 22:50:14,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:50:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 22:50:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2018-11-28 22:50:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 22:50:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-28 22:50:14,244 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2018-11-28 22:50:14,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:14,245 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-28 22:50:14,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:50:14,246 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-28 22:50:14,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 22:50:14,247 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:14,247 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:14,248 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:14,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:14,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1165178250, now seen corresponding path program 1 times [2018-11-28 22:50:14,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:14,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:14,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:14,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:14,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:14,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:14,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-28 22:50:14,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:14,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 22:50:14,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:50:14,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2018-11-28 22:50:14,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:50:14,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:50:14,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:50:14,680 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 7 states. [2018-11-28 22:50:15,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:15,147 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-11-28 22:50:15,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:50:15,148 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-28 22:50:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:15,150 INFO L225 Difference]: With dead ends: 101 [2018-11-28 22:50:15,150 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 22:50:15,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:50:15,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 22:50:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 54. [2018-11-28 22:50:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 22:50:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-11-28 22:50:15,164 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2018-11-28 22:50:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:15,165 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-11-28 22:50:15,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:50:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-28 22:50:15,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:50:15,166 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:15,166 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:15,167 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:15,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:15,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787427, now seen corresponding path program 1 times [2018-11-28 22:50:15,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:15,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:15,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:15,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:15,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 22:50:15,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:15,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-28 22:50:15,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:15,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:15,315 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:50:15,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2018-11-28 22:50:15,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:15,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:50:15,349 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-11-28 22:50:15,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2018-11-28 22:50:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 22:50:15,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:15,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 6 [2018-11-28 22:50:15,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:50:15,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:50:15,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:50:15,443 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 7 states. [2018-11-28 22:50:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:15,622 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-28 22:50:15,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:50:15,623 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-28 22:50:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:15,624 INFO L225 Difference]: With dead ends: 53 [2018-11-28 22:50:15,624 INFO L226 Difference]: Without dead ends: 53 [2018-11-28 22:50:15,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:50:15,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-28 22:50:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-28 22:50:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 22:50:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-28 22:50:15,635 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2018-11-28 22:50:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:15,636 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-28 22:50:15,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:50:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-28 22:50:15,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:50:15,637 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:15,637 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:15,637 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:15,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:15,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787428, now seen corresponding path program 1 times [2018-11-28 22:50:15,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:15,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:15,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:15,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:15,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:15,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 22:50:15,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:15,832 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-28 22:50:15,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:15,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:15,874 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:50:15,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:15,990 INFO L478 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:50:15,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 22:50:16,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:50:16,037 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 2 xjuncts. [2018-11-28 22:50:16,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:24 [2018-11-28 22:50:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 22:50:16,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:16,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-11-28 22:50:16,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:50:16,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:50:16,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:50:16,144 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 9 states. [2018-11-28 22:50:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:16,667 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-11-28 22:50:16,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:50:16,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-28 22:50:16,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:16,670 INFO L225 Difference]: With dead ends: 55 [2018-11-28 22:50:16,670 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 22:50:16,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-28 22:50:16,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 22:50:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-11-28 22:50:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 22:50:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-28 22:50:16,677 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2018-11-28 22:50:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:16,679 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-28 22:50:16,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:50:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-28 22:50:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 22:50:16,681 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:16,681 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:16,681 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:16,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1134972881, now seen corresponding path program 1 times [2018-11-28 22:50:16,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:16,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:16,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:16,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:16,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 22:50:16,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:16,791 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-28 22:50:16,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:16,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 22:50:16,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:50:16,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2018-11-28 22:50:16,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:50:16,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:50:16,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:50:16,897 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 9 states. [2018-11-28 22:50:17,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:17,087 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-11-28 22:50:17,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:50:17,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-28 22:50:17,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:17,090 INFO L225 Difference]: With dead ends: 62 [2018-11-28 22:50:17,090 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 22:50:17,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:50:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 22:50:17,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-11-28 22:50:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 22:50:17,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-28 22:50:17,096 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 26 [2018-11-28 22:50:17,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:17,097 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-28 22:50:17,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:50:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-28 22:50:17,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 22:50:17,098 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:17,098 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:17,098 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:17,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1992931931, now seen corresponding path program 1 times [2018-11-28 22:50:17,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:17,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:17,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:17,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:17,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:17,217 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:17,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:17,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-28 22:50:17,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:17,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:17,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:17,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-11-28 22:50:17,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 22:50:17,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 22:50:17,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:50:17,832 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 11 states. [2018-11-28 22:50:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:18,101 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-11-28 22:50:18,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:50:18,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-28 22:50:18,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:18,104 INFO L225 Difference]: With dead ends: 79 [2018-11-28 22:50:18,104 INFO L226 Difference]: Without dead ends: 79 [2018-11-28 22:50:18,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-11-28 22:50:18,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-28 22:50:18,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-11-28 22:50:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-28 22:50:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-11-28 22:50:18,110 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 27 [2018-11-28 22:50:18,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:18,111 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-11-28 22:50:18,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 22:50:18,111 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-11-28 22:50:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 22:50:18,112 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:18,112 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:18,112 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:18,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:18,112 INFO L82 PathProgramCache]: Analyzing trace with hash -790766996, now seen corresponding path program 1 times [2018-11-28 22:50:18,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:18,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:18,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:18,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:18,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 22:50:18,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:18,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-28 22:50:18,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:18,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:18,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-28 22:50:18,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:18,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:50:18,492 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:18,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 22:50:18,494 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:18,507 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:50:18,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:50:18,525 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2018-11-28 22:50:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 22:50:18,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:18,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2018-11-28 22:50:18,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:50:18,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:50:18,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:50:18,903 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 7 states. [2018-11-28 22:50:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:18,991 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-11-28 22:50:18,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:50:18,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-11-28 22:50:18,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:18,994 INFO L225 Difference]: With dead ends: 67 [2018-11-28 22:50:18,995 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 22:50:18,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:50:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 22:50:19,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-11-28 22:50:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 22:50:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-11-28 22:50:19,002 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 31 [2018-11-28 22:50:19,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:19,002 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-11-28 22:50:19,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:50:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-11-28 22:50:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 22:50:19,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:19,003 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:19,005 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:19,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:19,006 INFO L82 PathProgramCache]: Analyzing trace with hash 894123677, now seen corresponding path program 1 times [2018-11-28 22:50:19,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:19,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:19,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:19,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:19,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 22:50:19,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:19,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-28 22:50:19,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:19,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 22:50:19,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:19,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 22:50:19,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:50:19,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:50:19,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:50:19,276 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 6 states. [2018-11-28 22:50:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:19,418 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-28 22:50:19,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:50:19,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-28 22:50:19,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:19,421 INFO L225 Difference]: With dead ends: 93 [2018-11-28 22:50:19,421 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 22:50:19,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:50:19,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 22:50:19,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 72. [2018-11-28 22:50:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 22:50:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-11-28 22:50:19,429 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 37 [2018-11-28 22:50:19,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:19,429 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-11-28 22:50:19,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:50:19,430 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-28 22:50:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 22:50:19,433 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:19,433 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:19,433 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:19,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:19,435 INFO L82 PathProgramCache]: Analyzing trace with hash -174164318, now seen corresponding path program 2 times [2018-11-28 22:50:19,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:19,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:19,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:19,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:19,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 22:50:20,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:20,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-28 22:50:20,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:50:20,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:50:20,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:50:20,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 22:50:20,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:20,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-11-28 22:50:20,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 22:50:20,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 22:50:20,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:50:20,763 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 15 states. [2018-11-28 22:50:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:21,126 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2018-11-28 22:50:21,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:50:21,127 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-11-28 22:50:21,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:21,129 INFO L225 Difference]: With dead ends: 117 [2018-11-28 22:50:21,130 INFO L226 Difference]: Without dead ends: 117 [2018-11-28 22:50:21,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-11-28 22:50:21,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-28 22:50:21,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2018-11-28 22:50:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-28 22:50:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2018-11-28 22:50:21,137 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 43 [2018-11-28 22:50:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:21,138 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2018-11-28 22:50:21,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 22:50:21,138 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2018-11-28 22:50:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 22:50:21,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:21,141 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:21,141 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:21,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:21,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2073773289, now seen corresponding path program 2 times [2018-11-28 22:50:21,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:21,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:21,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:21,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:50:21,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 22:50:21,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:21,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-28 22:50:21,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:50:21,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:50:21,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:50:21,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 22:50:21,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:21,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 13 [2018-11-28 22:50:21,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 22:50:21,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 22:50:21,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:50:21,794 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 13 states. [2018-11-28 22:50:22,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:22,251 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-11-28 22:50:22,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 22:50:22,252 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-11-28 22:50:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:22,254 INFO L225 Difference]: With dead ends: 122 [2018-11-28 22:50:22,254 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 22:50:22,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-11-28 22:50:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 22:50:22,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2018-11-28 22:50:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 22:50:22,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-11-28 22:50:22,262 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 47 [2018-11-28 22:50:22,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:22,262 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-11-28 22:50:22,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 22:50:22,262 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-11-28 22:50:22,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-28 22:50:22,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:22,269 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:22,269 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:22,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:22,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1381084076, now seen corresponding path program 3 times [2018-11-28 22:50:22,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:22,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:22,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:22,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:50:22,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-28 22:50:22,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:22,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-28 22:50:22,663 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 22:50:22,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-28 22:50:22,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:50:22,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:22,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-28 22:50:22,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:22,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-28 22:50:22,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:22,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 22:50:22,731 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:22,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:50:22,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:50:22,769 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2018-11-28 22:50:23,297 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 22:50:23,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:23,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-11-28 22:50:23,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 22:50:23,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 22:50:23,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:50:23,330 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 13 states. [2018-11-28 22:50:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:23,673 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-11-28 22:50:23,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:50:23,674 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-11-28 22:50:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:23,676 INFO L225 Difference]: With dead ends: 99 [2018-11-28 22:50:23,677 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 22:50:23,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-11-28 22:50:23,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 22:50:23,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-11-28 22:50:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 22:50:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-11-28 22:50:23,685 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 52 [2018-11-28 22:50:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:23,685 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-11-28 22:50:23,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 22:50:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-11-28 22:50:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-28 22:50:23,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:23,688 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:23,689 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:23,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:23,690 INFO L82 PathProgramCache]: Analyzing trace with hash 267240299, now seen corresponding path program 1 times [2018-11-28 22:50:23,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:23,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:23,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:23,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:50:23,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-28 22:50:23,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:23,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-11-28 22:50:23,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:23,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 91 proven. 7 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-28 22:50:24,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:24,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-11-28 22:50:24,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 22:50:24,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 22:50:24,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:50:24,098 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 15 states. [2018-11-28 22:50:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:24,542 INFO L93 Difference]: Finished difference Result 155 states and 162 transitions. [2018-11-28 22:50:24,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:50:24,542 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 82 [2018-11-28 22:50:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:24,544 INFO L225 Difference]: With dead ends: 155 [2018-11-28 22:50:24,545 INFO L226 Difference]: Without dead ends: 152 [2018-11-28 22:50:24,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-11-28 22:50:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-28 22:50:24,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2018-11-28 22:50:24,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-28 22:50:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-11-28 22:50:24,551 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 82 [2018-11-28 22:50:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:24,552 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-11-28 22:50:24,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 22:50:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-11-28 22:50:24,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-28 22:50:24,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:24,556 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:24,556 INFO L423 AbstractCegarLoop]: === Iteration 17 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2018-11-28 22:50:24,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash -311092151, now seen corresponding path program 2 times [2018-11-28 22:50:24,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:24,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:24,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:24,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:24,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-11-28 22:50:24,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:24,663 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:50:24,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:50:24,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 22:50:24,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:50:24,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:24,775 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:24,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 22:50:24,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 22:50:24,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:24,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:50:24,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:50:24,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-28 22:50:24,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:24,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 22:50:24,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 22:50:24,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:24,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:50:24,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:50:24,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-28 22:50:25,037 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:25,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 22:50:25,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 22:50:25,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:25,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:50:25,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:50:25,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-28 22:50:25,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:25,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 22:50:25,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 22:50:25,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:25,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:50:25,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:50:25,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-28 22:50:25,306 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:25,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-28 22:50:25,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-28 22:50:25,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:25,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:50:25,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:50:25,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-11-28 22:50:26,162 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2018-11-28 22:50:26,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:50:26,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2018-11-28 22:50:26,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 22:50:26,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 22:50:26,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2018-11-28 22:50:26,185 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 12 states. [2018-11-28 22:50:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:26,795 INFO L93 Difference]: Finished difference Result 142 states and 149 transitions. [2018-11-28 22:50:26,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 22:50:26,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2018-11-28 22:50:26,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:26,798 INFO L225 Difference]: With dead ends: 142 [2018-11-28 22:50:26,798 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:50:26,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 102 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=162, Invalid=437, Unknown=1, NotChecked=0, Total=600 [2018-11-28 22:50:26,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:50:26,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:50:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:50:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:50:26,799 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2018-11-28 22:50:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:26,800 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:50:26,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 22:50:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:50:26,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:50:26,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:50:26 BoogieIcfgContainer [2018-11-28 22:50:26,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:50:26,809 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:50:26,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:50:26,809 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:50:26,811 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:50:12" (3/4) ... [2018-11-28 22:50:26,816 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:50:26,824 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:50:26,824 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-11-28 22:50:26,824 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:50:26,830 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-11-28 22:50:26,830 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-28 22:50:26,831 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 22:50:26,831 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 22:50:26,881 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:50:26,881 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:50:26,882 INFO L168 Benchmark]: Toolchain (without parser) took 15831.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.2 MB). Free memory was 951.3 MB in the beginning and 949.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 276.3 MB. Max. memory is 11.5 GB. [2018-11-28 22:50:26,884 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:50:26,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.16 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:50:26,886 INFO L168 Benchmark]: Boogie Preprocessor took 65.35 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:50:26,886 INFO L168 Benchmark]: RCFGBuilder took 640.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-11-28 22:50:26,887 INFO L168 Benchmark]: TraceAbstraction took 14689.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.5 MB). Free memory was 1.1 GB in the beginning and 957.7 MB in the end (delta: 157.2 MB). Peak memory consumption was 286.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:50:26,889 INFO L168 Benchmark]: Witness Printer took 72.33 ms. Allocated memory is still 1.3 GB. Free memory was 957.7 MB in the beginning and 949.3 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2018-11-28 22:50:26,894 INFO L336 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 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.16 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.35 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 640.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14689.58 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.5 MB). Free memory was 1.1 GB in the beginning and 957.7 MB in the end (delta: 157.2 MB). Peak memory consumption was 286.7 MB. Max. memory is 11.5 GB. * Witness Printer took 72.33 ms. Allocated memory is still 1.3 GB. Free memory was 957.7 MB in the beginning and 949.3 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. SAFE Result, 14.6s OverallTime, 17 OverallIterations, 9 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 437 SDtfs, 1054 SDslu, 1200 SDs, 0 SdLazy, 2069 SolverSat, 230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 691 GetRequests, 504 SyntacticMatches, 27 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=16, 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, 17 MinimizatonAttempts, 227 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 1145 NumberOfCodeBlocks, 1024 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1115 ConstructedInterpolants, 152 QuantifiedInterpolants, 376130 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1634 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 30 InterpolantComputations, 7 PerfectInterpolantSequences, 1133/1320 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...