./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f 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/ArraysOfVariableLength6_true-valid-memsafety_true-termination.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 07b05923cf5c1b39a35ab81b524575a0a488c268 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 22:55:16,184 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:55:16,186 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:55:16,203 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:55:16,203 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:55:16,204 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:55:16,206 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:55:16,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:55:16,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:55:16,212 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:55:16,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:55:16,215 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:55:16,216 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:55:16,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:55:16,218 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:55:16,227 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:55:16,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:55:16,232 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:55:16,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:55:16,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:55:16,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:55:16,242 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:55:16,245 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:55:16,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:55:16,246 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:55:16,250 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:55:16,251 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:55:16,253 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:55:16,256 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:55:16,258 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:55:16,260 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:55:16,261 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:55:16,261 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:55:16,262 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:55:16,262 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:55:16,265 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:55:16,267 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 22:55:16,293 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:55:16,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:55:16,296 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:55:16,296 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:55:16,296 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:55:16,296 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:55:16,297 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:55:16,301 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:55:16,301 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:55:16,301 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:55:16,301 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:55:16,302 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:55:16,302 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:55:16,302 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:55:16,302 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:55:16,303 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:55:16,303 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:55:16,304 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:55:16,304 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:55:16,304 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:55:16,304 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:55:16,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:55:16,304 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:55:16,305 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:55:16,307 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 22:55:16,307 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:55:16,308 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 -> 07b05923cf5c1b39a35ab81b524575a0a488c268 [2019-01-13 22:55:16,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:55:16,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:55:16,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:55:16,394 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:55:16,395 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:55:16,395 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2019-01-13 22:55:16,464 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226be7da1/a131068b524048aea5c07667fba84dfd/FLAG3dae47b1e [2019-01-13 22:55:16,884 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:55:16,884 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2019-01-13 22:55:16,891 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226be7da1/a131068b524048aea5c07667fba84dfd/FLAG3dae47b1e [2019-01-13 22:55:17,265 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226be7da1/a131068b524048aea5c07667fba84dfd [2019-01-13 22:55:17,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:55:17,269 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:55:17,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:55:17,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:55:17,274 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:55:17,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:55:17" (1/1) ... [2019-01-13 22:55:17,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e6c792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:17, skipping insertion in model container [2019-01-13 22:55:17,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:55:17" (1/1) ... [2019-01-13 22:55:17,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:55:17,303 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:55:17,533 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:55:17,547 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:55:17,572 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:55:17,596 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:55:17,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:17 WrapperNode [2019-01-13 22:55:17,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:55:17,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:55:17,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:55:17,599 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:55:17,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:17" (1/1) ... [2019-01-13 22:55:17,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:17" (1/1) ... [2019-01-13 22:55:17,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:17" (1/1) ... [2019-01-13 22:55:17,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:17" (1/1) ... [2019-01-13 22:55:17,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:17" (1/1) ... [2019-01-13 22:55:17,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:17" (1/1) ... [2019-01-13 22:55:17,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:17" (1/1) ... [2019-01-13 22:55:17,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:55:17,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:55:17,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:55:17,656 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:55:17,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:17" (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 [2019-01-13 22:55:17,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:55:17,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:55:17,784 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-01-13 22:55:17,784 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:55:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-01-13 22:55:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 22:55:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:55:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 22:55:17,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 22:55:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:55:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:55:17,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:55:18,248 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:55:18,248 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-13 22:55:18,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:55:18 BoogieIcfgContainer [2019-01-13 22:55:18,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:55:18,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:55:18,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:55:18,255 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:55:18,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:55:17" (1/3) ... [2019-01-13 22:55:18,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c8f507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:55:18, skipping insertion in model container [2019-01-13 22:55:18,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:17" (2/3) ... [2019-01-13 22:55:18,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c8f507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:55:18, skipping insertion in model container [2019-01-13 22:55:18,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:55:18" (3/3) ... [2019-01-13 22:55:18,259 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength6_true-valid-memsafety_true-termination.c [2019-01-13 22:55:18,270 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:55:18,279 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-13 22:55:18,295 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-13 22:55:18,320 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:55:18,321 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:55:18,321 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:55:18,321 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:55:18,321 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:55:18,322 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:55:18,322 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:55:18,322 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:55:18,322 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:55:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-01-13 22:55:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:55:18,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:18,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:18,354 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 22:55:18,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:18,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-01-13 22:55:18,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:18,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:18,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:18,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:18,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:18,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:18,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 22:55:18,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:55:18,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:55:18,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:18,555 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-01-13 22:55:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:18,695 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-01-13 22:55:18,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:55:18,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:55:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:18,709 INFO L225 Difference]: With dead ends: 58 [2019-01-13 22:55:18,709 INFO L226 Difference]: Without dead ends: 54 [2019-01-13 22:55:18,711 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 [2019-01-13 22:55:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-13 22:55:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-01-13 22:55:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-13 22:55:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-13 22:55:18,751 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-01-13 22:55:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:18,751 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-13 22:55:18,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:55:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-13 22:55:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 22:55:18,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:18,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:18,753 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 22:55:18,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:18,753 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-01-13 22:55:18,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:18,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:18,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:18,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:18,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:55:18,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:55:18,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:55:18,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:18,820 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2019-01-13 22:55:18,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:18,898 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-01-13 22:55:18,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:55:18,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 22:55:18,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:18,902 INFO L225 Difference]: With dead ends: 49 [2019-01-13 22:55:18,902 INFO L226 Difference]: Without dead ends: 49 [2019-01-13 22:55:18,903 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 [2019-01-13 22:55:18,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-13 22:55:18,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2019-01-13 22:55:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-13 22:55:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-01-13 22:55:18,911 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2019-01-13 22:55:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:18,911 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-01-13 22:55:18,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:55:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-01-13 22:55:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 22:55:18,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:18,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:18,914 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 22:55:18,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:18,915 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2019-01-13 22:55:18,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:18,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:18,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:18,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:18,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:19,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:19,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:55:19,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:55:19,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:55:19,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:55:19,196 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2019-01-13 22:55:19,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:19,563 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-01-13 22:55:19,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:55:19,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-13 22:55:19,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:19,566 INFO L225 Difference]: With dead ends: 40 [2019-01-13 22:55:19,566 INFO L226 Difference]: Without dead ends: 40 [2019-01-13 22:55:19,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:55:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-13 22:55:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-13 22:55:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 22:55:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-13 22:55:19,573 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2019-01-13 22:55:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:19,573 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-13 22:55:19,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:55:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-13 22:55:19,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 22:55:19,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:19,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:19,574 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 22:55:19,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:19,575 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2019-01-13 22:55:19,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:19,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:19,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:19,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:19,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:19,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:19,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:55:19,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:55:19,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:55:19,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:55:19,906 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 7 states. [2019-01-13 22:55:20,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:20,193 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-01-13 22:55:20,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:55:20,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-13 22:55:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:20,196 INFO L225 Difference]: With dead ends: 42 [2019-01-13 22:55:20,196 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 22:55:20,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:55:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 22:55:20,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-01-13 22:55:20,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-13 22:55:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-13 22:55:20,204 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2019-01-13 22:55:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:20,206 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-13 22:55:20,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:55:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-13 22:55:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 22:55:20,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:20,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:20,207 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 22:55:20,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-01-13 22:55:20,208 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:20,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:20,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:20,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:20,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:55:20,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:55:20,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:55:20,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:55:20,328 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-01-13 22:55:20,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:20,407 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-01-13 22:55:20,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 22:55:20,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-13 22:55:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:20,411 INFO L225 Difference]: With dead ends: 45 [2019-01-13 22:55:20,411 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 22:55:20,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:55:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 22:55:20,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-01-13 22:55:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-13 22:55:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-13 22:55:20,418 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 15 [2019-01-13 22:55:20,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:20,419 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-13 22:55:20,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:55:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-13 22:55:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:55:20,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:20,420 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:20,420 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 22:55:20,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:20,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2019-01-13 22:55:20,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:20,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:20,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:20,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:20,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:20,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:20,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:20,758 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 [2019-01-13 22:55:20,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:20,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:20,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:20,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:20,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2019-01-13 22:55:20,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 22:55:20,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 22:55:20,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:55:20,950 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 9 states. [2019-01-13 22:55:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:21,138 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-01-13 22:55:21,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:55:21,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-13 22:55:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:21,140 INFO L225 Difference]: With dead ends: 47 [2019-01-13 22:55:21,140 INFO L226 Difference]: Without dead ends: 47 [2019-01-13 22:55:21,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-01-13 22:55:21,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-13 22:55:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-13 22:55:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-13 22:55:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-01-13 22:55:21,148 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 16 [2019-01-13 22:55:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:21,149 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-01-13 22:55:21,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 22:55:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-01-13 22:55:21,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 22:55:21,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:21,150 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:21,150 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 22:55:21,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:21,151 INFO L82 PathProgramCache]: Analyzing trace with hash -661735507, now seen corresponding path program 1 times [2019-01-13 22:55:21,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:21,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:21,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:21,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:21,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:21,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:21,542 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 [2019-01-13 22:55:21,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:21,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:21,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:21,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-01-13 22:55:21,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 22:55:21,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 22:55:21,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-01-13 22:55:21,861 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 12 states. [2019-01-13 22:55:22,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:22,167 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-01-13 22:55:22,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:55:22,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-01-13 22:55:22,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:22,171 INFO L225 Difference]: With dead ends: 59 [2019-01-13 22:55:22,171 INFO L226 Difference]: Without dead ends: 56 [2019-01-13 22:55:22,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-01-13 22:55:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-13 22:55:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2019-01-13 22:55:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-13 22:55:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-01-13 22:55:22,178 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 30 [2019-01-13 22:55:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:22,179 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-01-13 22:55:22,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 22:55:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-01-13 22:55:22,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 22:55:22,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:22,182 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:22,182 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 22:55:22,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1228723374, now seen corresponding path program 2 times [2019-01-13 22:55:22,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:22,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:22,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:22,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:22,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:22,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:22,390 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-13 22:55:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:22,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:22,551 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 [2019-01-13 22:55:22,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:55:22,586 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 22:55:22,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:22,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:22,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:22,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-13 22:55:22,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-13 22:55:22,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:22,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:22,674 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. [2019-01-13 22:55:22,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-01-13 22:55:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-01-13 22:55:22,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:55:22,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-01-13 22:55:22,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 22:55:22,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 22:55:22,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:55:22,891 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 10 states. [2019-01-13 22:55:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:23,476 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-01-13 22:55:23,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 22:55:23,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-13 22:55:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:23,479 INFO L225 Difference]: With dead ends: 62 [2019-01-13 22:55:23,480 INFO L226 Difference]: Without dead ends: 59 [2019-01-13 22:55:23,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-01-13 22:55:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-13 22:55:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2019-01-13 22:55:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-13 22:55:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-01-13 22:55:23,491 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 35 [2019-01-13 22:55:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:23,492 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-01-13 22:55:23,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 22:55:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-01-13 22:55:23,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-13 22:55:23,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:23,493 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:23,494 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 22:55:23,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:23,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1819430834, now seen corresponding path program 1 times [2019-01-13 22:55:23,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:23,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:23,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:23,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:55:23,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:24,045 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-01-13 22:55:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:24,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:24,145 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 [2019-01-13 22:55:24,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:24,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:24,445 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:24,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:24,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-01-13 22:55:24,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-13 22:55:24,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-13 22:55:24,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-01-13 22:55:24,465 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 16 states. [2019-01-13 22:55:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:25,082 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-13 22:55:25,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 22:55:25,083 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-01-13 22:55:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:25,084 INFO L225 Difference]: With dead ends: 67 [2019-01-13 22:55:25,084 INFO L226 Difference]: Without dead ends: 64 [2019-01-13 22:55:25,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-01-13 22:55:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-13 22:55:25,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-01-13 22:55:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-13 22:55:25,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-01-13 22:55:25,089 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 40 [2019-01-13 22:55:25,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:25,090 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-01-13 22:55:25,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-13 22:55:25,090 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-01-13 22:55:25,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-13 22:55:25,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:25,091 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:25,092 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 22:55:25,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:25,092 INFO L82 PathProgramCache]: Analyzing trace with hash -2080753, now seen corresponding path program 2 times [2019-01-13 22:55:25,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:25,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:25,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:25,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:25,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:25,395 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:25,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:25,396 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 [2019-01-13 22:55:25,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:55:25,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 22:55:25,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:25,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:25,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-13 22:55:25,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:25,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-13 22:55:25,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:25,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-13 22:55:25,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:25,541 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:25,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:55:25,551 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-01-13 22:55:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-13 22:55:25,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:55:25,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2019-01-13 22:55:25,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 22:55:25,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 22:55:25,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-13 22:55:25,888 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 13 states. [2019-01-13 22:55:26,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:26,376 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-13 22:55:26,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 22:55:26,377 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-01-13 22:55:26,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:26,379 INFO L225 Difference]: With dead ends: 70 [2019-01-13 22:55:26,379 INFO L226 Difference]: Without dead ends: 67 [2019-01-13 22:55:26,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-01-13 22:55:26,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-13 22:55:26,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-01-13 22:55:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-13 22:55:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2019-01-13 22:55:26,387 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 45 [2019-01-13 22:55:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:26,388 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2019-01-13 22:55:26,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 22:55:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2019-01-13 22:55:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-13 22:55:26,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:26,390 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:26,390 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 22:55:26,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:26,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1165684695, now seen corresponding path program 1 times [2019-01-13 22:55:26,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:26,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:26,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:26,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:55:26,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-01-13 22:55:26,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:26,509 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 [2019-01-13 22:55:26,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:26,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 1 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:26,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:26,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11] total 13 [2019-01-13 22:55:26,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-13 22:55:26,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-13 22:55:26,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-13 22:55:26,818 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 13 states. [2019-01-13 22:55:26,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:26,997 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-01-13 22:55:26,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 22:55:26,998 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-01-13 22:55:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:26,999 INFO L225 Difference]: With dead ends: 99 [2019-01-13 22:55:26,999 INFO L226 Difference]: Without dead ends: 96 [2019-01-13 22:55:27,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-01-13 22:55:27,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-13 22:55:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2019-01-13 22:55:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-13 22:55:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-01-13 22:55:27,007 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 59 [2019-01-13 22:55:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:27,007 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-01-13 22:55:27,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-13 22:55:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-01-13 22:55:27,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-13 22:55:27,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:27,012 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:27,012 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-01-13 22:55:27,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1970017626, now seen corresponding path program 2 times [2019-01-13 22:55:27,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:27,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:27,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:27,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:27,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-01-13 22:55:27,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:27,226 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 [2019-01-13 22:55:27,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:55:27,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 22:55:27,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:27,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:27,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:27,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2019-01-13 22:55:27,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-13 22:55:27,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:27,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:27,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 22:55:27,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-13 22:55:27,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:27,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2019-01-13 22:55:27,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-13 22:55:27,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:27,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:27,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-13 22:55:27,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-13 22:55:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2019-01-13 22:55:28,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:55:28,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-01-13 22:55:28,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 22:55:28,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 22:55:28,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=51, Unknown=1, NotChecked=0, Total=72 [2019-01-13 22:55:28,482 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2019-01-13 22:55:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:28,871 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-01-13 22:55:28,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 22:55:28,872 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-01-13 22:55:28,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:28,873 INFO L225 Difference]: With dead ends: 101 [2019-01-13 22:55:28,873 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 22:55:28,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=66, Invalid=173, Unknown=1, NotChecked=0, Total=240 [2019-01-13 22:55:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 22:55:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 22:55:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 22:55:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 22:55:28,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2019-01-13 22:55:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:28,876 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 22:55:28,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 22:55:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 22:55:28,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 22:55:28,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:55:28 BoogieIcfgContainer [2019-01-13 22:55:28,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:55:28,882 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:55:28,882 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:55:28,882 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:55:28,883 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:55:18" (3/4) ... [2019-01-13 22:55:28,886 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 22:55:28,893 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 22:55:28,893 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-01-13 22:55:28,896 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 22:55:28,902 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2019-01-13 22:55:28,903 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-13 22:55:28,903 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-13 22:55:28,903 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 22:55:28,948 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 22:55:28,948 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:55:28,949 INFO L168 Benchmark]: Toolchain (without parser) took 11680.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 264.8 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -212.5 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:28,950 INFO L168 Benchmark]: CDTParser took 1.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:55:28,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.46 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:28,951 INFO L168 Benchmark]: Boogie Preprocessor took 56.20 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. [2019-01-13 22:55:28,951 INFO L168 Benchmark]: RCFGBuilder took 595.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:28,952 INFO L168 Benchmark]: TraceAbstraction took 10629.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -60.5 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:28,953 INFO L168 Benchmark]: Witness Printer took 66.35 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:28,956 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.46 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 56.20 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 595.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10629.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 122.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -60.5 MB). Peak memory consumption was 61.7 MB. Max. memory is 11.5 GB. * Witness Printer took 66.35 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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, 10.5s OverallTime, 12 OverallIterations, 16 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 313 SDtfs, 510 SDslu, 1251 SDs, 0 SdLazy, 926 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 317 SyntacticMatches, 5 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=11, 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.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 63 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 740 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 721 ConstructedInterpolants, 159 QuantifiedInterpolants, 362989 SizeOfPredicates, 8 NumberOfNonLiveVariables, 703 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 1511/1896 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...