./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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/ArraysOfVariableLength_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 19:06:55,563 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 19:06:55,565 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 19:06:55,581 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 19:06:55,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 19:06:55,585 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 19:06:55,587 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 19:06:55,589 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 19:06:55,592 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 19:06:55,594 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 19:06:55,597 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 19:06:55,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 19:06:55,599 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 19:06:55,602 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 19:06:55,608 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 19:06:55,609 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 19:06:55,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 19:06:55,614 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 19:06:55,616 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 19:06:55,618 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 19:06:55,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 19:06:55,621 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 19:06:55,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 19:06:55,627 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 19:06:55,627 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 19:06:55,628 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 19:06:55,629 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 19:06:55,632 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 19:06:55,633 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 19:06:55,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 19:06:55,637 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 19:06:55,638 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 19:06:55,638 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 19:06:55,638 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 19:06:55,641 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 19:06:55,642 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 19:06:55,644 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 19:06:55,671 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 19:06:55,671 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 19:06:55,672 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 19:06:55,672 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 19:06:55,672 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 19:06:55,673 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 19:06:55,673 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 19:06:55,674 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 19:06:55,674 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 19:06:55,674 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 19:06:55,674 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 19:06:55,674 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 19:06:55,674 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 19:06:55,675 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 19:06:55,675 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 19:06:55,675 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 19:06:55,675 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 19:06:55,675 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 19:06:55,675 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 19:06:55,676 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 19:06:55,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 19:06:55,677 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 19:06:55,678 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 19:06:55,678 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 19:06:55,678 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 19:06:55,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a4e278d158dd9e8a83bb0a2afcbaa26c6819a0f8 [2019-01-14 19:06:55,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 19:06:55,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 19:06:55,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 19:06:55,743 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 19:06:55,743 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 19:06:55,744 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2019-01-14 19:06:55,809 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9478aa7b1/c165010e957246819e5ab31bbef0ab14/FLAGf285a1d72 [2019-01-14 19:06:56,238 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 19:06:56,240 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2019-01-14 19:06:56,247 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9478aa7b1/c165010e957246819e5ab31bbef0ab14/FLAGf285a1d72 [2019-01-14 19:06:56,593 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9478aa7b1/c165010e957246819e5ab31bbef0ab14 [2019-01-14 19:06:56,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 19:06:56,604 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 19:06:56,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 19:06:56,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 19:06:56,611 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 19:06:56,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:06:56" (1/1) ... [2019-01-14 19:06:56,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf37a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:56, skipping insertion in model container [2019-01-14 19:06:56,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:06:56" (1/1) ... [2019-01-14 19:06:56,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 19:06:56,647 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 19:06:56,888 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:06:56,901 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 19:06:56,927 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:06:56,947 INFO L195 MainTranslator]: Completed translation [2019-01-14 19:06:56,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:56 WrapperNode [2019-01-14 19:06:56,948 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 19:06:56,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 19:06:56,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 19:06:56,949 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 19:06:56,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:56" (1/1) ... [2019-01-14 19:06:56,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:56" (1/1) ... [2019-01-14 19:06:56,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:56" (1/1) ... [2019-01-14 19:06:56,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:56" (1/1) ... [2019-01-14 19:06:56,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:56" (1/1) ... [2019-01-14 19:06:56,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:56" (1/1) ... [2019-01-14 19:06:56,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:56" (1/1) ... [2019-01-14 19:06:56,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 19:06:56,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 19:06:56,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 19:06:56,992 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 19:06:56,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:56" (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-14 19:06:57,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 19:06:57,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 19:06:57,108 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-01-14 19:06:57,108 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 19:06:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-01-14 19:06:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 19:06:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 19:06:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 19:06:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 19:06:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 19:06:57,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 19:06:57,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 19:06:57,547 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 19:06:57,548 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-14 19:06:57,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:06:57 BoogieIcfgContainer [2019-01-14 19:06:57,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 19:06:57,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 19:06:57,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 19:06:57,553 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 19:06:57,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 07:06:56" (1/3) ... [2019-01-14 19:06:57,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58298d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:06:57, skipping insertion in model container [2019-01-14 19:06:57,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:56" (2/3) ... [2019-01-14 19:06:57,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58298d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:06:57, skipping insertion in model container [2019-01-14 19:06:57,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:06:57" (3/3) ... [2019-01-14 19:06:57,557 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2019-01-14 19:06:57,566 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 19:06:57,574 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-14 19:06:57,590 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-14 19:06:57,615 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 19:06:57,616 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 19:06:57,616 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 19:06:57,616 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 19:06:57,616 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 19:06:57,616 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 19:06:57,616 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 19:06:57,617 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 19:06:57,617 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 19:06:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-01-14 19:06:57,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 19:06:57,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:57,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:57,645 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:06:57,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:57,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-01-14 19:06:57,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:57,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:57,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:57,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:57,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:57,792 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-14 19:06:57,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:57,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 19:06:57,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 19:06:57,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 19:06:57,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:06:57,814 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-01-14 19:06:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:57,944 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-01-14 19:06:57,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 19:06:57,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 19:06:57,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:57,954 INFO L225 Difference]: With dead ends: 58 [2019-01-14 19:06:57,955 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 19:06:57,957 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-14 19:06:57,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 19:06:57,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-01-14 19:06:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 19:06:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-14 19:06:58,000 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-01-14 19:06:58,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:58,000 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-14 19:06:58,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 19:06:58,000 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-14 19:06:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 19:06:58,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:58,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:58,002 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:06:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:58,002 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-01-14 19:06:58,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:58,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:58,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:58,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:58,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:58,157 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-14 19:06:58,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:58,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:06:58,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:06:58,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:06:58,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:06:58,160 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2019-01-14 19:06:58,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:58,545 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-01-14 19:06:58,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:06:58,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-01-14 19:06:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:58,546 INFO L225 Difference]: With dead ends: 59 [2019-01-14 19:06:58,547 INFO L226 Difference]: Without dead ends: 59 [2019-01-14 19:06:58,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:06:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-14 19:06:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 45. [2019-01-14 19:06:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 19:06:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-01-14 19:06:58,555 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 11 [2019-01-14 19:06:58,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:58,555 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-01-14 19:06:58,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:06:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-01-14 19:06:58,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 19:06:58,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:58,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:58,556 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:06:58,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:58,557 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-01-14 19:06:58,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:58,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:58,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:58,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:58,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:58,620 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-14 19:06:58,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:58,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 19:06:58,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 19:06:58,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 19:06:58,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:06:58,622 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 3 states. [2019-01-14 19:06:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:58,664 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-14 19:06:58,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 19:06:58,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 19:06:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:58,669 INFO L225 Difference]: With dead ends: 43 [2019-01-14 19:06:58,669 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 19:06:58,669 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-14 19:06:58,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 19:06:58,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-14 19:06:58,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 19:06:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-01-14 19:06:58,677 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 15 [2019-01-14 19:06:58,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:58,677 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-01-14 19:06:58,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 19:06:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-01-14 19:06:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 19:06:58,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:58,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:58,678 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:06:58,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:58,679 INFO L82 PathProgramCache]: Analyzing trace with hash 143250927, now seen corresponding path program 1 times [2019-01-14 19:06:58,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:58,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:58,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:58,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:58,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:58,776 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-14 19:06:58,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:58,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 19:06:58,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 19:06:58,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 19:06:58,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:06:58,779 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 3 states. [2019-01-14 19:06:58,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:58,883 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-01-14 19:06:58,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 19:06:58,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 19:06:58,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:58,886 INFO L225 Difference]: With dead ends: 47 [2019-01-14 19:06:58,886 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 19:06:58,886 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-14 19:06:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 19:06:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-01-14 19:06:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 19:06:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-01-14 19:06:58,893 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 15 [2019-01-14 19:06:58,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:58,893 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-01-14 19:06:58,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 19:06:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-01-14 19:06:58,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 19:06:58,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:58,896 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] [2019-01-14 19:06:58,896 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:06:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:58,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1902162976, now seen corresponding path program 1 times [2019-01-14 19:06:58,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:58,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:58,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:58,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:58,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:58,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:58,993 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-14 19:06:59,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:59,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:59,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:59,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 19:06:59,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:06:59,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:06:59,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:06:59,126 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2019-01-14 19:06:59,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:59,264 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2019-01-14 19:06:59,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 19:06:59,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 19:06:59,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:59,267 INFO L225 Difference]: With dead ends: 69 [2019-01-14 19:06:59,267 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 19:06:59,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:06:59,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 19:06:59,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 52. [2019-01-14 19:06:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 19:06:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2019-01-14 19:06:59,274 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 21 [2019-01-14 19:06:59,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:59,274 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2019-01-14 19:06:59,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:06:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2019-01-14 19:06:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 19:06:59,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:59,276 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:59,276 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:06:59,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:59,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1165178250, now seen corresponding path program 1 times [2019-01-14 19:06:59,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:59,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:59,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:59,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:59,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:06:59,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:59,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:06:59,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:06:59,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:06:59,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:06:59,379 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2019-01-14 19:06:59,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:59,643 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-01-14 19:06:59,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:06:59,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-01-14 19:06:59,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:59,645 INFO L225 Difference]: With dead ends: 62 [2019-01-14 19:06:59,645 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 19:06:59,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 19:06:59,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 19:06:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2019-01-14 19:06:59,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-14 19:06:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2019-01-14 19:06:59,652 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2019-01-14 19:06:59,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:59,652 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2019-01-14 19:06:59,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:06:59,653 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2019-01-14 19:06:59,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 19:06:59,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:59,654 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:59,654 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:06:59,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:59,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787427, now seen corresponding path program 1 times [2019-01-14 19:06:59,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:59,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:59,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:59,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:59,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:59,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:59,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:59,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:06:59,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:06:59,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:06:59,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:06:59,770 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 5 states. [2019-01-14 19:07:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:07:00,124 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2019-01-14 19:07:00,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:07:00,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-14 19:07:00,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:07:00,131 INFO L225 Difference]: With dead ends: 53 [2019-01-14 19:07:00,131 INFO L226 Difference]: Without dead ends: 53 [2019-01-14 19:07:00,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:07:00,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-14 19:07:00,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-14 19:07:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 19:07:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2019-01-14 19:07:00,139 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 23 [2019-01-14 19:07:00,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:07:00,140 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2019-01-14 19:07:00,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:07:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2019-01-14 19:07:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 19:07:00,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:07:00,142 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:07:00,142 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:07:00,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:07:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1760787428, now seen corresponding path program 1 times [2019-01-14 19:07:00,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:07:00,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:07:00,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:00,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:07:00,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:07:00,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:07:00,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:07:00,468 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-14 19:07:00,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:07:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:07:00,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:07:00,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:07:00,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:07:00,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:07:00,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 19:07:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 19:07:00,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:07:00,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2019-01-14 19:07:00,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 19:07:00,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 19:07:00,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-14 19:07:00,722 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 12 states. [2019-01-14 19:07:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:07:01,410 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-01-14 19:07:01,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 19:07:01,411 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-01-14 19:07:01,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:07:01,414 INFO L225 Difference]: With dead ends: 64 [2019-01-14 19:07:01,414 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 19:07:01,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-01-14 19:07:01,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 19:07:01,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2019-01-14 19:07:01,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 19:07:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2019-01-14 19:07:01,422 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 23 [2019-01-14 19:07:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:07:01,422 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2019-01-14 19:07:01,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 19:07:01,423 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2019-01-14 19:07:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 19:07:01,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:07:01,425 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:07:01,426 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:07:01,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:07:01,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1134972881, now seen corresponding path program 1 times [2019-01-14 19:07:01,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:07:01,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:07:01,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:01,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:07:01,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:07:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 19:07:01,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:07:01,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:07:01,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:07:01,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:07:01,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:07:01,778 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 6 states. [2019-01-14 19:07:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:07:01,857 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-01-14 19:07:01,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:07:01,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-01-14 19:07:01,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:07:01,859 INFO L225 Difference]: With dead ends: 52 [2019-01-14 19:07:01,859 INFO L226 Difference]: Without dead ends: 52 [2019-01-14 19:07:01,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:07:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-14 19:07:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-01-14 19:07:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 19:07:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-01-14 19:07:01,865 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 26 [2019-01-14 19:07:01,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:07:01,866 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-01-14 19:07:01,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:07:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-01-14 19:07:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 19:07:01,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:07:01,867 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:07:01,867 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:07:01,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:07:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1992931931, now seen corresponding path program 1 times [2019-01-14 19:07:01,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:07:01,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:07:01,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:01,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:07:01,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:07:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:07:01,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:07:01,964 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-14 19:07:01,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:07:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:07:01,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:07:02,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:07:02,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:07:02,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-01-14 19:07:02,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 19:07:02,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 19:07:02,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:07:02,095 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 11 states. [2019-01-14 19:07:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:07:02,588 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2019-01-14 19:07:02,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 19:07:02,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-01-14 19:07:02,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:07:02,591 INFO L225 Difference]: With dead ends: 78 [2019-01-14 19:07:02,591 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 19:07:02,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-14 19:07:02,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 19:07:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 62. [2019-01-14 19:07:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 19:07:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-01-14 19:07:02,597 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 27 [2019-01-14 19:07:02,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:07:02,598 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-01-14 19:07:02,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 19:07:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-01-14 19:07:02,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 19:07:02,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:07:02,599 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:07:02,600 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:07:02,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:07:02,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1979886526, now seen corresponding path program 2 times [2019-01-14 19:07:02,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:07:02,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:07:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:02,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:07:02,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:07:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 19:07:02,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:07:02,669 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-14 19:07:02,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 19:07:02,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 19:07:02,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:07:02,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:07:02,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 19:07:02,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:07:02,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:07:02,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 19:07:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-14 19:07:02,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:07:02,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-01-14 19:07:02,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 19:07:02,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 19:07:02,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:07:02,944 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 9 states. [2019-01-14 19:07:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:07:03,250 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-01-14 19:07:03,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 19:07:03,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-01-14 19:07:03,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:07:03,253 INFO L225 Difference]: With dead ends: 89 [2019-01-14 19:07:03,255 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 19:07:03,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-14 19:07:03,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 19:07:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2019-01-14 19:07:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 19:07:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2019-01-14 19:07:03,263 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 32 [2019-01-14 19:07:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:07:03,264 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2019-01-14 19:07:03,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 19:07:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2019-01-14 19:07:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 19:07:03,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:07:03,266 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:07:03,266 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:07:03,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:07:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2014379143, now seen corresponding path program 2 times [2019-01-14 19:07:03,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:07:03,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:07:03,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:03,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:07:03,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:07:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 19:07:03,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:07:03,639 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-14 19:07:03,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 19:07:03,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 19:07:03,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:07:03,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:07:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 19:07:03,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:07:03,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2019-01-14 19:07:03,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 19:07:03,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 19:07:03,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-01-14 19:07:03,793 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand 14 states. [2019-01-14 19:07:04,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:07:04,165 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2019-01-14 19:07:04,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 19:07:04,166 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2019-01-14 19:07:04,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:07:04,168 INFO L225 Difference]: With dead ends: 95 [2019-01-14 19:07:04,168 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 19:07:04,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-01-14 19:07:04,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 19:07:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2019-01-14 19:07:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-14 19:07:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2019-01-14 19:07:04,175 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 38 [2019-01-14 19:07:04,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:07:04,175 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2019-01-14 19:07:04,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 19:07:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2019-01-14 19:07:04,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 19:07:04,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:07:04,177 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:07:04,177 INFO L423 AbstractCegarLoop]: === Iteration 13 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:07:04,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:07:04,177 INFO L82 PathProgramCache]: Analyzing trace with hash -174164318, now seen corresponding path program 3 times [2019-01-14 19:07:04,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:07:04,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:07:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:04,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:07:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:07:04,775 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 19:07:04,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:07:04,775 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-14 19:07:04,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 19:07:04,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-14 19:07:04,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:07:04,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:07:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-14 19:07:04,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:07:04,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-01-14 19:07:04,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 19:07:04,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 19:07:04,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-14 19:07:04,891 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 7 states. [2019-01-14 19:07:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:07:05,085 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2019-01-14 19:07:05,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 19:07:05,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-01-14 19:07:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:07:05,088 INFO L225 Difference]: With dead ends: 82 [2019-01-14 19:07:05,088 INFO L226 Difference]: Without dead ends: 82 [2019-01-14 19:07:05,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-14 19:07:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-14 19:07:05,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2019-01-14 19:07:05,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-14 19:07:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2019-01-14 19:07:05,095 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 43 [2019-01-14 19:07:05,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:07:05,095 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2019-01-14 19:07:05,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 19:07:05,095 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2019-01-14 19:07:05,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-14 19:07:05,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:07:05,099 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:07:05,100 INFO L423 AbstractCegarLoop]: === Iteration 14 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:07:05,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:07:05,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2125667663, now seen corresponding path program 1 times [2019-01-14 19:07:05,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:07:05,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:07:05,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:05,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:07:05,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:07:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-14 19:07:05,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:07:05,631 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-14 19:07:05,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:07:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:07:05,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:07:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 19:07:05,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:07:05,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-01-14 19:07:05,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 19:07:05,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 19:07:05,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-01-14 19:07:05,923 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 13 states. [2019-01-14 19:07:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:07:06,439 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2019-01-14 19:07:06,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 19:07:06,440 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-01-14 19:07:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:07:06,443 INFO L225 Difference]: With dead ends: 123 [2019-01-14 19:07:06,443 INFO L226 Difference]: Without dead ends: 120 [2019-01-14 19:07:06,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2019-01-14 19:07:06,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-14 19:07:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2019-01-14 19:07:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 19:07:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2019-01-14 19:07:06,450 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 72 [2019-01-14 19:07:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:07:06,450 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2019-01-14 19:07:06,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 19:07:06,451 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2019-01-14 19:07:06,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-14 19:07:06,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:07:06,454 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:07:06,455 INFO L423 AbstractCegarLoop]: === Iteration 15 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2019-01-14 19:07:06,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:07:06,456 INFO L82 PathProgramCache]: Analyzing trace with hash 241209475, now seen corresponding path program 2 times [2019-01-14 19:07:06,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:07:06,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:07:06,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:06,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:07:06,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:07:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:07:06,700 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-14 19:07:06,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:07:06,701 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-14 19:07:06,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 19:07:06,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 19:07:06,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:07:06,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:07:06,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:07:06,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2019-01-14 19:07:06,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:07:06,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:07:06,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-01-14 19:07:07,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:07:07,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2019-01-14 19:07:07,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:07:07,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:07:07,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-01-14 19:07:07,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:07:07,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2019-01-14 19:07:07,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:07:07,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:07:07,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-01-14 19:07:07,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:07:07,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2019-01-14 19:07:07,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:07:07,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:07:07,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-01-14 19:07:07,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:07:07,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2019-01-14 19:07:07,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:07:07,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:07:07,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-01-14 19:07:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-01-14 19:07:07,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:07:07,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2019-01-14 19:07:07,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 19:07:07,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 19:07:07,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2019-01-14 19:07:07,664 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 12 states. [2019-01-14 19:07:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:07:08,886 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2019-01-14 19:07:08,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-14 19:07:08,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2019-01-14 19:07:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:07:08,888 INFO L225 Difference]: With dead ends: 122 [2019-01-14 19:07:08,888 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 19:07:08,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 92 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=162, Invalid=437, Unknown=1, NotChecked=0, Total=600 [2019-01-14 19:07:08,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 19:07:08,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 19:07:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 19:07:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 19:07:08,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2019-01-14 19:07:08,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:07:08,891 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 19:07:08,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 19:07:08,891 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 19:07:08,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 19:07:08,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 07:07:08 BoogieIcfgContainer [2019-01-14 19:07:08,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 19:07:08,899 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 19:07:08,899 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 19:07:08,899 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 19:07:08,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:06:57" (3/4) ... [2019-01-14 19:07:08,905 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 19:07:08,913 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 19:07:08,913 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-01-14 19:07:08,914 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 19:07:08,919 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-01-14 19:07:08,920 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-14 19:07:08,920 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 19:07:08,920 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 19:07:08,967 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 19:07:08,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 19:07:08,968 INFO L168 Benchmark]: Toolchain (without parser) took 12367.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.6 MB). Free memory was 951.3 MB in the beginning and 1.3 GB in the end (delta: -304.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:07:08,970 INFO L168 Benchmark]: CDTParser took 0.15 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-14 19:07:08,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.00 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 19:07:08,971 INFO L168 Benchmark]: Boogie Preprocessor took 43.29 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-14 19:07:08,972 INFO L168 Benchmark]: RCFGBuilder took 557.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-14 19:07:08,972 INFO L168 Benchmark]: TraceAbstraction took 11348.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -139.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:07:08,978 INFO L168 Benchmark]: Witness Printer took 68.23 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:07:08,984 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.15 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 342.00 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.29 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 557.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -176.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11348.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 114.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -139.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 68.23 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 23]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. SAFE Result, 11.2s OverallTime, 15 OverallIterations, 7 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 383 SDtfs, 897 SDslu, 1024 SDs, 0 SdLazy, 1413 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 488 GetRequests, 346 SyntacticMatches, 15 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 134 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 840 NumberOfCodeBlocks, 712 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 817 ConstructedInterpolants, 76 QuantifiedInterpolants, 158485 SizeOfPredicates, 15 NumberOfNonLiveVariables, 872 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 23 InterpolantComputations, 11 PerfectInterpolantSequences, 754/881 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...