./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/getNumbers1_false-valid-deref.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/memsafety-ext3/getNumbers1_false-valid-deref.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 1b1751fe95f9cf655681429038c1cde9e9c074e8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 00:36:41,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:36:41,727 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:36:41,743 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:36:41,743 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:36:41,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:36:41,747 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:36:41,749 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:36:41,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:36:41,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:36:41,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:36:41,755 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:36:41,756 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:36:41,760 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:36:41,762 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:36:41,763 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:36:41,771 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:36:41,772 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:36:41,779 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:36:41,780 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:36:41,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:36:41,783 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:36:41,787 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:36:41,787 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:36:41,787 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:36:41,788 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:36:41,789 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:36:41,791 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:36:41,792 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:36:41,795 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:36:41,796 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:36:41,798 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:36:41,798 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:36:41,798 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:36:41,800 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:36:41,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:36:41,803 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 00:36:41,823 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:36:41,825 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:36:41,826 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:36:41,827 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:36:41,827 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:36:41,827 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:36:41,827 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:36:41,827 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:36:41,827 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:36:41,828 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:36:41,828 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:36:41,828 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:36:41,828 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:36:41,828 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 00:36:41,828 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:36:41,829 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:36:41,829 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:36:41,829 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:36:41,829 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:36:41,829 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:36:41,829 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:36:41,830 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:36:41,830 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:36:41,830 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:36:41,830 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:36:41,830 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:36:41,831 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 -> 1b1751fe95f9cf655681429038c1cde9e9c074e8 [2019-01-14 00:36:41,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:36:41,876 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:36:41,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:36:41,884 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:36:41,885 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:36:41,886 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/getNumbers1_false-valid-deref.c [2019-01-14 00:36:41,939 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6e252e3/372699b95b6745759ae4f28814d7228d/FLAG1c1e9c355 [2019-01-14 00:36:42,367 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:36:42,367 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/getNumbers1_false-valid-deref.c [2019-01-14 00:36:42,372 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6e252e3/372699b95b6745759ae4f28814d7228d/FLAG1c1e9c355 [2019-01-14 00:36:42,740 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e6e252e3/372699b95b6745759ae4f28814d7228d [2019-01-14 00:36:42,743 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:36:42,745 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:36:42,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:36:42,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:36:42,749 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:36:42,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:36:42" (1/1) ... [2019-01-14 00:36:42,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe5e0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:42, skipping insertion in model container [2019-01-14 00:36:42,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:36:42" (1/1) ... [2019-01-14 00:36:42,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:36:42,776 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:36:42,972 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:36:42,996 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:36:43,015 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:36:43,033 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:36:43,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:43 WrapperNode [2019-01-14 00:36:43,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:36:43,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:36:43,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:36:43,035 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:36:43,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:43" (1/1) ... [2019-01-14 00:36:43,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:43" (1/1) ... [2019-01-14 00:36:43,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:43" (1/1) ... [2019-01-14 00:36:43,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:43" (1/1) ... [2019-01-14 00:36:43,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:43" (1/1) ... [2019-01-14 00:36:43,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:43" (1/1) ... [2019-01-14 00:36:43,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:43" (1/1) ... [2019-01-14 00:36:43,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:36:43,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:36:43,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:36:43,088 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:36:43,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:43" (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 00:36:43,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:36:43,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:36:43,205 INFO L138 BoogieDeclarations]: Found implementation of procedure getNumbers [2019-01-14 00:36:43,205 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:36:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-01-14 00:36:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 00:36:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure getNumbers [2019-01-14 00:36:43,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 00:36:43,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:36:43,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:36:43,207 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:36:43,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:36:43,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:36:43,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 00:36:43,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:36:43,610 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:36:43,611 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 00:36:43,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:36:43 BoogieIcfgContainer [2019-01-14 00:36:43,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:36:43,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:36:43,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:36:43,616 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:36:43,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:36:42" (1/3) ... [2019-01-14 00:36:43,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1706edbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:36:43, skipping insertion in model container [2019-01-14 00:36:43,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:36:43" (2/3) ... [2019-01-14 00:36:43,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1706edbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:36:43, skipping insertion in model container [2019-01-14 00:36:43,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:36:43" (3/3) ... [2019-01-14 00:36:43,619 INFO L112 eAbstractionObserver]: Analyzing ICFG getNumbers1_false-valid-deref.c [2019-01-14 00:36:43,627 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:36:43,634 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-14 00:36:43,646 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-14 00:36:43,671 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:36:43,672 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:36:43,672 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:36:43,672 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:36:43,673 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:36:43,673 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:36:43,673 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:36:43,673 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:36:43,673 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:36:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-14 00:36:43,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 00:36:43,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:43,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:43,702 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:43,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:43,709 INFO L82 PathProgramCache]: Analyzing trace with hash 543879226, now seen corresponding path program 1 times [2019-01-14 00:36:43,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:43,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:43,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:43,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:43,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:43,880 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 00:36:43,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:36:43,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:36:43,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:36:43,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:36:43,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:36:43,902 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 3 states. [2019-01-14 00:36:43,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:43,983 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-14 00:36:43,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:36:43,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 00:36:43,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:43,992 INFO L225 Difference]: With dead ends: 27 [2019-01-14 00:36:43,992 INFO L226 Difference]: Without dead ends: 24 [2019-01-14 00:36:43,994 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 00:36:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-14 00:36:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-14 00:36:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 00:36:44,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-14 00:36:44,026 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 9 [2019-01-14 00:36:44,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:44,026 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-14 00:36:44,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:36:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-14 00:36:44,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 00:36:44,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:44,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:44,028 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:44,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:44,028 INFO L82 PathProgramCache]: Analyzing trace with hash 543879227, now seen corresponding path program 1 times [2019-01-14 00:36:44,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:44,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:44,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:44,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:44,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:44,162 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 00:36:44,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:36:44,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:36:44,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:36:44,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:36:44,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:36:44,166 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2019-01-14 00:36:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:44,226 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-14 00:36:44,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:36:44,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 00:36:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:44,228 INFO L225 Difference]: With dead ends: 27 [2019-01-14 00:36:44,228 INFO L226 Difference]: Without dead ends: 27 [2019-01-14 00:36:44,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 00:36:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-14 00:36:44,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-14 00:36:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 00:36:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-14 00:36:44,235 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 9 [2019-01-14 00:36:44,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:44,235 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-14 00:36:44,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:36:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-14 00:36:44,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 00:36:44,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:44,237 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:44,237 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:44,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:44,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2089391026, now seen corresponding path program 1 times [2019-01-14 00:36:44,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:44,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:44,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:44,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:44,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:44,635 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-14 00:36:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:44,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:36:44,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:36:44,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:36:44,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:36:44,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:36:44,711 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 6 states. [2019-01-14 00:36:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:44,809 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2019-01-14 00:36:44,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:36:44,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-14 00:36:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:44,811 INFO L225 Difference]: With dead ends: 26 [2019-01-14 00:36:44,811 INFO L226 Difference]: Without dead ends: 26 [2019-01-14 00:36:44,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:36:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-14 00:36:44,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-14 00:36:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 00:36:44,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-14 00:36:44,817 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 12 [2019-01-14 00:36:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:44,817 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-14 00:36:44,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:36:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-14 00:36:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 00:36:44,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:44,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:44,819 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:44,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:44,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1673858648, now seen corresponding path program 1 times [2019-01-14 00:36:44,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:44,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:44,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:44,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:44,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:44,908 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 00:36:44,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:44,909 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 00:36:44,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:44,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:45,002 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 00:36:45,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:45,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 00:36:45,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:36:45,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:36:45,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:36:45,025 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2019-01-14 00:36:45,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:45,182 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-01-14 00:36:45,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:36:45,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-14 00:36:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:45,186 INFO L225 Difference]: With dead ends: 29 [2019-01-14 00:36:45,187 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 00:36:45,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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 00:36:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 00:36:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-01-14 00:36:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 00:36:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-14 00:36:45,196 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 17 [2019-01-14 00:36:45,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:45,196 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-14 00:36:45,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:36:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-14 00:36:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 00:36:45,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:45,198 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:45,199 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:45,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:45,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2027302431, now seen corresponding path program 2 times [2019-01-14 00:36:45,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:45,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:45,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:45,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:45,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:45,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:45,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 00:36:45,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:36:45,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:36:45,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:45,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:45,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:45,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:45,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 00:36:45,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:36:45,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:36:45,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:36:45,454 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 6 states. [2019-01-14 00:36:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:45,508 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-01-14 00:36:45,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:36:45,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-01-14 00:36:45,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:45,511 INFO L225 Difference]: With dead ends: 32 [2019-01-14 00:36:45,512 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 00:36:45,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:36:45,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 00:36:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-14 00:36:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 00:36:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-01-14 00:36:45,518 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2019-01-14 00:36:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:45,518 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-01-14 00:36:45,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:36:45,519 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-01-14 00:36:45,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 00:36:45,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:45,520 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:45,521 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:45,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:45,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1378383288, now seen corresponding path program 3 times [2019-01-14 00:36:45,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:45,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:45,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:45,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:45,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:45,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:45,684 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 00:36:45,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 00:36:45,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 00:36:45,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:45,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:45,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:45,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 00:36:45,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:36:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:36:45,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:36:45,867 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2019-01-14 00:36:46,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:46,085 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-01-14 00:36:46,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:36:46,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-14 00:36:46,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:46,088 INFO L225 Difference]: With dead ends: 35 [2019-01-14 00:36:46,088 INFO L226 Difference]: Without dead ends: 35 [2019-01-14 00:36:46,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:36:46,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-14 00:36:46,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-01-14 00:36:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 00:36:46,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-14 00:36:46,094 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 23 [2019-01-14 00:36:46,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:46,096 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-14 00:36:46,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:36:46,096 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-14 00:36:46,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 00:36:46,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:46,097 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:46,097 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:46,099 INFO L82 PathProgramCache]: Analyzing trace with hash -149204609, now seen corresponding path program 4 times [2019-01-14 00:36:46,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:46,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:46,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:46,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:46,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:46,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:46,206 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 00:36:46,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 00:36:46,258 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 00:36:46,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:46,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:46,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:46,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 00:36:46,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 00:36:46,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 00:36:46,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:36:46,297 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2019-01-14 00:36:46,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:46,417 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-01-14 00:36:46,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:36:46,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-01-14 00:36:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:46,419 INFO L225 Difference]: With dead ends: 38 [2019-01-14 00:36:46,420 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 00:36:46,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:36:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 00:36:46,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-01-14 00:36:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 00:36:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-01-14 00:36:46,426 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 26 [2019-01-14 00:36:46,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:46,426 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-01-14 00:36:46,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 00:36:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-14 00:36:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 00:36:46,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:46,428 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:46,428 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:46,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:46,429 INFO L82 PathProgramCache]: Analyzing trace with hash -578344216, now seen corresponding path program 5 times [2019-01-14 00:36:46,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:46,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:46,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:46,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:46,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:46,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:46,666 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 00:36:46,676 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 00:36:46,782 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 00:36:46,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:46,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:46,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:46,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 00:36:46,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 00:36:46,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 00:36:46,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:36:46,941 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 9 states. [2019-01-14 00:36:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:47,084 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-01-14 00:36:47,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:36:47,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-01-14 00:36:47,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:47,086 INFO L225 Difference]: With dead ends: 41 [2019-01-14 00:36:47,086 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 00:36:47,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:36:47,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 00:36:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-01-14 00:36:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 00:36:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-14 00:36:47,092 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 29 [2019-01-14 00:36:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:47,093 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-14 00:36:47,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 00:36:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-14 00:36:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 00:36:47,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:47,094 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:47,096 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:47,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:47,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1041263839, now seen corresponding path program 6 times [2019-01-14 00:36:47,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:47,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:47,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:47,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:47,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:47,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:47,239 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 00:36:47,257 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 00:36:47,314 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 00:36:47,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:47,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:47,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:47,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-14 00:36:47,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:36:47,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:36:47,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:36:47,361 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 10 states. [2019-01-14 00:36:47,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:47,470 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-01-14 00:36:47,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 00:36:47,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-01-14 00:36:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:47,474 INFO L225 Difference]: With dead ends: 44 [2019-01-14 00:36:47,474 INFO L226 Difference]: Without dead ends: 44 [2019-01-14 00:36:47,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:36:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-14 00:36:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-01-14 00:36:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 00:36:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-01-14 00:36:47,481 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 32 [2019-01-14 00:36:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:47,483 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-01-14 00:36:47,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:36:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-01-14 00:36:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 00:36:47,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:47,485 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:47,485 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1122227080, now seen corresponding path program 7 times [2019-01-14 00:36:47,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:47,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:47,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:47,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:47,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:47,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:47,675 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 00:36:47,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:47,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:47,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:47,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 00:36:47,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 00:36:47,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 00:36:47,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:36:47,773 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 11 states. [2019-01-14 00:36:48,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:48,015 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-01-14 00:36:48,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:36:48,017 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-01-14 00:36:48,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:48,018 INFO L225 Difference]: With dead ends: 47 [2019-01-14 00:36:48,018 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 00:36:48,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:36:48,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 00:36:48,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-01-14 00:36:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 00:36:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-14 00:36:48,023 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 35 [2019-01-14 00:36:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:48,024 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-14 00:36:48,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 00:36:48,024 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-14 00:36:48,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 00:36:48,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:48,025 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:48,025 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:48,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:48,025 INFO L82 PathProgramCache]: Analyzing trace with hash -673480641, now seen corresponding path program 8 times [2019-01-14 00:36:48,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:48,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:48,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:48,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:36:48,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:48,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:48,168 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 00:36:48,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:36:48,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:36:48,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:48,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:48,257 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:48,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:48,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 00:36:48,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:36:48,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:36:48,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:36:48,281 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 12 states. [2019-01-14 00:36:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:48,372 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-01-14 00:36:48,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:36:48,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-01-14 00:36:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:48,377 INFO L225 Difference]: With dead ends: 50 [2019-01-14 00:36:48,377 INFO L226 Difference]: Without dead ends: 50 [2019-01-14 00:36:48,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:36:48,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-14 00:36:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-01-14 00:36:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 00:36:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-01-14 00:36:48,383 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 38 [2019-01-14 00:36:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:48,386 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-01-14 00:36:48,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:36:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-01-14 00:36:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 00:36:48,387 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:48,387 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:48,388 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:48,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:48,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1510442024, now seen corresponding path program 9 times [2019-01-14 00:36:48,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:48,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:48,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:48,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:48,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:36:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:48,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:36:48,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:36:48,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 00:36:48,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 00:36:48,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:36:48,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:36:48,858 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:36:48,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:36:48,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-14 00:36:48,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:36:48,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:36:48,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:36:48,893 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 13 states. [2019-01-14 00:36:49,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:36:49,070 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-14 00:36:49,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:36:49,071 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2019-01-14 00:36:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:36:49,072 INFO L225 Difference]: With dead ends: 51 [2019-01-14 00:36:49,073 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 00:36:49,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:36:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 00:36:49,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-14 00:36:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 00:36:49,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-14 00:36:49,078 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 41 [2019-01-14 00:36:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:36:49,078 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-14 00:36:49,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:36:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-14 00:36:49,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 00:36:49,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:36:49,079 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:36:49,082 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, getNumbersErr1REQUIRES_VIOLATION, getNumbersErr0REQUIRES_VIOLATION]=== [2019-01-14 00:36:49,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:36:49,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1709012065, now seen corresponding path program 10 times [2019-01-14 00:36:49,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:36:49,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:36:49,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:49,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:36:49,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:36:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 00:36:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 00:36:49,197 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 00:36:49,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:36:49 BoogieIcfgContainer [2019-01-14 00:36:49,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:36:49,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:36:49,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:36:49,259 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:36:49,259 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:36:43" (3/4) ... [2019-01-14 00:36:49,267 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 00:36:49,357 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:36:49,358 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:36:49,359 INFO L168 Benchmark]: Toolchain (without parser) took 6614.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:36:49,359 INFO L168 Benchmark]: CDTParser took 0.13 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 00:36:49,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.22 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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 00:36:49,364 INFO L168 Benchmark]: Boogie Preprocessor took 52.98 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 00:36:49,364 INFO L168 Benchmark]: RCFGBuilder took 524.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-01-14 00:36:49,366 INFO L168 Benchmark]: TraceAbstraction took 5645.45 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -47.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-01-14 00:36:49,367 INFO L168 Benchmark]: Witness Printer took 99.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:36:49,372 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.13 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 288.22 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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 52.98 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 524.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5645.45 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -47.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Witness Printer took 99.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 22]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L19] CALL, EXPR getNumbers() [L8] int *array = alloca(10 * sizeof(int)); [L10] int i = 0; VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=0] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=0] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=0] [L10] ++i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=1] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=1] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=1] [L10] ++i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=2] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=2] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=2] [L10] ++i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=3] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=3] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=3] [L10] ++i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=4] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=4] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=4] [L10] ++i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=5] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=5] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=5] [L10] ++i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=6] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=6] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=6] [L10] ++i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=7] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=7] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=7] [L10] ++i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=8] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=8] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=8] [L10] ++i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=9] [L10] COND TRUE i < 10 VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=9] [L11] array[i] = i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=9] [L10] ++i VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=10] [L10] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(int))={-1:0}, array={-1:0}, i=10] [L14] return array; [L19] RET, EXPR getNumbers() VAL [getNumbers()={-1:0}] [L19] int *numbers = getNumbers(); [L21] int i = 0; VAL [i=0, numbers={-1:0}] [L21] COND TRUE i < 10 [L22] numbers + i - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 5 error locations. UNSAFE Result, 5.5s OverallTime, 13 OverallIterations, 10 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 255 SDtfs, 124 SDslu, 932 SDs, 0 SdLazy, 286 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 334 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 19 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 531 ConstructedInterpolants, 0 QuantifiedInterpolants, 34673 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1188 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 2/812 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...