./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97fe3d28a1849ecc88958d9d302f4fb4c5dbb992 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 18:11:41,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 18:11:41,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 18:11:41,515 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 18:11:41,515 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 18:11:41,517 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 18:11:41,518 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 18:11:41,521 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 18:11:41,525 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 18:11:41,527 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 18:11:41,528 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 18:11:41,528 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 18:11:41,530 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 18:11:41,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 18:11:41,541 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 18:11:41,542 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 18:11:41,544 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 18:11:41,546 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 18:11:41,548 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 18:11:41,552 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 18:11:41,553 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 18:11:41,554 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 18:11:41,558 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 18:11:41,559 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 18:11:41,559 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 18:11:41,560 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 18:11:41,561 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 18:11:41,565 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 18:11:41,565 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 18:11:41,568 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 18:11:41,570 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 18:11:41,571 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 18:11:41,571 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 18:11:41,571 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 18:11:41,574 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 18:11:41,574 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 18:11:41,575 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 18:11:41,605 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 18:11:41,605 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 18:11:41,609 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 18:11:41,609 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 18:11:41,610 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 18:11:41,610 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 18:11:41,610 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 18:11:41,610 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 18:11:41,610 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 18:11:41,611 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 18:11:41,611 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 18:11:41,611 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 18:11:41,611 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 18:11:41,611 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 18:11:41,611 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 18:11:41,612 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 18:11:41,613 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 18:11:41,613 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 18:11:41,613 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 18:11:41,613 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 18:11:41,613 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 18:11:41,614 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 18:11:41,614 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 18:11:41,614 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 18:11:41,614 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 18:11:41,614 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 18:11:41,614 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 -> 97fe3d28a1849ecc88958d9d302f4fb4c5dbb992 [2019-01-01 18:11:41,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 18:11:41,693 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 18:11:41,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 18:11:41,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 18:11:41,700 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 18:11:41,701 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2019-01-01 18:11:41,756 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d003d20e/7a51003cbefd4660a1df2e76b91542e4/FLAG6a795ad44 [2019-01-01 18:11:42,246 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 18:11:42,247 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2019-01-01 18:11:42,256 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d003d20e/7a51003cbefd4660a1df2e76b91542e4/FLAG6a795ad44 [2019-01-01 18:11:42,564 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d003d20e/7a51003cbefd4660a1df2e76b91542e4 [2019-01-01 18:11:42,568 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 18:11:42,570 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 18:11:42,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 18:11:42,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 18:11:42,575 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 18:11:42,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 06:11:42" (1/1) ... [2019-01-01 18:11:42,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22eac36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:11:42, skipping insertion in model container [2019-01-01 18:11:42,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 06:11:42" (1/1) ... [2019-01-01 18:11:42,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 18:11:42,606 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 18:11:42,799 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 18:11:42,817 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 18:11:42,844 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 18:11:42,869 INFO L195 MainTranslator]: Completed translation [2019-01-01 18:11:42,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:11:42 WrapperNode [2019-01-01 18:11:42,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 18:11:42,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 18:11:42,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 18:11:42,871 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 18:11:42,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:11:42" (1/1) ... [2019-01-01 18:11:42,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:11:42" (1/1) ... [2019-01-01 18:11:42,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:11:42" (1/1) ... [2019-01-01 18:11:42,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:11:42" (1/1) ... [2019-01-01 18:11:42,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:11:42" (1/1) ... [2019-01-01 18:11:42,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:11:42" (1/1) ... [2019-01-01 18:11:42,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:11:42" (1/1) ... [2019-01-01 18:11:42,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 18:11:42,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 18:11:42,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 18:11:42,937 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 18:11:42,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:11:42" (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-01 18:11:43,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 18:11:43,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 18:11:43,093 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-01-01 18:11:43,093 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 18:11:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-01-01 18:11:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 18:11:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 18:11:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 18:11:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 18:11:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 18:11:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 18:11:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 18:11:43,612 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 18:11:43,613 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-01 18:11:43,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:11:43 BoogieIcfgContainer [2019-01-01 18:11:43,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 18:11:43,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 18:11:43,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 18:11:43,618 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 18:11:43,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 06:11:42" (1/3) ... [2019-01-01 18:11:43,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d847c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 06:11:43, skipping insertion in model container [2019-01-01 18:11:43,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 06:11:42" (2/3) ... [2019-01-01 18:11:43,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d847c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 06:11:43, skipping insertion in model container [2019-01-01 18:11:43,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:11:43" (3/3) ... [2019-01-01 18:11:43,621 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2019-01-01 18:11:43,630 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 18:11:43,638 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-01 18:11:43,655 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-01 18:11:43,681 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 18:11:43,681 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 18:11:43,682 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 18:11:43,682 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 18:11:43,683 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 18:11:43,683 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 18:11:43,683 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 18:11:43,683 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 18:11:43,683 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 18:11:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-01-01 18:11:43,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-01 18:11:43,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:11:43,712 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:11:43,715 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 18:11:43,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:11:43,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-01-01 18:11:43,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:11:43,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:11:43,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:43,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:11:43,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:43,909 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-01 18:11:43,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:11:43,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 18:11:43,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 18:11:43,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 18:11:43,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:11:43,931 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-01-01 18:11:44,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:11:44,039 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-01-01 18:11:44,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 18:11:44,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-01 18:11:44,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:11:44,051 INFO L225 Difference]: With dead ends: 58 [2019-01-01 18:11:44,052 INFO L226 Difference]: Without dead ends: 54 [2019-01-01 18:11:44,053 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-01 18:11:44,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-01 18:11:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-01-01 18:11:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 18:11:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-01 18:11:44,096 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-01-01 18:11:44,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:11:44,096 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-01 18:11:44,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 18:11:44,097 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-01 18:11:44,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-01 18:11:44,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:11:44,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:11:44,100 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 18:11:44,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:11:44,100 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-01-01 18:11:44,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:11:44,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:11:44,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:44,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:11:44,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:44,165 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-01 18:11:44,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:11:44,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 18:11:44,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 18:11:44,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 18:11:44,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 18:11:44,169 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2019-01-01 18:11:44,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:11:44,294 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-01-01 18:11:44,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 18:11:44,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-01 18:11:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:11:44,299 INFO L225 Difference]: With dead ends: 49 [2019-01-01 18:11:44,300 INFO L226 Difference]: Without dead ends: 49 [2019-01-01 18:11:44,301 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-01 18:11:44,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-01 18:11:44,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2019-01-01 18:11:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-01 18:11:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-01-01 18:11:44,314 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2019-01-01 18:11:44,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:11:44,315 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-01-01 18:11:44,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 18:11:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-01-01 18:11:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 18:11:44,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:11:44,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:11:44,317 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 18:11:44,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:11:44,317 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2019-01-01 18:11:44,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:11:44,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:11:44,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:44,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:11:44,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:44,490 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-01 18:11:44,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:11:44,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 18:11:44,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:11:44,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:11:44,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:11:44,493 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-01-01 18:11:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:11:44,742 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-01-01 18:11:44,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 18:11:44,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-01-01 18:11:44,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:11:44,743 INFO L225 Difference]: With dead ends: 40 [2019-01-01 18:11:44,744 INFO L226 Difference]: Without dead ends: 40 [2019-01-01 18:11:44,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:11:44,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-01 18:11:44,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-01 18:11:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 18:11:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-01 18:11:44,750 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2019-01-01 18:11:44,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:11:44,750 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-01 18:11:44,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:11:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-01 18:11:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 18:11:44,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:11:44,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:11:44,751 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 18:11:44,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:11:44,752 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2019-01-01 18:11:44,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:11:44,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:11:44,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:44,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:11:44,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:44,973 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-01 18:11:44,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:11:44,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:11:44,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 18:11:44,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 18:11:44,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:11:44,978 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2019-01-01 18:11:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:11:45,273 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-01-01 18:11:45,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 18:11:45,275 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-01 18:11:45,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:11:45,276 INFO L225 Difference]: With dead ends: 42 [2019-01-01 18:11:45,277 INFO L226 Difference]: Without dead ends: 42 [2019-01-01 18:11:45,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 18:11:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-01 18:11:45,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-01-01 18:11:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 18:11:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-01 18:11:45,289 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2019-01-01 18:11:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:11:45,289 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-01 18:11:45,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 18:11:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-01 18:11:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-01 18:11:45,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:11:45,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:11:45,292 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 18:11:45,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:11:45,292 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-01-01 18:11:45,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:11:45,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:11:45,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:45,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:11:45,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:45,470 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-01 18:11:45,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 18:11:45,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 18:11:45,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 18:11:45,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 18:11:45,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 18:11:45,471 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-01-01 18:11:45,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:11:45,872 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-01-01 18:11:45,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 18:11:45,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-01 18:11:45,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:11:45,875 INFO L225 Difference]: With dead ends: 45 [2019-01-01 18:11:45,876 INFO L226 Difference]: Without dead ends: 42 [2019-01-01 18:11:45,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 18:11:45,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-01 18:11:45,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-01-01 18:11:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 18:11:45,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-01 18:11:45,881 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 15 [2019-01-01 18:11:45,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:11:45,882 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-01 18:11:45,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 18:11:45,882 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-01 18:11:45,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-01 18:11:45,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:11:45,883 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:11:45,883 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 18:11:45,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:11:45,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2019-01-01 18:11:45,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:11:45,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:11:45,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:45,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:11:45,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:11:46,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:11:46,035 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-01 18:11:46,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:11:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:46,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:11:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:11:46,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:11:46,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2019-01-01 18:11:46,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 18:11:46,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 18:11:46,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-01 18:11:46,150 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 9 states. [2019-01-01 18:11:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:11:46,386 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-01-01 18:11:46,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 18:11:46,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-01 18:11:46,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:11:46,392 INFO L225 Difference]: With dead ends: 47 [2019-01-01 18:11:46,392 INFO L226 Difference]: Without dead ends: 47 [2019-01-01 18:11:46,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-01-01 18:11:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-01 18:11:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-01 18:11:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-01 18:11:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-01-01 18:11:46,400 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 16 [2019-01-01 18:11:46,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:11:46,401 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-01-01 18:11:46,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 18:11:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-01-01 18:11:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 18:11:46,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:11:46,403 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:11:46,404 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 18:11:46,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:11:46,405 INFO L82 PathProgramCache]: Analyzing trace with hash -661735507, now seen corresponding path program 1 times [2019-01-01 18:11:46,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:11:46,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:11:46,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:46,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:11:46,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:11:46,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:11:46,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 18:11:46,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:11:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:46,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:11:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:11:47,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:11:47,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-01-01 18:11:47,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 18:11:47,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 18:11:47,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-01-01 18:11:47,053 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 12 states. [2019-01-01 18:11:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:11:47,514 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-01-01 18:11:47,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 18:11:47,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-01-01 18:11:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:11:47,520 INFO L225 Difference]: With dead ends: 59 [2019-01-01 18:11:47,520 INFO L226 Difference]: Without dead ends: 56 [2019-01-01 18:11:47,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-01-01 18:11:47,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-01 18:11:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2019-01-01 18:11:47,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-01 18:11:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-01-01 18:11:47,535 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 30 [2019-01-01 18:11:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:11:47,536 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-01-01 18:11:47,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 18:11:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-01-01 18:11:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 18:11:47,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:11:47,538 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:11:47,538 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 18:11:47,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:11:47,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1228723374, now seen corresponding path program 2 times [2019-01-01 18:11:47,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:11:47,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:11:47,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:47,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:11:47,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:47,873 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:11:47,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:11:47,873 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-01 18:11:47,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 18:11:47,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 18:11:47,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 18:11:47,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:11:48,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:11:48,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-01 18:11:48,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-01 18:11:48,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:11:48,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:11:48,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:11:48,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-01-01 18:11:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-01-01 18:11:48,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 18:11:48,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-01-01 18:11:48,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 18:11:48,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 18:11:48,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-01 18:11:48,297 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 10 states. [2019-01-01 18:11:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:11:48,790 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-01-01 18:11:48,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 18:11:48,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-01 18:11:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:11:48,793 INFO L225 Difference]: With dead ends: 62 [2019-01-01 18:11:48,793 INFO L226 Difference]: Without dead ends: 59 [2019-01-01 18:11:48,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-01-01 18:11:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-01 18:11:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2019-01-01 18:11:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-01 18:11:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-01-01 18:11:48,803 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 35 [2019-01-01 18:11:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:11:48,804 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-01-01 18:11:48,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 18:11:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-01-01 18:11:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-01 18:11:48,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:11:48,806 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:11:48,807 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 18:11:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:11:48,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1819430834, now seen corresponding path program 1 times [2019-01-01 18:11:48,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:11:48,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:11:48,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:48,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 18:11:48,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:49,412 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-01-01 18:11:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:11:49,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:11:49,520 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-01 18:11:49,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:11:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:49,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:11:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:11:49,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:11:49,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-01-01 18:11:49,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-01 18:11:49,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-01 18:11:49,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-01-01 18:11:49,876 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 16 states. [2019-01-01 18:11:50,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:11:50,585 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-01 18:11:50,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 18:11:50,593 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-01-01 18:11:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:11:50,594 INFO L225 Difference]: With dead ends: 67 [2019-01-01 18:11:50,594 INFO L226 Difference]: Without dead ends: 64 [2019-01-01 18:11:50,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-01-01 18:11:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-01 18:11:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-01-01 18:11:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-01 18:11:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-01-01 18:11:50,601 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 40 [2019-01-01 18:11:50,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:11:50,602 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-01-01 18:11:50,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-01 18:11:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-01-01 18:11:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 18:11:50,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:11:50,605 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:11:50,605 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 18:11:50,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:11:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2080753, now seen corresponding path program 2 times [2019-01-01 18:11:50,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:11:50,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:11:50,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:50,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:11:50,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:11:50,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:11:50,935 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-01 18:11:50,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 18:11:50,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 18:11:50,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 18:11:50,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:11:51,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 18:11:51,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 18:11:51,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-01 18:11:51,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:11:51,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-01 18:11:51,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 18:11:51,036 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:11:51,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 18:11:51,047 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-01-01 18:11:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-01 18:11:51,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 18:11:51,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2019-01-01 18:11:51,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 18:11:51,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 18:11:51,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-01 18:11:51,385 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 13 states. [2019-01-01 18:11:52,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:11:52,036 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-01 18:11:52,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 18:11:52,037 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-01-01 18:11:52,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:11:52,039 INFO L225 Difference]: With dead ends: 70 [2019-01-01 18:11:52,039 INFO L226 Difference]: Without dead ends: 67 [2019-01-01 18:11:52,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-01-01 18:11:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-01 18:11:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-01-01 18:11:52,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-01 18:11:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2019-01-01 18:11:52,048 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 45 [2019-01-01 18:11:52,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:11:52,049 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2019-01-01 18:11:52,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 18:11:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2019-01-01 18:11:52,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-01 18:11:52,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:11:52,052 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:11:52,052 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 18:11:52,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:11:52,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1165684695, now seen corresponding path program 1 times [2019-01-01 18:11:52,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:11:52,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:11:52,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:52,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 18:11:52,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-01-01 18:11:52,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:11:52,196 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-01 18:11:52,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:11:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:52,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:11:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 1 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 18:11:52,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 18:11:52,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11] total 13 [2019-01-01 18:11:52,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-01 18:11:52,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 18:11:52,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-01 18:11:52,638 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 13 states. [2019-01-01 18:11:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:11:52,844 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-01-01 18:11:52,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 18:11:52,844 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-01-01 18:11:52,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:11:52,846 INFO L225 Difference]: With dead ends: 99 [2019-01-01 18:11:52,847 INFO L226 Difference]: Without dead ends: 96 [2019-01-01 18:11:52,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-01-01 18:11:52,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-01 18:11:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2019-01-01 18:11:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-01 18:11:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-01-01 18:11:52,855 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 59 [2019-01-01 18:11:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:11:52,855 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-01-01 18:11:52,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-01 18:11:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-01-01 18:11:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-01 18:11:52,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 18:11:52,861 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 18:11:52,861 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr2REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2019-01-01 18:11:52,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 18:11:52,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1970017626, now seen corresponding path program 2 times [2019-01-01 18:11:52,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 18:11:52,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 18:11:52,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:52,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 18:11:52,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 18:11:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 18:11:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-01-01 18:11:53,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 18:11:53,018 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-01 18:11:53,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 18:11:53,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 18:11:53,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 18:11:53,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 18:11:53,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:11:53,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2019-01-01 18:11:53,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-01 18:11:53,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:11:53,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:11:53,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 18:11:53,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-01 18:11:53,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 18:11:53,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2019-01-01 18:11:53,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-01 18:11:53,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 18:11:53,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 18:11:53,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 18:11:53,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-01 18:11:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2019-01-01 18:11:54,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 18:11:54,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-01-01 18:11:54,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 18:11:54,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 18:11:54,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=51, Unknown=1, NotChecked=0, Total=72 [2019-01-01 18:11:54,301 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2019-01-01 18:12:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 18:12:09,062 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-01-01 18:12:09,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 18:12:09,063 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-01-01 18:12:09,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 18:12:09,064 INFO L225 Difference]: With dead ends: 101 [2019-01-01 18:12:09,064 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 18:12:09,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=173, Unknown=1, NotChecked=0, Total=240 [2019-01-01 18:12:09,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 18:12:09,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 18:12:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 18:12:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 18:12:09,067 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2019-01-01 18:12:09,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 18:12:09,067 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 18:12:09,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 18:12:09,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 18:12:09,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 18:12:09,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 06:12:09 BoogieIcfgContainer [2019-01-01 18:12:09,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 18:12:09,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 18:12:09,074 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 18:12:09,074 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 18:12:09,075 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 06:11:43" (3/4) ... [2019-01-01 18:12:09,078 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 18:12:09,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 18:12:09,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-01-01 18:12:09,086 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 18:12:09,091 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-01-01 18:12:09,091 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-01 18:12:09,091 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 18:12:09,091 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 18:12:09,140 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 18:12:09,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 18:12:09,142 INFO L168 Benchmark]: Toolchain (without parser) took 26573.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.0 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -240.8 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2019-01-01 18:12:09,143 INFO L168 Benchmark]: CDTParser took 0.16 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-01 18:12:09,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.94 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 18:12:09,144 INFO L168 Benchmark]: Boogie Preprocessor took 64.95 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 18:12:09,146 INFO L168 Benchmark]: RCFGBuilder took 677.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-01-01 18:12:09,146 INFO L168 Benchmark]: TraceAbstraction took 25459.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 130.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -101.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2019-01-01 18:12:09,147 INFO L168 Benchmark]: Witness Printer took 66.68 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2019-01-01 18:12:09,152 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.16 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 299.94 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.95 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 677.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -161.6 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25459.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 130.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -101.6 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Witness Printer took 66.68 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. SAFE Result, 25.4s OverallTime, 12 OverallIterations, 16 TraceHistogramMax, 18.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 315 SDtfs, 483 SDslu, 1344 SDs, 0 SdLazy, 946 SolverSat, 81 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 16.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 317 SyntacticMatches, 5 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 63 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 740 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 721 ConstructedInterpolants, 159 QuantifiedInterpolants, 362989 SizeOfPredicates, 8 NumberOfNonLiveVariables, 679 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 1511/1896 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...