./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_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/ArraysWithLenghtAtDeclaration_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 56b28f59847d63942ec468b0c95f39e5b8c0763a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:31,412 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:55:31,416 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:55:31,432 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:55:31,432 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:55:31,433 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:55:31,436 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:55:31,437 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:55:31,439 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:55:31,440 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:55:31,443 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:55:31,443 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:55:31,444 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:55:31,445 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:55:31,454 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:55:31,455 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:55:31,456 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:55:31,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:55:31,459 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:55:31,461 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:55:31,462 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:55:31,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:55:31,465 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:55:31,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:55:31,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:55:31,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:55:31,468 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:55:31,469 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:55:31,469 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:55:31,470 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:55:31,471 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:55:31,471 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:55:31,471 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:55:31,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:55:31,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:55:31,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:55:31,474 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:31,502 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:55:31,502 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:55:31,503 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:55:31,504 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:55:31,504 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:55:31,504 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:55:31,504 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:55:31,504 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:55:31,505 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:55:31,505 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:55:31,505 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:55:31,505 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:55:31,505 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:55:31,505 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:55:31,506 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:55:31,506 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:55:31,506 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:55:31,506 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:55:31,506 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:55:31,506 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:55:31,507 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:55:31,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:55:31,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:55:31,507 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:55:31,507 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 22:55:31,508 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:55:31,508 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 -> 56b28f59847d63942ec468b0c95f39e5b8c0763a [2019-01-13 22:55:31,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:55:31,587 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:55:31,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:55:31,596 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:55:31,597 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:55:31,598 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2019-01-13 22:55:31,660 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79398bf42/5a449682be1f44368eaa9bd99c353fb6/FLAG93cb5f842 [2019-01-13 22:55:32,099 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:55:32,100 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2019-01-13 22:55:32,107 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79398bf42/5a449682be1f44368eaa9bd99c353fb6/FLAG93cb5f842 [2019-01-13 22:55:32,456 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79398bf42/5a449682be1f44368eaa9bd99c353fb6 [2019-01-13 22:55:32,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:55:32,462 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:55:32,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:55:32,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:55:32,467 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:55:32,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:55:32" (1/1) ... [2019-01-13 22:55:32,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f9a908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:32, skipping insertion in model container [2019-01-13 22:55:32,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:55:32" (1/1) ... [2019-01-13 22:55:32,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:55:32,495 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:55:32,689 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:55:32,700 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:55:32,718 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:55:32,734 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:55:32,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:32 WrapperNode [2019-01-13 22:55:32,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:55:32,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:55:32,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:55:32,735 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:55:32,747 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:32" (1/1) ... [2019-01-13 22:55:32,747 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:32" (1/1) ... [2019-01-13 22:55:32,756 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:32" (1/1) ... [2019-01-13 22:55:32,756 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:32" (1/1) ... [2019-01-13 22:55:32,764 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:32" (1/1) ... [2019-01-13 22:55:32,770 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:32" (1/1) ... [2019-01-13 22:55:32,772 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:32" (1/1) ... [2019-01-13 22:55:32,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:55:32,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:55:32,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:55:32,774 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:55:32,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:32" (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:32,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:55:32,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:55:32,894 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-01-13 22:55:32,894 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:55:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-01-13 22:55:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-13 22:55:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:55:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 22:55:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 22:55:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:55:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:55:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:55:33,369 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:55:33,369 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-13 22:55:33,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:55:33 BoogieIcfgContainer [2019-01-13 22:55:33,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:55:33,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:55:33,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:55:33,375 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:55:33,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:55:32" (1/3) ... [2019-01-13 22:55:33,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f71e89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:55:33, skipping insertion in model container [2019-01-13 22:55:33,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:55:32" (2/3) ... [2019-01-13 22:55:33,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f71e89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:55:33, skipping insertion in model container [2019-01-13 22:55:33,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:55:33" (3/3) ... [2019-01-13 22:55:33,379 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_true-valid-memsafety_true-termination.c [2019-01-13 22:55:33,389 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:55:33,397 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-13 22:55:33,414 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-13 22:55:33,441 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:55:33,442 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:55:33,442 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:55:33,442 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:55:33,443 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:55:33,443 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:55:33,443 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:55:33,443 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:55:33,443 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:55:33,465 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-01-13 22:55:33,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:55:33,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:33,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:33,479 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:33,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:33,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-01-13 22:55:33,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:33,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:33,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:33,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:33,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:33,632 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:33,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:33,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 22:55:33,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:55:33,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:55:33,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:33,654 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-01-13 22:55:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:33,767 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-01-13 22:55:33,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:55:33,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:55:33,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:33,779 INFO L225 Difference]: With dead ends: 58 [2019-01-13 22:55:33,779 INFO L226 Difference]: Without dead ends: 54 [2019-01-13 22:55:33,781 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:33,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-13 22:55:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-01-13 22:55:33,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-13 22:55:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-13 22:55:33,824 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-01-13 22:55:33,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:33,825 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-13 22:55:33,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:55:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-13 22:55:33,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-13 22:55:33,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:33,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:33,826 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:33,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:33,827 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-01-13 22:55:33,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:33,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:33,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:33,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:33,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:33,889 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:33,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:33,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:55:33,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:55:33,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:55:33,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:33,892 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2019-01-13 22:55:34,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:34,034 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-01-13 22:55:34,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:55:34,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-13 22:55:34,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:34,038 INFO L225 Difference]: With dead ends: 49 [2019-01-13 22:55:34,038 INFO L226 Difference]: Without dead ends: 49 [2019-01-13 22:55:34,039 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:34,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-13 22:55:34,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2019-01-13 22:55:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-13 22:55:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-01-13 22:55:34,048 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2019-01-13 22:55:34,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:34,049 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-01-13 22:55:34,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:55:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-01-13 22:55:34,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 22:55:34,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:34,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:34,050 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:34,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:34,050 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2019-01-13 22:55:34,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:34,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:34,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:34,306 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:34,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:34,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:55:34,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:55:34,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:55:34,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:55:34,307 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-01-13 22:55:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:34,432 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-01-13 22:55:34,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:55:34,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-01-13 22:55:34,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:34,434 INFO L225 Difference]: With dead ends: 40 [2019-01-13 22:55:34,435 INFO L226 Difference]: Without dead ends: 40 [2019-01-13 22:55:34,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:55:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-13 22:55:34,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-13 22:55:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-13 22:55:34,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-13 22:55:34,443 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2019-01-13 22:55:34,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:34,445 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-13 22:55:34,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:55:34,445 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-13 22:55:34,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-13 22:55:34,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:34,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:34,448 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:34,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:34,448 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2019-01-13 22:55:34,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:34,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:34,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:34,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:34,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:34,700 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-13 22:55:34,702 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:34,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:34,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:55:34,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:55:34,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:55:34,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:55:34,704 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2019-01-13 22:55:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:34,917 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-01-13 22:55:34,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:55:34,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-13 22:55:34,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:34,921 INFO L225 Difference]: With dead ends: 42 [2019-01-13 22:55:34,921 INFO L226 Difference]: Without dead ends: 42 [2019-01-13 22:55:34,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:55:34,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-13 22:55:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-01-13 22:55:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-13 22:55:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-13 22:55:34,928 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2019-01-13 22:55:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:34,928 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-13 22:55:34,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:55:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-13 22:55:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 22:55:34,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:34,929 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:34,931 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:34,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:34,931 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-01-13 22:55:34,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:34,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:34,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:34,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:34,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:35,097 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:35,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:35,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:55:35,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:55:35,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:55:35,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:55:35,100 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 6 states. [2019-01-13 22:55:35,397 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-13 22:55:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:35,651 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2019-01-13 22:55:35,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:55:35,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-13 22:55:35,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:35,654 INFO L225 Difference]: With dead ends: 60 [2019-01-13 22:55:35,654 INFO L226 Difference]: Without dead ends: 60 [2019-01-13 22:55:35,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:55:35,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-13 22:55:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2019-01-13 22:55:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-13 22:55:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-01-13 22:55:35,662 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 15 [2019-01-13 22:55:35,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:35,663 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2019-01-13 22:55:35,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:55:35,663 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2019-01-13 22:55:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:55:35,664 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:35,664 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:35,664 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:35,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2019-01-13 22:55:35,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:35,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:35,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:35,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:35,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:55:35,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:35,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:55:35,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:55:35,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:55:35,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:55:35,766 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2019-01-13 22:55:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:35,948 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-01-13 22:55:35,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:55:35,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-13 22:55:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:35,951 INFO L225 Difference]: With dead ends: 70 [2019-01-13 22:55:35,951 INFO L226 Difference]: Without dead ends: 67 [2019-01-13 22:55:35,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:55:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-13 22:55:35,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2019-01-13 22:55:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-13 22:55:35,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-01-13 22:55:35,957 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16 [2019-01-13 22:55:35,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:35,958 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-01-13 22:55:35,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:55:35,958 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-01-13 22:55:35,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 22:55:35,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:35,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:35,959 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:35,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:35,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234189, now seen corresponding path program 1 times [2019-01-13 22:55:35,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:35,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:35,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:55:36,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:36,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:55:36,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:55:36,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:55:36,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:55:36,035 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 3 states. [2019-01-13 22:55:36,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:36,065 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2019-01-13 22:55:36,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:55:36,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-13 22:55:36,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:36,068 INFO L225 Difference]: With dead ends: 48 [2019-01-13 22:55:36,068 INFO L226 Difference]: Without dead ends: 48 [2019-01-13 22:55:36,072 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:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-13 22:55:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-13 22:55:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-13 22:55:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2019-01-13 22:55:36,079 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 20 [2019-01-13 22:55:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:36,080 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2019-01-13 22:55:36,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:55:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2019-01-13 22:55:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-13 22:55:36,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:36,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:36,081 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:36,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:36,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2121234190, now seen corresponding path program 1 times [2019-01-13 22:55:36,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:36,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:36,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:36,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:36,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:55:36,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:55:36,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 22:55:36,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 22:55:36,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 22:55:36,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 22:55:36,185 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 4 states. [2019-01-13 22:55:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:36,252 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2019-01-13 22:55:36,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:55:36,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-01-13 22:55:36,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:36,256 INFO L225 Difference]: With dead ends: 52 [2019-01-13 22:55:36,256 INFO L226 Difference]: Without dead ends: 52 [2019-01-13 22:55:36,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-13 22:55:36,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-13 22:55:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-01-13 22:55:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-13 22:55:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-01-13 22:55:36,263 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 20 [2019-01-13 22:55:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:36,264 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-01-13 22:55:36,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 22:55:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-01-13 22:55:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-13 22:55:36,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:36,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:36,266 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:36,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:36,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2011781567, now seen corresponding path program 1 times [2019-01-13 22:55:36,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:36,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:36,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:36,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:36,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:55:36,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:36,322 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:36,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:36,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-13 22:55:36,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:36,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-13 22:55:36,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:55:36,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:55:36,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:55:36,432 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2019-01-13 22:55:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:36,559 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2019-01-13 22:55:36,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 22:55:36,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-13 22:55:36,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:36,561 INFO L225 Difference]: With dead ends: 74 [2019-01-13 22:55:36,562 INFO L226 Difference]: Without dead ends: 74 [2019-01-13 22:55:36,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:55:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-13 22:55:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2019-01-13 22:55:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-13 22:55:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2019-01-13 22:55:36,569 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 26 [2019-01-13 22:55:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:36,569 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2019-01-13 22:55:36,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:55:36,570 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2019-01-13 22:55:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-13 22:55:36,571 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:36,571 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:36,571 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:36,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1143280978, now seen corresponding path program 1 times [2019-01-13 22:55:36,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:36,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:36,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:36,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:36,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:36,750 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 22:55:36,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:36,750 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:36,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:36,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:37,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 22:55:37,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:55:37,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-01-13 22:55:37,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 22:55:37,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 22:55:37,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:55:37,096 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 9 states. [2019-01-13 22:55:37,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:37,639 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-13 22:55:37,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:55:37,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-01-13 22:55:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:37,641 INFO L225 Difference]: With dead ends: 67 [2019-01-13 22:55:37,641 INFO L226 Difference]: Without dead ends: 64 [2019-01-13 22:55:37,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:55:37,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-13 22:55:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2019-01-13 22:55:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-13 22:55:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2019-01-13 22:55:37,648 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 31 [2019-01-13 22:55:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:37,648 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2019-01-13 22:55:37,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 22:55:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2019-01-13 22:55:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 22:55:37,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:37,650 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:37,650 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:37,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:37,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1735380924, now seen corresponding path program 1 times [2019-01-13 22:55:37,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:37,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:37,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:37,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:37,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 22:55:37,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:37,763 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:37,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:37,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-13 22:55:37,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:37,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2019-01-13 22:55:37,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 22:55:37,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 22:55:37,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:55:37,877 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 10 states. [2019-01-13 22:55:38,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:38,193 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2019-01-13 22:55:38,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:55:38,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-01-13 22:55:38,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:38,196 INFO L225 Difference]: With dead ends: 73 [2019-01-13 22:55:38,196 INFO L226 Difference]: Without dead ends: 73 [2019-01-13 22:55:38,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-01-13 22:55:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-13 22:55:38,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 55. [2019-01-13 22:55:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-13 22:55:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2019-01-13 22:55:38,202 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 32 [2019-01-13 22:55:38,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:38,203 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2019-01-13 22:55:38,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 22:55:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2019-01-13 22:55:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-13 22:55:38,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:38,204 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:38,205 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:38,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:38,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1978883467, now seen corresponding path program 2 times [2019-01-13 22:55:38,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:38,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:38,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:38,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:38,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 22:55:38,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:38,318 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:38,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:55:38,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-13 22:55:38,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:38,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-13 22:55:38,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:38,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-01-13 22:55:38,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 22:55:38,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 22:55:38,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:55:38,802 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 10 states. [2019-01-13 22:55:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:39,140 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2019-01-13 22:55:39,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 22:55:39,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-01-13 22:55:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:39,143 INFO L225 Difference]: With dead ends: 71 [2019-01-13 22:55:39,143 INFO L226 Difference]: Without dead ends: 68 [2019-01-13 22:55:39,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-01-13 22:55:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-13 22:55:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2019-01-13 22:55:39,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-13 22:55:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2019-01-13 22:55:39,148 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 36 [2019-01-13 22:55:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:39,148 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2019-01-13 22:55:39,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 22:55:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2019-01-13 22:55:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-13 22:55:39,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:39,150 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:39,150 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:39,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:39,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1930842354, now seen corresponding path program 3 times [2019-01-13 22:55:39,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:39,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:39,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:39,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:55:39,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:39,393 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-13 22:55:39,396 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-13 22:55:39,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:39,397 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:39,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-13 22:55:39,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-13 22:55:39,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:39,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:39,485 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:39,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:39,509 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:39,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:39,517 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:39,518 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:39,529 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:39,545 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:39,545 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-01-13 22:55:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-13 22:55:39,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:39,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-13 22:55:39,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:55:39,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:55:39,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:55:39,799 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 8 states. [2019-01-13 22:55:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:40,104 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2019-01-13 22:55:40,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:55:40,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-01-13 22:55:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:40,109 INFO L225 Difference]: With dead ends: 65 [2019-01-13 22:55:40,109 INFO L226 Difference]: Without dead ends: 65 [2019-01-13 22:55:40,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:55:40,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-13 22:55:40,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-01-13 22:55:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-13 22:55:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2019-01-13 22:55:40,114 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 41 [2019-01-13 22:55:40,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:40,115 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2019-01-13 22:55:40,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:55:40,115 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2019-01-13 22:55:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-13 22:55:40,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:40,116 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:40,117 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:40,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:40,117 INFO L82 PathProgramCache]: Analyzing trace with hash 492189859, now seen corresponding path program 2 times [2019-01-13 22:55:40,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:40,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:40,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:40,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:55:40,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:40,195 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-13 22:55:40,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:40,195 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:40,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:55:40,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 22:55:40,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:40,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:40,258 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:40,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:40,269 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:40,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:40,273 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:40,273 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:40,287 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:40,303 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:40,303 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-01-13 22:55:40,518 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:40,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:55:40,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-01-13 22:55:40,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 22:55:40,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 22:55:40,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:55:40,540 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 9 states. [2019-01-13 22:55:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:40,860 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2019-01-13 22:55:40,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 22:55:40,861 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2019-01-13 22:55:40,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:40,863 INFO L225 Difference]: With dead ends: 87 [2019-01-13 22:55:40,863 INFO L226 Difference]: Without dead ends: 87 [2019-01-13 22:55:40,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-13 22:55:40,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-13 22:55:40,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2019-01-13 22:55:40,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-13 22:55:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-01-13 22:55:40,870 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 47 [2019-01-13 22:55:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:40,870 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-01-13 22:55:40,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 22:55:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-01-13 22:55:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-13 22:55:40,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:40,874 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:40,874 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:40,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:40,874 INFO L82 PathProgramCache]: Analyzing trace with hash -918660315, now seen corresponding path program 1 times [2019-01-13 22:55:40,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:40,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:40,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:40,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 22:55:40,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-01-13 22:55:41,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:41,102 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:41,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:41,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:41,285 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 156 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-13 22:55:41,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:55:41,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-01-13 22:55:41,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-13 22:55:41,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-13 22:55:41,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-01-13 22:55:41,305 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 14 states. [2019-01-13 22:55:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:41,961 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2019-01-13 22:55:41,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 22:55:41,962 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 92 [2019-01-13 22:55:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:41,964 INFO L225 Difference]: With dead ends: 147 [2019-01-13 22:55:41,964 INFO L226 Difference]: Without dead ends: 147 [2019-01-13 22:55:41,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2019-01-13 22:55:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-13 22:55:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 108. [2019-01-13 22:55:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-13 22:55:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2019-01-13 22:55:41,971 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 92 [2019-01-13 22:55:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:41,971 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2019-01-13 22:55:41,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-13 22:55:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2019-01-13 22:55:41,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-13 22:55:41,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:55:41,974 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:55:41,974 INFO L423 AbstractCegarLoop]: === Iteration 16 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION]=== [2019-01-13 22:55:41,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:55:41,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1779963986, now seen corresponding path program 2 times [2019-01-13 22:55:41,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:55:41,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:55:41,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:41,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:55:41,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:55:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:55:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2019-01-13 22:55:42,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:55:42,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-13 22:55:42,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-13 22:55:42,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-13 22:55:42,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-13 22:55:42,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:55:43,148 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-13 22:55:43,269 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-13 22:55:43,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:43,298 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:43,318 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:43,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:43,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:43,441 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:43,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-13 22:55:43,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:43,524 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:43,528 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:43,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:43,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:43,545 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:43,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-13 22:55:43,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:43,715 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:43,723 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:43,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:43,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:43,740 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:43,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-13 22:55:43,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:43,817 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:43,841 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:43,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:43,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:43,902 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:43,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-13 22:55:44,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:55:44,046 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:44,050 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:44,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:55:44,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:55:44,066 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:44,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-13 22:55:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2019-01-13 22:55:44,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-13 22:55:44,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2019-01-13 22:55:44,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-13 22:55:44,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-13 22:55:44,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2019-01-13 22:55:44,956 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 12 states. [2019-01-13 22:55:45,436 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-13 22:55:46,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:55:46,102 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2019-01-13 22:55:46,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-13 22:55:46,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 128 [2019-01-13 22:55:46,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:55:46,104 INFO L225 Difference]: With dead ends: 137 [2019-01-13 22:55:46,104 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 22:55:46,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 117 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=162, Invalid=437, Unknown=1, NotChecked=0, Total=600 [2019-01-13 22:55:46,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 22:55:46,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 22:55:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 22:55:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 22:55:46,106 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 128 [2019-01-13 22:55:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:55:46,106 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 22:55:46,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-13 22:55:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 22:55:46,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 22:55:46,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:55:46 BoogieIcfgContainer [2019-01-13 22:55:46,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:55:46,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:55:46,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:55:46,117 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:55:46,117 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:33" (3/4) ... [2019-01-13 22:55:46,124 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 22:55:46,132 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-13 22:55:46,133 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-01-13 22:55:46,133 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-13 22:55:46,139 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-01-13 22:55:46,140 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-13 22:55:46,140 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-13 22:55:46,140 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-13 22:55:46,188 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 22:55:46,188 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:55:46,189 INFO L168 Benchmark]: Toolchain (without parser) took 13728.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 92.3 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:46,190 INFO L168 Benchmark]: CDTParser took 0.17 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:46,190 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.86 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:46,191 INFO L168 Benchmark]: Boogie Preprocessor took 38.80 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:46,191 INFO L168 Benchmark]: RCFGBuilder took 596.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:46,194 INFO L168 Benchmark]: TraceAbstraction took 12744.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -39.0 MB). Peak memory consumption was 97.3 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:46,194 INFO L168 Benchmark]: Witness Printer took 71.50 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2019-01-13 22:55:46,203 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 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 271.86 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.80 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 596.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -173.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12744.29 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 136.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -39.0 MB). Peak memory consumption was 97.3 MB. Max. memory is 11.5 GB. * Witness Printer took 71.50 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 27]: 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: 23]: 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: 30]: 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, 12.6s OverallTime, 16 OverallIterations, 12 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 409 SDtfs, 827 SDslu, 1059 SDs, 0 SdLazy, 1577 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 411 SyntacticMatches, 16 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 162 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 982 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 958 ConstructedInterpolants, 162 QuantifiedInterpolants, 416152 SizeOfPredicates, 12 NumberOfNonLiveVariables, 946 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 24 InterpolantComputations, 11 PerfectInterpolantSequences, 1501/1640 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...