./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength_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/ArraysOfVariableLength_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 a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:11,908 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:50:11,910 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:50:11,922 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:50:11,922 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:50:11,923 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:50:11,925 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:50:11,927 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:50:11,929 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:50:11,930 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:50:11,931 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:50:11,931 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:50:11,932 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:50:11,933 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:50:11,935 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:50:11,936 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:50:11,937 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:50:11,939 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:50:11,941 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:50:11,943 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:50:11,945 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:50:11,946 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:50:11,949 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:50:11,950 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:50:11,950 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:50:11,951 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:50:11,952 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:50:11,953 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:50:11,955 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:50:11,956 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:50:11,956 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:50:11,957 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:50:11,957 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:50:11,957 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:50:11,958 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:50:11,959 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:50:11,959 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:11,977 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:50:11,977 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:50:11,978 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:50:11,978 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:50:11,980 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:50:11,981 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:50:11,981 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:50:11,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:50:11,982 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:50:11,982 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:50:11,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:50:11,982 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:50:11,983 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:50:11,983 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:50:11,983 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:50:11,983 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:50:11,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:50:11,983 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:50:11,986 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:50:11,986 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:50:11,986 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:50:11,986 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:50:11,986 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:50:11,987 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:50:11,988 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:50:11,988 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:50:11,988 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:50:11,988 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:50:11,989 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 -> a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 [2018-11-28 22:50:12,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:50:12,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:50:12,071 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:50:12,072 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:50:12,073 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:50:12,075 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-11-28 22:50:12,149 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c53f6d2/8828a143dbc24e858cb049c8caedb5e9/FLAG3e4aabf74 [2018-11-28 22:50:12,612 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:50:12,613 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-11-28 22:50:12,619 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c53f6d2/8828a143dbc24e858cb049c8caedb5e9/FLAG3e4aabf74 [2018-11-28 22:50:12,970 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c53f6d2/8828a143dbc24e858cb049c8caedb5e9 [2018-11-28 22:50:12,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:50:12,976 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:50:12,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:50:12,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:50:12,982 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:50:12,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:50:12" (1/1) ... [2018-11-28 22:50:12,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1b49a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:12, skipping insertion in model container [2018-11-28 22:50:12,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:50:12" (1/1) ... [2018-11-28 22:50:12,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:50:13,018 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:50:13,228 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:50:13,246 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:50:13,268 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:50:13,289 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:50:13,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:13 WrapperNode [2018-11-28 22:50:13,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:50:13,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:50:13,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:50:13,292 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:50:13,308 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:13" (1/1) ... [2018-11-28 22:50:13,309 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:13" (1/1) ... [2018-11-28 22:50:13,319 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:13" (1/1) ... [2018-11-28 22:50:13,319 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:13" (1/1) ... [2018-11-28 22:50:13,328 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:13" (1/1) ... [2018-11-28 22:50:13,335 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:13" (1/1) ... [2018-11-28 22:50:13,336 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:13" (1/1) ... [2018-11-28 22:50:13,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:50:13,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:50:13,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:50:13,339 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:50:13,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:13" (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:13,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:50:13,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:50:13,470 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-28 22:50:13,470 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:50:13,471 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-28 22:50:13,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 22:50:13,471 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:50:13,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:50:13,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 22:50:13,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:50:13,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:50:13,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:50:13,956 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:50:13,956 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-28 22:50:13,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:50:13 BoogieIcfgContainer [2018-11-28 22:50:13,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:50:13,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:50:13,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:50:13,962 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:50:13,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:50:12" (1/3) ... [2018-11-28 22:50:13,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673c51d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:50:13, skipping insertion in model container [2018-11-28 22:50:13,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:50:13" (2/3) ... [2018-11-28 22:50:13,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673c51d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:50:13, skipping insertion in model container [2018-11-28 22:50:13,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:50:13" (3/3) ... [2018-11-28 22:50:13,966 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-11-28 22:50:13,976 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:50:13,985 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-28 22:50:14,001 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-28 22:50:14,028 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:50:14,029 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:50:14,029 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:50:14,030 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:50:14,030 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:50:14,030 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:50:14,030 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:50:14,030 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:50:14,031 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:50:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-28 22:50:14,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:50:14,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:14,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:14,063 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:14,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:14,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2018-11-28 22:50:14,071 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:14,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:14,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:14,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:14,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:14,239 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:14,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:14,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:50:14,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:50:14,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:50:14,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:50:14,264 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-11-28 22:50:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:14,394 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-11-28 22:50:14,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:50:14,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:50:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:14,408 INFO L225 Difference]: With dead ends: 58 [2018-11-28 22:50:14,408 INFO L226 Difference]: Without dead ends: 54 [2018-11-28 22:50:14,410 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:14,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-28 22:50:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-11-28 22:50:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-28 22:50:14,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-28 22:50:14,457 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2018-11-28 22:50:14,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:14,458 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-28 22:50:14,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:50:14,458 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-28 22:50:14,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-28 22:50:14,459 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:14,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:14,459 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:14,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:14,459 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2018-11-28 22:50:14,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:14,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:14,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:14,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:14,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:14,606 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:14,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:14,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:50:14,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:50:14,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:50:14,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:50:14,610 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-11-28 22:50:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:14,964 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2018-11-28 22:50:14,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:50:14,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-28 22:50:14,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:14,967 INFO L225 Difference]: With dead ends: 59 [2018-11-28 22:50:14,967 INFO L226 Difference]: Without dead ends: 59 [2018-11-28 22:50:14,968 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:14,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-28 22:50:14,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2018-11-28 22:50:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 22:50:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-28 22:50:14,976 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2018-11-28 22:50:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:14,976 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-28 22:50:14,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:50:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-28 22:50:14,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:50:14,977 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:14,977 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:14,978 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:14,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:14,978 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2018-11-28 22:50:14,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:14,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:14,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:14,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:14,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:15,052 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:15,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:15,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:50:15,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:50:15,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:50:15,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:50:15,058 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2018-11-28 22:50:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:15,129 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-11-28 22:50:15,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:50:15,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-28 22:50:15,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:15,133 INFO L225 Difference]: With dead ends: 43 [2018-11-28 22:50:15,133 INFO L226 Difference]: Without dead ends: 43 [2018-11-28 22:50:15,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:50:15,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-28 22:50:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-28 22:50:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 22:50:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-11-28 22:50:15,140 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 15 [2018-11-28 22:50:15,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:15,140 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-11-28 22:50:15,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:50:15,140 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-11-28 22:50:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:50:15,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:15,141 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:15,141 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:15,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:15,142 INFO L82 PathProgramCache]: Analyzing trace with hash 143250927, now seen corresponding path program 1 times [2018-11-28 22:50:15,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:15,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:15,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:15,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:15,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:15,241 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:15,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:15,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:50:15,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:50:15,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:50:15,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:50:15,246 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 3 states. [2018-11-28 22:50:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:15,421 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-11-28 22:50:15,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:50:15,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-28 22:50:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:15,423 INFO L225 Difference]: With dead ends: 47 [2018-11-28 22:50:15,424 INFO L226 Difference]: Without dead ends: 47 [2018-11-28 22:50:15,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:50:15,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-28 22:50:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-11-28 22:50:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 22:50:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-11-28 22:50:15,430 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2018-11-28 22:50:15,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:15,431 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-11-28 22:50:15,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:50:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-11-28 22:50:15,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 22:50:15,432 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:15,432 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:15,433 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:15,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:15,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1902162976, now seen corresponding path program 1 times [2018-11-28 22:50:15,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:15,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:15,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:15,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:15,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:15,495 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:15,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:15,495 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:15,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:15,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:15,585 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:15,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:15,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 22:50:15,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:50:15,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:50:15,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:50:15,608 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2018-11-28 22:50:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:15,769 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-28 22:50:15,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:50:15,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-28 22:50:15,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:15,773 INFO L225 Difference]: With dead ends: 69 [2018-11-28 22:50:15,773 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 22:50:15,773 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:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 22:50:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2018-11-28 22:50:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 22:50:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-28 22:50:15,781 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2018-11-28 22:50:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:15,781 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-28 22:50:15,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:50:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-28 22:50:15,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 22:50:15,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:15,782 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:15,783 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:15,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:15,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1165178250, now seen corresponding path program 1 times [2018-11-28 22:50:15,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:15,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:15,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:15,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:15,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 22:50:15,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:15,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:50:15,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:50:15,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:50:15,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:50:15,894 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-11-28 22:50:16,066 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 22:50:16,357 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 22:50:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:16,493 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-11-28 22:50:16,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:50:16,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-28 22:50:16,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:16,495 INFO L225 Difference]: With dead ends: 62 [2018-11-28 22:50:16,495 INFO L226 Difference]: Without dead ends: 62 [2018-11-28 22:50:16,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:50:16,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-28 22:50:16,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2018-11-28 22:50:16,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 22:50:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-11-28 22:50:16,502 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2018-11-28 22:50:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:16,503 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-11-28 22:50:16,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:50:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-28 22:50:16,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:50:16,505 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:16,506 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:16,506 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:16,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:16,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787427, now seen corresponding path program 1 times [2018-11-28 22:50:16,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:16,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:16,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:16,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:16,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:16,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:16,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:50:16,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:50:16,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:50:16,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:50:16,600 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 5 states. [2018-11-28 22:50:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:16,719 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-28 22:50:16,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:50:16,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-28 22:50:16,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:16,722 INFO L225 Difference]: With dead ends: 53 [2018-11-28 22:50:16,722 INFO L226 Difference]: Without dead ends: 53 [2018-11-28 22:50:16,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:50:16,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-28 22:50:16,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-28 22:50:16,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 22:50:16,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-28 22:50:16,730 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2018-11-28 22:50:16,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:16,730 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-28 22:50:16,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:50:16,731 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-28 22:50:16,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 22:50:16,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:16,731 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:16,732 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:16,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:16,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787428, now seen corresponding path program 1 times [2018-11-28 22:50:16,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:16,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:16,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:16,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:16,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:50:17,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:17,028 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:17,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:17,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:17,098 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 22:50:17,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:17,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:50:17,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 22:50:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 22:50:17,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:50:17,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2018-11-28 22:50:17,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 22:50:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 22:50:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-28 22:50:17,310 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 12 states. [2018-11-28 22:50:17,596 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-11-28 22:50:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:18,008 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-28 22:50:18,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 22:50:18,009 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-11-28 22:50:18,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:18,010 INFO L225 Difference]: With dead ends: 64 [2018-11-28 22:50:18,010 INFO L226 Difference]: Without dead ends: 64 [2018-11-28 22:50:18,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-11-28 22:50:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-28 22:50:18,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2018-11-28 22:50:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 22:50:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-28 22:50:18,019 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2018-11-28 22:50:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:18,019 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-28 22:50:18,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 22:50:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-28 22:50:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 22:50:18,020 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:18,021 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:18,021 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:18,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:18,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1134972881, now seen corresponding path program 1 times [2018-11-28 22:50:18,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:18,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:18,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:18,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:18,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 22:50:18,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:50:18,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:50:18,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:50:18,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:50:18,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:50:18,198 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 6 states. [2018-11-28 22:50:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:18,279 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-11-28 22:50:18,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:50:18,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-28 22:50:18,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:18,282 INFO L225 Difference]: With dead ends: 52 [2018-11-28 22:50:18,282 INFO L226 Difference]: Without dead ends: 52 [2018-11-28 22:50:18,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:50:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-28 22:50:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-28 22:50:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-28 22:50:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-11-28 22:50:18,288 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 26 [2018-11-28 22:50:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:18,289 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-11-28 22:50:18,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:50:18,289 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-28 22:50:18,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 22:50:18,290 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:18,290 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:18,290 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:18,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:18,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1992931931, now seen corresponding path program 1 times [2018-11-28 22:50:18,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:18,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:18,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:18,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:18,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:18,551 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:18,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:18,552 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:18,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:18,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:18,645 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:18,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:18,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2018-11-28 22:50:18,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 22:50:18,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 22:50:18,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:50:18,667 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 11 states. [2018-11-28 22:50:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:19,191 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-11-28 22:50:19,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:50:19,193 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-11-28 22:50:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:19,195 INFO L225 Difference]: With dead ends: 78 [2018-11-28 22:50:19,195 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 22:50:19,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-11-28 22:50:19,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 22:50:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2018-11-28 22:50:19,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 22:50:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-11-28 22:50:19,202 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 27 [2018-11-28 22:50:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:19,202 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-11-28 22:50:19,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 22:50:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-11-28 22:50:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 22:50:19,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:19,204 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] [2018-11-28 22:50:19,204 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:19,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:19,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1979886526, now seen corresponding path program 2 times [2018-11-28 22:50:19,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:19,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:19,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:19,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:19,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 22:50:19,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:19,271 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:19,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:50:19,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 22:50:19,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:50:19,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:19,322 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 22:50:19,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:19,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:50:19,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 22:50:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 22:50:19,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:50:19,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2018-11-28 22:50:19,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:50:19,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:50:19,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:50:19,590 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 9 states. [2018-11-28 22:50:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:19,915 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-11-28 22:50:19,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 22:50:19,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-11-28 22:50:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:19,918 INFO L225 Difference]: With dead ends: 89 [2018-11-28 22:50:19,918 INFO L226 Difference]: Without dead ends: 89 [2018-11-28 22:50:19,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-11-28 22:50:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-28 22:50:19,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2018-11-28 22:50:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-28 22:50:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-11-28 22:50:19,925 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 32 [2018-11-28 22:50:19,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:19,925 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-11-28 22:50:19,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:50:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-11-28 22:50:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-28 22:50:19,928 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:19,928 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:19,928 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:19,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:19,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2014379143, now seen corresponding path program 2 times [2018-11-28 22:50:19,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:19,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:19,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:19,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:50:19,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 22:50:20,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:20,097 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:20,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:50:20,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 22:50:20,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:50:20,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 22:50:20,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:50:20,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2018-11-28 22:50:20,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 22:50:20,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 22:50:20,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-28 22:50:20,230 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 14 states. [2018-11-28 22:50:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:20,883 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-11-28 22:50:20,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 22:50:20,884 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-28 22:50:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:20,885 INFO L225 Difference]: With dead ends: 95 [2018-11-28 22:50:20,886 INFO L226 Difference]: Without dead ends: 89 [2018-11-28 22:50:20,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-11-28 22:50:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-28 22:50:20,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2018-11-28 22:50:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-28 22:50:20,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-11-28 22:50:20,892 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 38 [2018-11-28 22:50:20,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:20,892 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-11-28 22:50:20,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 22:50:20,893 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-11-28 22:50:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 22:50:20,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:20,894 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:20,894 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:20,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash -174164318, now seen corresponding path program 3 times [2018-11-28 22:50:20,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:20,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:20,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:20,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:50:20,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:21,527 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 22:50:21,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:21,528 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:21,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 22:50:21,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-28 22:50:21,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:50:21,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 22:50:21,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:21,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-11-28 22:50:21,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:50:21,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:50:21,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:50:21,598 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 7 states. [2018-11-28 22:50:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:21,708 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-11-28 22:50:21,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:50:21,709 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-11-28 22:50:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:21,711 INFO L225 Difference]: With dead ends: 82 [2018-11-28 22:50:21,711 INFO L226 Difference]: Without dead ends: 82 [2018-11-28 22:50:21,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:50:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-28 22:50:21,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-11-28 22:50:21,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-28 22:50:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2018-11-28 22:50:21,717 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 43 [2018-11-28 22:50:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:21,718 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2018-11-28 22:50:21,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:50:21,718 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2018-11-28 22:50:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 22:50:21,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:21,720 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:50:21,720 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:21,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:21,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2125667663, now seen corresponding path program 1 times [2018-11-28 22:50:21,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:21,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:21,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:21,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 22:50:21,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-28 22:50:21,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:21,839 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:21,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:21,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 22:50:22,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:50:22,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-11-28 22:50:22,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 22:50:22,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 22:50:22,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:50:22,024 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 13 states. [2018-11-28 22:50:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:22,379 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-11-28 22:50:22,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 22:50:22,380 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-11-28 22:50:22,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:22,382 INFO L225 Difference]: With dead ends: 123 [2018-11-28 22:50:22,382 INFO L226 Difference]: Without dead ends: 120 [2018-11-28 22:50:22,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2018-11-28 22:50:22,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-28 22:50:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2018-11-28 22:50:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 22:50:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-11-28 22:50:22,389 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 72 [2018-11-28 22:50:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:22,389 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-11-28 22:50:22,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 22:50:22,390 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-28 22:50:22,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-28 22:50:22,393 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:50:22,393 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 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:22,393 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-11-28 22:50:22,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:50:22,394 INFO L82 PathProgramCache]: Analyzing trace with hash 241209475, now seen corresponding path program 2 times [2018-11-28 22:50:22,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:50:22,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:50:22,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:22,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:50:22,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:50:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:50:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-11-28 22:50:23,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:50:23,069 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:23,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 22:50:23,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 22:50:23,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 22:50:23,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:50:23,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:23,362 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 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-28 22:50:23,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:23,364 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:23,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-11-28 22:50:23,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:23,447 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 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-28 22:50:23,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:23,453 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:23,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-11-28 22:50:23,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:23,520 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 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-28 22:50:23,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:23,522 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:23,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-11-28 22:50:23,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:23,576 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 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-28 22:50:23,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:23,578 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:23,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-11-28 22:50:23,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:50:23,645 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 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-28 22:50:23,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:50:23,649 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:23,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-11-28 22:50:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2018-11-28 22:50:24,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 22:50:24,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2018-11-28 22:50:24,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 22:50:24,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 22:50:24,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2018-11-28 22:50:24,179 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 12 states. [2018-11-28 22:50:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:50:25,116 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-11-28 22:50:25,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 22:50:25,117 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-11-28 22:50:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:50:25,118 INFO L225 Difference]: With dead ends: 122 [2018-11-28 22:50:25,118 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 22:50:25,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=162, Invalid=437, Unknown=1, NotChecked=0, Total=600 [2018-11-28 22:50:25,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 22:50:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 22:50:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 22:50:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 22:50:25,120 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-11-28 22:50:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:50:25,123 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 22:50:25,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 22:50:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 22:50:25,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 22:50:25,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:50:25 BoogieIcfgContainer [2018-11-28 22:50:25,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:50:25,137 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:50:25,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:50:25,137 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:50:25,138 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:13" (3/4) ... [2018-11-28 22:50:25,143 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 22:50:25,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 22:50:25,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2018-11-28 22:50:25,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 22:50:25,161 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-28 22:50:25,162 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-28 22:50:25,162 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 22:50:25,162 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 22:50:25,219 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 22:50:25,219 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:50:25,220 INFO L168 Benchmark]: Toolchain (without parser) took 12245.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 160.4 MB). Free memory was 952.7 MB in the beginning and 778.8 MB in the end (delta: 173.9 MB). Peak memory consumption was 334.3 MB. Max. memory is 11.5 GB. [2018-11-28 22:50:25,221 INFO L168 Benchmark]: CDTParser took 0.21 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:25,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.25 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-28 22:50:25,222 INFO L168 Benchmark]: Boogie Preprocessor took 46.54 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:25,223 INFO L168 Benchmark]: RCFGBuilder took 618.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.0 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -108.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-11-28 22:50:25,224 INFO L168 Benchmark]: TraceAbstraction took 11178.40 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 85.5 MB). Free memory was 1.0 GB in the beginning and 778.8 MB in the end (delta: 270.1 MB). Peak memory consumption was 355.5 MB. Max. memory is 11.5 GB. [2018-11-28 22:50:25,224 INFO L168 Benchmark]: Witness Printer took 82.48 ms. Allocated memory is still 1.2 GB. Free memory is still 778.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:50:25,227 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.21 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 314.25 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.54 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 618.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.0 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -108.3 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11178.40 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 85.5 MB). Free memory was 1.0 GB in the beginning and 778.8 MB in the end (delta: 270.1 MB). Peak memory consumption was 355.5 MB. Max. memory is 11.5 GB. * Witness Printer took 82.48 ms. Allocated memory is still 1.2 GB. Free memory is still 778.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: 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, 11.1s OverallTime, 15 OverallIterations, 7 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 383 SDtfs, 897 SDslu, 1024 SDs, 0 SdLazy, 1413 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 346 SyntacticMatches, 15 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=14, 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, 15 MinimizatonAttempts, 134 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 840 NumberOfCodeBlocks, 712 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 817 ConstructedInterpolants, 76 QuantifiedInterpolants, 158485 SizeOfPredicates, 15 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 754/881 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...