./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/scopes3_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/scopes3_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 7efcb16e512d7de15a71f6cd895dcd8493c4b646 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:49:36,617 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 20:49:36,619 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 20:49:36,635 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 20:49:36,635 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 20:49:36,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 20:49:36,638 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 20:49:36,640 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 20:49:36,642 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 20:49:36,642 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 20:49:36,644 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 20:49:36,644 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 20:49:36,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 20:49:36,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 20:49:36,647 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 20:49:36,648 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 20:49:36,649 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 20:49:36,651 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 20:49:36,654 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 20:49:36,655 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 20:49:36,656 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 20:49:36,657 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 20:49:36,660 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 20:49:36,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 20:49:36,661 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 20:49:36,661 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 20:49:36,663 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 20:49:36,664 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 20:49:36,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 20:49:36,666 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 20:49:36,666 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 20:49:36,667 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 20:49:36,667 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 20:49:36,667 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 20:49:36,669 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 20:49:36,670 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 20:49:36,670 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 20:49:36,685 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 20:49:36,685 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 20:49:36,687 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 20:49:36,687 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 20:49:36,687 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 20:49:36,687 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 20:49:36,687 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 20:49:36,688 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 20:49:36,689 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 20:49:36,689 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 20:49:36,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 20:49:36,689 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 20:49:36,689 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 20:49:36,689 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 20:49:36,690 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 20:49:36,690 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 20:49:36,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 20:49:36,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 20:49:36,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 20:49:36,690 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 20:49:36,692 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 20:49:36,692 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 20:49:36,692 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 20:49:36,693 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 20:49:36,693 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 20:49:36,693 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 -> 7efcb16e512d7de15a71f6cd895dcd8493c4b646 [2019-01-14 20:49:36,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 20:49:36,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 20:49:36,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 20:49:36,770 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 20:49:36,770 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 20:49:36,771 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/scopes3_false-valid-deref.c [2019-01-14 20:49:36,828 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5138d8c/5954f36d733d447490fc689a8de72571/FLAGe0e05d9a2 [2019-01-14 20:49:37,231 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 20:49:37,232 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/scopes3_false-valid-deref.c [2019-01-14 20:49:37,236 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5138d8c/5954f36d733d447490fc689a8de72571/FLAGe0e05d9a2 [2019-01-14 20:49:37,579 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e5138d8c/5954f36d733d447490fc689a8de72571 [2019-01-14 20:49:37,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 20:49:37,584 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 20:49:37,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 20:49:37,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 20:49:37,589 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 20:49:37,590 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:49:37" (1/1) ... [2019-01-14 20:49:37,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d153cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:37, skipping insertion in model container [2019-01-14 20:49:37,594 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:49:37" (1/1) ... [2019-01-14 20:49:37,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 20:49:37,618 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 20:49:37,800 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:49:37,813 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 20:49:37,832 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:49:37,851 INFO L195 MainTranslator]: Completed translation [2019-01-14 20:49:37,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:37 WrapperNode [2019-01-14 20:49:37,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 20:49:37,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 20:49:37,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 20:49:37,853 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 20:49:37,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:37" (1/1) ... [2019-01-14 20:49:37,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:37" (1/1) ... [2019-01-14 20:49:37,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:37" (1/1) ... [2019-01-14 20:49:37,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:37" (1/1) ... [2019-01-14 20:49:37,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:37" (1/1) ... [2019-01-14 20:49:37,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:37" (1/1) ... [2019-01-14 20:49:37,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:37" (1/1) ... [2019-01-14 20:49:37,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 20:49:37,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 20:49:37,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 20:49:37,903 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 20:49:37,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:37" (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 20:49:38,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 20:49:38,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 20:49:38,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 20:49:38,033 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 20:49:38,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 20:49:38,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 20:49:38,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 20:49:38,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 20:49:38,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 20:49:38,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 20:49:38,474 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 20:49:38,474 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-14 20:49:38,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:38 BoogieIcfgContainer [2019-01-14 20:49:38,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 20:49:38,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 20:49:38,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 20:49:38,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 20:49:38,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 08:49:37" (1/3) ... [2019-01-14 20:49:38,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d41b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:49:38, skipping insertion in model container [2019-01-14 20:49:38,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:37" (2/3) ... [2019-01-14 20:49:38,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d41b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:49:38, skipping insertion in model container [2019-01-14 20:49:38,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:38" (3/3) ... [2019-01-14 20:49:38,486 INFO L112 eAbstractionObserver]: Analyzing ICFG scopes3_false-valid-deref.c [2019-01-14 20:49:38,497 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 20:49:38,505 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-14 20:49:38,524 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-14 20:49:38,551 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 20:49:38,551 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 20:49:38,552 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 20:49:38,552 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 20:49:38,552 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 20:49:38,552 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 20:49:38,553 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 20:49:38,553 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 20:49:38,553 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 20:49:38,569 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-01-14 20:49:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 20:49:38,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:38,580 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:38,582 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 20:49:38,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:38,590 INFO L82 PathProgramCache]: Analyzing trace with hash -197094901, now seen corresponding path program 1 times [2019-01-14 20:49:38,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:38,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:38,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:38,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:38,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:38,747 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 20:49:38,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:38,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:49:38,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 20:49:38,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 20:49:38,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 20:49:38,775 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-01-14 20:49:38,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:38,799 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-14 20:49:38,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 20:49:38,801 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-14 20:49:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:38,812 INFO L225 Difference]: With dead ends: 20 [2019-01-14 20:49:38,814 INFO L226 Difference]: Without dead ends: 17 [2019-01-14 20:49:38,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 20:49:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-14 20:49:38,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 20:49:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 20:49:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-14 20:49:38,856 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 8 [2019-01-14 20:49:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:38,857 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-14 20:49:38,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 20:49:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-14 20:49:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 20:49:38,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:38,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:38,860 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 20:49:38,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:38,861 INFO L82 PathProgramCache]: Analyzing trace with hash -197095180, now seen corresponding path program 1 times [2019-01-14 20:49:38,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:38,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:38,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:38,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:38,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:38,940 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 20:49:38,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:38,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 20:49:38,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:38,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:38,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:38,945 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2019-01-14 20:49:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:38,986 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-14 20:49:38,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:38,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 20:49:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:38,989 INFO L225 Difference]: With dead ends: 22 [2019-01-14 20:49:38,990 INFO L226 Difference]: Without dead ends: 22 [2019-01-14 20:49:38,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-14 20:49:38,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-01-14 20:49:38,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 20:49:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-14 20:49:38,996 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2019-01-14 20:49:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:38,996 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-14 20:49:38,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-14 20:49:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 20:49:38,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:38,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:39,000 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 20:49:39,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:39,000 INFO L82 PathProgramCache]: Analyzing trace with hash -197095125, now seen corresponding path program 1 times [2019-01-14 20:49:39,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:39,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:39,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:39,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:39,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:39,089 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 20:49:39,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:39,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:49:39,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:39,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:39,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:39,091 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 3 states. [2019-01-14 20:49:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:39,130 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-14 20:49:39,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:39,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 20:49:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:39,132 INFO L225 Difference]: With dead ends: 16 [2019-01-14 20:49:39,132 INFO L226 Difference]: Without dead ends: 16 [2019-01-14 20:49:39,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-14 20:49:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-14 20:49:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 20:49:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-14 20:49:39,136 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 8 [2019-01-14 20:49:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:39,136 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-14 20:49:39,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-14 20:49:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 20:49:39,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:39,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:39,137 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 20:49:39,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:39,138 INFO L82 PathProgramCache]: Analyzing trace with hash -197095126, now seen corresponding path program 1 times [2019-01-14 20:49:39,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:39,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:39,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:39,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:39,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:39,171 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 20:49:39,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:39,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:49:39,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:39,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:39,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:39,173 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2019-01-14 20:49:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:39,244 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-14 20:49:39,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:39,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 20:49:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:39,246 INFO L225 Difference]: With dead ends: 15 [2019-01-14 20:49:39,246 INFO L226 Difference]: Without dead ends: 15 [2019-01-14 20:49:39,247 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 20:49:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-14 20:49:39,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-14 20:49:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 20:49:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-14 20:49:39,250 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2019-01-14 20:49:39,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:39,250 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-14 20:49:39,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-14 20:49:39,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 20:49:39,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:39,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:39,251 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 20:49:39,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:39,252 INFO L82 PathProgramCache]: Analyzing trace with hash -440617163, now seen corresponding path program 1 times [2019-01-14 20:49:39,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:39,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:39,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:39,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:39,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:39,344 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 20:49:39,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:39,345 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 20:49:39,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:39,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:39,423 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 20:49:39,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:39,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 20:49:39,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:49:39,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:49:39,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:49:39,446 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-01-14 20:49:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:39,492 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-14 20:49:39,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 20:49:39,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-01-14 20:49:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:39,494 INFO L225 Difference]: With dead ends: 20 [2019-01-14 20:49:39,494 INFO L226 Difference]: Without dead ends: 20 [2019-01-14 20:49:39,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 20:49:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-14 20:49:39,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2019-01-14 20:49:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 20:49:39,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-14 20:49:39,498 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2019-01-14 20:49:39,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:39,499 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-14 20:49:39,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:49:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-14 20:49:39,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-14 20:49:39,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:39,500 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:39,500 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 20:49:39,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:39,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1004249772, now seen corresponding path program 2 times [2019-01-14 20:49:39,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:39,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:39,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:39,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:39,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:39,620 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 20:49:39,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:39,621 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 20:49:39,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:39,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 20:49:39,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:39,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:39,802 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 20:49:39,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:39,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 20:49:39,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:49:39,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:49:39,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:49:39,832 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 6 states. [2019-01-14 20:49:39,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:39,940 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-14 20:49:39,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:49:39,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-01-14 20:49:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:39,942 INFO L225 Difference]: With dead ends: 23 [2019-01-14 20:49:39,942 INFO L226 Difference]: Without dead ends: 23 [2019-01-14 20:49:39,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:49:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-14 20:49:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-01-14 20:49:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 20:49:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-14 20:49:39,946 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2019-01-14 20:49:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:39,947 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-14 20:49:39,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:49:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-14 20:49:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 20:49:39,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:39,948 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:39,948 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 20:49:39,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:39,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1138822869, now seen corresponding path program 3 times [2019-01-14 20:49:39,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:39,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:39,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:39,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:39,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:40,086 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 20:49:40,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:40,087 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 20:49:40,106 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 20:49:40,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 20:49:40,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:40,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:40,198 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 20:49:40,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:40,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 20:49:40,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:49:40,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:49:40,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:49:40,234 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2019-01-14 20:49:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:40,370 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-14 20:49:40,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:49:40,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-01-14 20:49:40,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:40,372 INFO L225 Difference]: With dead ends: 26 [2019-01-14 20:49:40,372 INFO L226 Difference]: Without dead ends: 26 [2019-01-14 20:49:40,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 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 20:49:40,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-14 20:49:40,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-14 20:49:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 20:49:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-14 20:49:40,377 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 17 [2019-01-14 20:49:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:40,378 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-14 20:49:40,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:49:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-14 20:49:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 20:49:40,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:40,380 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:40,381 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 20:49:40,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:40,381 INFO L82 PathProgramCache]: Analyzing trace with hash 727015860, now seen corresponding path program 4 times [2019-01-14 20:49:40,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:40,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:40,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:40,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:40,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:40,500 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 20:49:40,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:40,500 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 20:49:40,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 20:49:40,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 20:49:40,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:40,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:40,596 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 20:49:40,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:40,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 20:49:40,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 20:49:40,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 20:49:40,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:49:40,620 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 8 states. [2019-01-14 20:49:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:40,675 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-14 20:49:40,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:49:40,678 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-01-14 20:49:40,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:40,679 INFO L225 Difference]: With dead ends: 29 [2019-01-14 20:49:40,679 INFO L226 Difference]: Without dead ends: 29 [2019-01-14 20:49:40,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 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 20:49:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-14 20:49:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2019-01-14 20:49:40,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 20:49:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-14 20:49:40,684 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2019-01-14 20:49:40,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:40,684 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-14 20:49:40,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 20:49:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-14 20:49:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 20:49:40,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:40,686 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:40,686 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 20:49:40,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:40,687 INFO L82 PathProgramCache]: Analyzing trace with hash -988991883, now seen corresponding path program 5 times [2019-01-14 20:49:40,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:40,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:40,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:40,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:40,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:40,855 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 20:49:40,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:40,855 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 20:49:40,865 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 20:49:40,966 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-14 20:49:40,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:40,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:41,095 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 20:49:41,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:41,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 20:49:41,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 20:49:41,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 20:49:41,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:49:41,129 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2019-01-14 20:49:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:41,325 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-14 20:49:41,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:49:41,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-01-14 20:49:41,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:41,330 INFO L225 Difference]: With dead ends: 32 [2019-01-14 20:49:41,330 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 20:49:41,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 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 20:49:41,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 20:49:41,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-14 20:49:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 20:49:41,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-14 20:49:41,336 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 23 [2019-01-14 20:49:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:41,338 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-14 20:49:41,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 20:49:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-14 20:49:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 20:49:41,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:41,339 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:41,339 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 20:49:41,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:41,341 INFO L82 PathProgramCache]: Analyzing trace with hash 420060692, now seen corresponding path program 6 times [2019-01-14 20:49:41,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:41,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:41,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:41,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:41,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:41,623 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 20:49:41,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:41,626 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 20:49:41,646 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 20:49:41,699 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 20:49:41,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:41,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:41,724 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 20:49:41,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:41,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-14 20:49:41,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 20:49:41,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 20:49:41,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:49:41,748 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 10 states. [2019-01-14 20:49:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:41,885 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-14 20:49:41,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 20:49:41,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-01-14 20:49:41,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:41,888 INFO L225 Difference]: With dead ends: 35 [2019-01-14 20:49:41,889 INFO L226 Difference]: Without dead ends: 35 [2019-01-14 20:49:41,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:49:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-14 20:49:41,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-01-14 20:49:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 20:49:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-14 20:49:41,896 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 26 [2019-01-14 20:49:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:41,896 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-14 20:49:41,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 20:49:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-14 20:49:41,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-14 20:49:41,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:41,899 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:41,901 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 20:49:41,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:41,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1505028587, now seen corresponding path program 7 times [2019-01-14 20:49:41,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:41,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:41,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:41,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:41,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:42,461 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 20:49:42,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:42,462 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 20:49:42,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:42,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:42,539 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 20:49:42,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:42,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 20:49:42,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 20:49:42,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 20:49:42,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:49:42,561 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 11 states. [2019-01-14 20:49:42,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:42,641 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-14 20:49:42,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 20:49:42,644 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-01-14 20:49:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:42,645 INFO L225 Difference]: With dead ends: 38 [2019-01-14 20:49:42,646 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 20:49:42,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:49:42,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 20:49:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-01-14 20:49:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 20:49:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-14 20:49:42,651 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 29 [2019-01-14 20:49:42,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:42,651 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-14 20:49:42,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 20:49:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-14 20:49:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-14 20:49:42,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:42,652 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:42,653 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 20:49:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:42,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1141435788, now seen corresponding path program 8 times [2019-01-14 20:49:42,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:42,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:42,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:42,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:42,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:43,148 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 20:49:43,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:43,151 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 20:49:43,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:43,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 20:49:43,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:43,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:43,239 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 20:49:43,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:43,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 20:49:43,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:49:43,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:49:43,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:49:43,277 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 12 states. [2019-01-14 20:49:43,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:43,334 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-14 20:49:43,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 20:49:43,337 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-01-14 20:49:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:43,338 INFO L225 Difference]: With dead ends: 41 [2019-01-14 20:49:43,338 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 20:49:43,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:49:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 20:49:43,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-01-14 20:49:43,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 20:49:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-14 20:49:43,344 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 32 [2019-01-14 20:49:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:43,345 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-14 20:49:43,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:49:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-14 20:49:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 20:49:43,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:43,346 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:43,346 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 20:49:43,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:43,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1255881291, now seen corresponding path program 9 times [2019-01-14 20:49:43,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:43,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:43,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:43,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:43,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:43,506 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 20:49:43,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:43,506 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 20:49:43,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 20:49:43,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-14 20:49:43,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:43,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:43,606 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 20:49:43,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:43,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-14 20:49:43,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 20:49:43,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 20:49:43,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:49:43,627 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 13 states. [2019-01-14 20:49:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:43,688 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-14 20:49:43,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:49:43,689 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-01-14 20:49:43,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:43,691 INFO L225 Difference]: With dead ends: 42 [2019-01-14 20:49:43,691 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 20:49:43,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:49:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 20:49:43,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-14 20:49:43,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 20:49:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-14 20:49:43,696 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 35 [2019-01-14 20:49:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:43,696 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-14 20:49:43,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 20:49:43,697 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-14 20:49:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 20:49:43,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:43,698 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:43,698 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-01-14 20:49:43,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:43,698 INFO L82 PathProgramCache]: Analyzing trace with hash -497828140, now seen corresponding path program 10 times [2019-01-14 20:49:43,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:43,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:43,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:43,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:43,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 20:49:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 20:49:43,870 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 20:49:43,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 08:49:43 BoogieIcfgContainer [2019-01-14 20:49:43,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 20:49:43,907 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 20:49:43,907 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 20:49:43,907 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 20:49:43,908 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:38" (3/4) ... [2019-01-14 20:49:43,910 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 20:49:44,011 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 20:49:44,011 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 20:49:44,015 INFO L168 Benchmark]: Toolchain (without parser) took 6432.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -210.7 MB). Peak memory consumption was 298.1 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:44,020 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:49:44,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.40 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:44,022 INFO L168 Benchmark]: Boogie Preprocessor took 49.92 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:49:44,022 INFO L168 Benchmark]: RCFGBuilder took 573.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -119.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:44,026 INFO L168 Benchmark]: TraceAbstraction took 5429.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 755.7 MB in the end (delta: 305.4 MB). Peak memory consumption was 305.4 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:44,026 INFO L168 Benchmark]: Witness Printer took 104.47 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 755.7 MB in the beginning and 1.2 GB in the end (delta: -407.7 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:44,030 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 267.40 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.92 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 573.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -119.1 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5429.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 755.7 MB in the end (delta: 305.4 MB). Peak memory consumption was 305.4 MB. Max. memory is 11.5 GB. * Witness Printer took 104.47 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 755.7 MB in the beginning and 1.2 GB in the end (delta: -407.7 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 8]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={1:0}, i=0, p={1:0}] [L6] p[0] = 1 VAL [a={1:0}, i=0, p={1:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={-7:0}, i=1, p={-7:0}] [L6] p[0] = 1 VAL [a={-7:0}, i=1, p={-7:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={-1:0}, i=2, p={-1:0}] [L6] p[0] = 1 VAL [a={-1:0}, i=2, p={-1:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={1:0}, i=3, p={1:0}] [L6] p[0] = 1 VAL [a={1:0}, i=3, p={1:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={-2:0}, i=4, p={-2:0}] [L6] p[0] = 1 VAL [a={-2:0}, i=4, p={-2:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={-3:0}, i=5, p={-3:0}] [L6] p[0] = 1 VAL [a={-3:0}, i=5, p={-3:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={-4:0}, i=6, p={-4:0}] [L6] p[0] = 1 VAL [a={-4:0}, i=6, p={-4:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={-5:0}, i=7, p={-5:0}] [L6] p[0] = 1 VAL [a={-5:0}, i=7, p={-5:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={-6:0}, i=8, p={-6:0}] [L6] p[0] = 1 VAL [a={-6:0}, i=8, p={-6:0}] [L3] i++ [L3] COND TRUE i < 10 [L4] int a[10]; [L5] p = a VAL [a={1:0}, i=9, p={1:0}] [L6] p[0] = 1 VAL [a={1:0}, i=9, p={1:0}] [L3] i++ [L3] COND FALSE !(i < 10) VAL [i=10, p={1:0}] [L8] p[0] = 2 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 5 error locations. UNSAFE Result, 5.3s OverallTime, 14 OverallIterations, 10 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 165 SDtfs, 123 SDslu, 422 SDs, 0 SdLazy, 189 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=13, 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, 13 MinimizatonAttempts, 20 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 484 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 24918 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1172 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 0/810 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...