./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 62ed6df4fdaf468f52c0eff1159abadc4f432e3d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 62ed6df4fdaf468f52c0eff1159abadc4f432e3d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 08:14:56,663 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:14:56,664 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:14:56,670 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:14:56,670 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:14:56,671 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:14:56,672 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:14:56,673 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:14:56,674 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:14:56,675 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:14:56,675 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:14:56,675 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:14:56,676 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:14:56,677 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:14:56,678 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:14:56,678 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:14:56,679 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:14:56,680 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:14:56,682 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:14:56,683 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:14:56,683 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:14:56,684 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:14:56,686 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:14:56,686 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:14:56,686 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:14:56,687 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:14:56,688 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:14:56,688 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:14:56,689 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:14:56,690 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:14:56,690 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:14:56,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:14:56,690 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:14:56,691 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:14:56,691 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:14:56,692 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:14:56,692 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 08:14:56,701 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:14:56,701 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:14:56,702 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:14:56,702 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 08:14:56,702 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 08:14:56,702 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 08:14:56,702 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 08:14:56,702 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 08:14:56,703 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 08:14:56,703 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 08:14:56,703 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 08:14:56,703 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 08:14:56,703 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 08:14:56,704 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 08:14:56,704 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 08:14:56,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:14:56,704 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:14:56,704 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 08:14:56,704 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:14:56,705 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:14:56,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:14:56,705 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 08:14:56,705 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 08:14:56,705 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 08:14:56,705 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:14:56,705 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:14:56,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:14:56,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:14:56,706 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:14:56,706 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 08:14:56,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:14:56,706 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:14:56,706 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:14:56,707 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 08:14:56,707 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:14:56,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 08:14:56,707 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan 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 -> Taipan 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 -> 62ed6df4fdaf468f52c0eff1159abadc4f432e3d [2018-12-02 08:14:56,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:14:56,734 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:14:56,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:14:56,738 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:14:56,738 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:14:56,738 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/../../sv-benchmarks/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-12-02 08:14:56,782 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/data/89c09eaab/301db65b047447d0bbe5c716d56436f4/FLAGf04b37090 [2018-12-02 08:14:57,189 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:14:57,190 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/sv-benchmarks/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-12-02 08:14:57,196 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/data/89c09eaab/301db65b047447d0bbe5c716d56436f4/FLAGf04b37090 [2018-12-02 08:14:57,204 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/data/89c09eaab/301db65b047447d0bbe5c716d56436f4 [2018-12-02 08:14:57,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:14:57,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:14:57,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:14:57,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:14:57,209 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:14:57,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:14:57" (1/1) ... [2018-12-02 08:14:57,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4834854b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:14:57, skipping insertion in model container [2018-12-02 08:14:57,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:14:57" (1/1) ... [2018-12-02 08:14:57,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:14:57,233 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:14:57,371 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:14:57,378 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:14:57,447 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:14:57,476 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:14:57,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:14:57 WrapperNode [2018-12-02 08:14:57,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:14:57,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:14:57,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:14:57,476 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:14:57,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:14:57" (1/1) ... [2018-12-02 08:14:57,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:14:57" (1/1) ... [2018-12-02 08:14:57,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:14:57,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:14:57,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:14:57,494 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:14:57,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:14:57" (1/1) ... [2018-12-02 08:14:57,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:14:57" (1/1) ... [2018-12-02 08:14:57,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:14:57" (1/1) ... [2018-12-02 08:14:57,503 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:14:57" (1/1) ... [2018-12-02 08:14:57,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:14:57" (1/1) ... [2018-12-02 08:14:57,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:14:57" (1/1) ... [2018-12-02 08:14:57,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:14:57" (1/1) ... [2018-12-02 08:14:57,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:14:57,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:14:57,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:14:57,516 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:14:57,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:14:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/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 [2018-12-02 08:14:57,550 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 08:14:57,550 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 08:14:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 08:14:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 08:14:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 08:14:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 08:14:57,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 08:14:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 08:14:57,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 08:14:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 08:14:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 08:14:57,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:14:57,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:14:57,718 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:14:57,718 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 08:14:57,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:14:57 BoogieIcfgContainer [2018-12-02 08:14:57,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:14:57,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 08:14:57,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 08:14:57,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 08:14:57,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:14:57" (1/3) ... [2018-12-02 08:14:57,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7132a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:14:57, skipping insertion in model container [2018-12-02 08:14:57,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:14:57" (2/3) ... [2018-12-02 08:14:57,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d7132a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:14:57, skipping insertion in model container [2018-12-02 08:14:57,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:14:57" (3/3) ... [2018-12-02 08:14:57,723 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2018-12-02 08:14:57,729 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 08:14:57,734 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-02 08:14:57,743 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-02 08:14:57,759 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 08:14:57,759 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 08:14:57,759 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 08:14:57,759 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:14:57,759 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:14:57,759 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 08:14:57,759 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:14:57,759 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 08:14:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-12-02 08:14:57,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 08:14:57,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:14:57,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:14:57,776 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:14:57,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:14:57,779 INFO L82 PathProgramCache]: Analyzing trace with hash -917276329, now seen corresponding path program 1 times [2018-12-02 08:14:57,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:14:57,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:57,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:14:57,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:57,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:14:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:14:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:14:57,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:14:57,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 08:14:57,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:14:57,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 08:14:57,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 08:14:57,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 08:14:57,868 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-12-02 08:14:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:14:57,879 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-12-02 08:14:57,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 08:14:57,880 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-02 08:14:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:14:57,885 INFO L225 Difference]: With dead ends: 49 [2018-12-02 08:14:57,885 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 08:14:57,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 08:14:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 08:14:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-02 08:14:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 08:14:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-02 08:14:57,907 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 10 [2018-12-02 08:14:57,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:14:57,907 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-02 08:14:57,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 08:14:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-02 08:14:57,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 08:14:57,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:14:57,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:14:57,908 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:14:57,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:14:57,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1629180124, now seen corresponding path program 1 times [2018-12-02 08:14:57,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:14:57,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:57,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:14:57,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:57,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:14:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:14:57,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:14:57,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:14:57,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:14:57,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:14:57,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:14:57,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:14:57,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:14:57,945 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 4 states. [2018-12-02 08:14:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:14:58,017 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-12-02 08:14:58,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:14:58,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 08:14:58,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:14:58,018 INFO L225 Difference]: With dead ends: 49 [2018-12-02 08:14:58,018 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 08:14:58,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:14:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 08:14:58,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-12-02 08:14:58,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 08:14:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-02 08:14:58,022 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 11 [2018-12-02 08:14:58,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:14:58,022 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-02 08:14:58,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:14:58,022 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-02 08:14:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 08:14:58,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:14:58,022 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:14:58,023 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:14:58,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:14:58,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1629180125, now seen corresponding path program 1 times [2018-12-02 08:14:58,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:14:58,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:58,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:14:58,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:58,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:14:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:14:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:14:58,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:14:58,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:14:58,058 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:14:58,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:14:58,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:14:58,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:14:58,058 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 4 states. [2018-12-02 08:14:58,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:14:58,113 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-12-02 08:14:58,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:14:58,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 08:14:58,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:14:58,114 INFO L225 Difference]: With dead ends: 56 [2018-12-02 08:14:58,114 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 08:14:58,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:14:58,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 08:14:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2018-12-02 08:14:58,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 08:14:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-12-02 08:14:58,117 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 11 [2018-12-02 08:14:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:14:58,118 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-12-02 08:14:58,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:14:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-12-02 08:14:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 08:14:58,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:14:58,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:14:58,118 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:14:58,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:14:58,119 INFO L82 PathProgramCache]: Analyzing trace with hash 338774403, now seen corresponding path program 1 times [2018-12-02 08:14:58,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:14:58,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:58,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:14:58,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:58,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:14:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:14:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:14:58,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:14:58,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:14:58,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:14:58,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:14:58,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:14:58,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:14:58,154 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2018-12-02 08:14:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:14:58,194 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-12-02 08:14:58,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:14:58,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-02 08:14:58,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:14:58,194 INFO L225 Difference]: With dead ends: 53 [2018-12-02 08:14:58,195 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 08:14:58,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:14:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 08:14:58,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-12-02 08:14:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 08:14:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-12-02 08:14:58,197 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 16 [2018-12-02 08:14:58,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:14:58,197 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-12-02 08:14:58,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:14:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-12-02 08:14:58,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 08:14:58,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:14:58,198 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:14:58,198 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:14:58,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:14:58,198 INFO L82 PathProgramCache]: Analyzing trace with hash 726893263, now seen corresponding path program 1 times [2018-12-02 08:14:58,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:14:58,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:58,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:14:58,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:58,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:14:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:14:58,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:14:58,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:14:58,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:14:58,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:14:58,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:14:58,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:14:58,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:14:58,235 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 6 states. [2018-12-02 08:14:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:14:58,330 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-12-02 08:14:58,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 08:14:58,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-02 08:14:58,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:14:58,331 INFO L225 Difference]: With dead ends: 64 [2018-12-02 08:14:58,331 INFO L226 Difference]: Without dead ends: 64 [2018-12-02 08:14:58,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 08:14:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-02 08:14:58,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2018-12-02 08:14:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 08:14:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-12-02 08:14:58,334 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 19 [2018-12-02 08:14:58,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:14:58,334 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-12-02 08:14:58,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:14:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-12-02 08:14:58,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 08:14:58,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:14:58,335 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:14:58,335 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:14:58,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:14:58,336 INFO L82 PathProgramCache]: Analyzing trace with hash 726893264, now seen corresponding path program 1 times [2018-12-02 08:14:58,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:14:58,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:58,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:14:58,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:58,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:14:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:14:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:14:58,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:14:58,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:14:58,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 08:14:58,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:14:58,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:14:58,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:14:58,386 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2018-12-02 08:14:58,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:14:58,520 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-02 08:14:58,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:14:58,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-02 08:14:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:14:58,521 INFO L225 Difference]: With dead ends: 60 [2018-12-02 08:14:58,521 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 08:14:58,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:14:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 08:14:58,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2018-12-02 08:14:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 08:14:58,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-12-02 08:14:58,525 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 19 [2018-12-02 08:14:58,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:14:58,525 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-12-02 08:14:58,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:14:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-12-02 08:14:58,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 08:14:58,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:14:58,526 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:14:58,526 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:14:58,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:14:58,527 INFO L82 PathProgramCache]: Analyzing trace with hash -365347375, now seen corresponding path program 1 times [2018-12-02 08:14:58,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:14:58,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:58,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:14:58,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:58,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:14:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:14:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:14:58,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:14:58,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 08:14:58,614 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-02 08:14:58,616 INFO L205 CegarAbsIntRunner]: [0], [1], [10], [16], [18], [23], [26], [50], [53], [56], [65], [66], [67], [75], [77], [80], [87], [88], [89] [2018-12-02 08:14:58,639 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 08:14:58,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 08:14:58,747 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 08:14:58,748 INFO L272 AbstractInterpreter]: Visited 19 different actions 25 times. Merged at 6 different actions 6 times. Never widened. Performed 180 root evaluator evaluations with a maximum evaluation depth of 3. Performed 180 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 26 variables. [2018-12-02 08:14:58,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:14:58,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 08:14:58,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:14:58,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/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 [2018-12-02 08:14:58,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:14:58,761 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 08:14:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:14:58,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:14:58,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:14:58,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:14:58,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:14:58,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:14:58,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 08:14:58,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 08:14:58,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:14:58,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:14:58,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:14:58,870 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-12-02 08:14:58,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 08:14:58,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 08:14:58,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:14:58,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:14:58,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 08:14:58,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 08:14:58,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:14:58,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:14:58,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:14:58,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-02 08:14:58,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:14:58,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:14:59,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 19 treesize of output 17 [2018-12-02 08:14:59,024 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-02 08:14:59,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:14:59,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:14:59,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-02 08:14:59,030 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-02 08:14:59,030 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:14:59,033 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:14:59,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 19 treesize of output 17 [2018-12-02 08:14:59,065 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-02 08:14:59,065 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 08:14:59,069 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:14:59,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-02 08:14:59,071 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-02 08:14:59,072 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 08:14:59,075 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:14:59,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 08:14:59,094 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:53, output treesize:24 [2018-12-02 08:14:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:14:59,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 08:14:59,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 16 [2018-12-02 08:14:59,168 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 08:14:59,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 08:14:59,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 08:14:59,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-12-02 08:14:59,169 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 11 states. [2018-12-02 08:14:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:14:59,314 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-12-02 08:14:59,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:14:59,314 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-02 08:14:59,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:14:59,315 INFO L225 Difference]: With dead ends: 55 [2018-12-02 08:14:59,315 INFO L226 Difference]: Without dead ends: 55 [2018-12-02 08:14:59,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-12-02 08:14:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-02 08:14:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2018-12-02 08:14:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 08:14:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-12-02 08:14:59,319 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 20 [2018-12-02 08:14:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:14:59,319 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-12-02 08:14:59,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 08:14:59,319 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-12-02 08:14:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 08:14:59,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:14:59,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:14:59,320 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:14:59,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:14:59,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1559131954, now seen corresponding path program 1 times [2018-12-02 08:14:59,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 08:14:59,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:59,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:14:59,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 08:14:59,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 08:14:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:14:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:14:59,352 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 08:14:59,361 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 08:14:59,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:14:59 BoogieIcfgContainer [2018-12-02 08:14:59,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 08:14:59,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:14:59,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:14:59,371 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:14:59,371 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:14:57" (3/4) ... [2018-12-02 08:14:59,373 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 08:14:59,373 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:14:59,374 INFO L168 Benchmark]: Toolchain (without parser) took 2167.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 947.0 MB in the beginning and 785.8 MB in the end (delta: 161.2 MB). Peak memory consumption was 278.6 MB. Max. memory is 11.5 GB. [2018-12-02 08:14:59,375 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:14:59,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. [2018-12-02 08:14:59,376 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:14:59,376 INFO L168 Benchmark]: Boogie Preprocessor took 21.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:14:59,376 INFO L168 Benchmark]: RCFGBuilder took 202.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-12-02 08:14:59,376 INFO L168 Benchmark]: TraceAbstraction took 1651.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 785.8 MB in the end (delta: 287.4 MB). Peak memory consumption was 287.4 MB. Max. memory is 11.5 GB. [2018-12-02 08:14:59,376 INFO L168 Benchmark]: Witness Printer took 2.70 ms. Allocated memory is still 1.1 GB. Free memory is still 785.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:14:59,378 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 268.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -152.8 MB). Peak memory consumption was 29.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.01 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 202.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1651.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 785.8 MB in the end (delta: 287.4 MB). Peak memory consumption was 287.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.70 ms. Allocated memory is still 1.1 GB. Free memory is still 785.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={13:0}, malloc(sizeof(struct node))={13:0}] [L628] COND FALSE !(a == 0) VAL [a={13:0}, malloc(sizeof(struct node))={13:0}] [L629] List t; [L630] List p = a; VAL [a={13:0}, malloc(sizeof(struct node))={13:0}, p={13:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] p->h = 1 VAL [a={13:0}, malloc(sizeof(struct node))={13:0}, p={13:0}] [L639] p->n = 0 VAL [a={13:0}, malloc(sizeof(struct node))={13:0}, p={13:0}] [L640] p = a VAL [a={13:0}, malloc(sizeof(struct node))={13:0}, p={13:0}] [L641] COND TRUE p!=0 VAL [a={13:0}, malloc(sizeof(struct node))={13:0}, p={13:0}] [L642] EXPR p->h VAL [a={13:0}, malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=1] [L642] COND FALSE !(p->h != 1) [L645] EXPR p->n VAL [a={13:0}, malloc(sizeof(struct node))={13:0}, p={13:0}, p->n={0:0}] [L645] p = p->n [L641] COND FALSE !(p!=0) VAL [a={13:0}, malloc(sizeof(struct node))={13:0}, p={0:0}] [L647] return 0; VAL [\result=0, a={13:0}, malloc(sizeof(struct node))={13:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 51 locations, 15 error locations. UNSAFE Result, 1.6s OverallTime, 8 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 200 SDtfs, 385 SDslu, 278 SDs, 0 SdLazy, 442 SolverSat, 51 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 37 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 137 ConstructedInterpolants, 1 QuantifiedInterpolants, 15217 SizeOfPredicates, 14 NumberOfNonLiveVariables, 92 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 7/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 08:15:00,770 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 08:15:00,771 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 08:15:00,777 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 08:15:00,777 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 08:15:00,778 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 08:15:00,778 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 08:15:00,779 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 08:15:00,780 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 08:15:00,780 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 08:15:00,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 08:15:00,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 08:15:00,781 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 08:15:00,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 08:15:00,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 08:15:00,782 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 08:15:00,783 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 08:15:00,784 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 08:15:00,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 08:15:00,786 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 08:15:00,786 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 08:15:00,787 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 08:15:00,788 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 08:15:00,788 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 08:15:00,788 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 08:15:00,788 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 08:15:00,789 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 08:15:00,789 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 08:15:00,790 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 08:15:00,790 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 08:15:00,791 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 08:15:00,791 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 08:15:00,791 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 08:15:00,792 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 08:15:00,792 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 08:15:00,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 08:15:00,793 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-02 08:15:00,803 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 08:15:00,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 08:15:00,803 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 08:15:00,804 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 08:15:00,804 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 08:15:00,804 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 08:15:00,804 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 08:15:00,804 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 08:15:00,804 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 08:15:00,805 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 08:15:00,805 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 08:15:00,805 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 08:15:00,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 08:15:00,806 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 08:15:00,806 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 08:15:00,806 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 08:15:00,806 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 08:15:00,806 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 08:15:00,806 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 08:15:00,806 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 08:15:00,807 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 08:15:00,807 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 08:15:00,807 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 08:15:00,807 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 08:15:00,807 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 08:15:00,807 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 08:15:00,808 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 08:15:00,808 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 08:15:00,808 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 08:15:00,808 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 08:15:00,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 08:15:00,808 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 08:15:00,809 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 08:15:00,809 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 08:15:00,809 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 08:15:00,809 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 08:15:00,809 INFO L133 SettingsManager]: * Logic for external solver=AUFBV 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan 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 -> Taipan 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 -> 62ed6df4fdaf468f52c0eff1159abadc4f432e3d [2018-12-02 08:15:00,832 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 08:15:00,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 08:15:00,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 08:15:00,843 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 08:15:00,843 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 08:15:00,844 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/../../sv-benchmarks/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-12-02 08:15:00,880 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/data/ce6d98bad/94482b2686b941a28859f3f5086e82f2/FLAG2dae1d965 [2018-12-02 08:15:01,292 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 08:15:01,292 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/sv-benchmarks/c/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-12-02 08:15:01,298 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/data/ce6d98bad/94482b2686b941a28859f3f5086e82f2/FLAG2dae1d965 [2018-12-02 08:15:01,307 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/data/ce6d98bad/94482b2686b941a28859f3f5086e82f2 [2018-12-02 08:15:01,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 08:15:01,309 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 08:15:01,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 08:15:01,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 08:15:01,312 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 08:15:01,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:15:01" (1/1) ... [2018-12-02 08:15:01,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5554d819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:15:01, skipping insertion in model container [2018-12-02 08:15:01,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:15:01" (1/1) ... [2018-12-02 08:15:01,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 08:15:01,341 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 08:15:01,517 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:15:01,525 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 08:15:01,549 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 08:15:01,605 INFO L195 MainTranslator]: Completed translation [2018-12-02 08:15:01,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:15:01 WrapperNode [2018-12-02 08:15:01,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 08:15:01,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 08:15:01,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 08:15:01,606 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 08:15:01,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:15:01" (1/1) ... [2018-12-02 08:15:01,619 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:15:01" (1/1) ... [2018-12-02 08:15:01,624 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 08:15:01,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 08:15:01,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 08:15:01,624 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 08:15:01,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:15:01" (1/1) ... [2018-12-02 08:15:01,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:15:01" (1/1) ... [2018-12-02 08:15:01,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:15:01" (1/1) ... [2018-12-02 08:15:01,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:15:01" (1/1) ... [2018-12-02 08:15:01,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:15:01" (1/1) ... [2018-12-02 08:15:01,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:15:01" (1/1) ... [2018-12-02 08:15:01,640 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:15:01" (1/1) ... [2018-12-02 08:15:01,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 08:15:01,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 08:15:01,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 08:15:01,641 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 08:15:01,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:15:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/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 [2018-12-02 08:15:01,672 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 08:15:01,672 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 08:15:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 08:15:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-02 08:15:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 08:15:01,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 08:15:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 08:15:01,673 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 08:15:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 08:15:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 08:15:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-02 08:15:01,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 08:15:01,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 08:15:01,884 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 08:15:01,884 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 08:15:01,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:15:01 BoogieIcfgContainer [2018-12-02 08:15:01,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 08:15:01,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 08:15:01,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 08:15:01,886 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 08:15:01,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:15:01" (1/3) ... [2018-12-02 08:15:01,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482db5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:15:01, skipping insertion in model container [2018-12-02 08:15:01,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:15:01" (2/3) ... [2018-12-02 08:15:01,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482db5e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:15:01, skipping insertion in model container [2018-12-02 08:15:01,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:15:01" (3/3) ... [2018-12-02 08:15:01,888 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2018-12-02 08:15:01,894 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 08:15:01,898 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-02 08:15:01,907 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-02 08:15:01,921 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 08:15:01,922 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 08:15:01,922 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 08:15:01,922 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 08:15:01,922 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 08:15:01,922 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 08:15:01,922 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 08:15:01,922 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 08:15:01,922 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 08:15:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-12-02 08:15:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 08:15:01,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:15:01,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:15:01,937 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:15:01,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:15:01,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1636896370, now seen corresponding path program 1 times [2018-12-02 08:15:01,942 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:15:01,942 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:15:01,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:15:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:15:01,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:15:02,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 08:15:02,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:02,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:02,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 08:15:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:15:02,039 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:15:02,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:15:02,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:15:02,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:15:02,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:15:02,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:15:02,053 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2018-12-02 08:15:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:15:02,202 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-12-02 08:15:02,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:15:02,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 08:15:02,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:15:02,207 INFO L225 Difference]: With dead ends: 56 [2018-12-02 08:15:02,207 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 08:15:02,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:15:02,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 08:15:02,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-12-02 08:15:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 08:15:02,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-02 08:15:02,229 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 10 [2018-12-02 08:15:02,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:15:02,229 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-02 08:15:02,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:15:02,229 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-02 08:15:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 08:15:02,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:15:02,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:15:02,230 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:15:02,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:15:02,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1636896369, now seen corresponding path program 1 times [2018-12-02 08:15:02,230 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:15:02,230 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:15:02,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:15:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:15:02,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:15:02,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 08:15:02,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:02,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:02,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 08:15:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:15:02,295 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:15:02,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:15:02,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 08:15:02,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:15:02,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:15:02,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:15:02,298 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 4 states. [2018-12-02 08:15:02,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:15:02,457 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-12-02 08:15:02,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:15:02,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 08:15:02,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:15:02,458 INFO L225 Difference]: With dead ends: 54 [2018-12-02 08:15:02,458 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 08:15:02,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:15:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 08:15:02,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-12-02 08:15:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 08:15:02,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-12-02 08:15:02,462 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 10 [2018-12-02 08:15:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:15:02,462 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-12-02 08:15:02,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:15:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-12-02 08:15:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 08:15:02,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:15:02,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:15:02,463 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:15:02,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:15:02,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1775351888, now seen corresponding path program 1 times [2018-12-02 08:15:02,464 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:15:02,464 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:15:02,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:15:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:15:02,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:15:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:15:02,505 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:15:02,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:15:02,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 08:15:02,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 08:15:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 08:15:02,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 08:15:02,508 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 4 states. [2018-12-02 08:15:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:15:02,615 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-12-02 08:15:02,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 08:15:02,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-02 08:15:02,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:15:02,616 INFO L225 Difference]: With dead ends: 51 [2018-12-02 08:15:02,616 INFO L226 Difference]: Without dead ends: 51 [2018-12-02 08:15:02,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 08:15:02,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-02 08:15:02,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-12-02 08:15:02,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-02 08:15:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-12-02 08:15:02,619 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 15 [2018-12-02 08:15:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:15:02,619 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-12-02 08:15:02,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 08:15:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-12-02 08:15:02,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 08:15:02,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:15:02,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:15:02,620 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:15:02,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:15:02,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1751361991, now seen corresponding path program 1 times [2018-12-02 08:15:02,621 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:15:02,621 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:15:02,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:15:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:15:02,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:15:02,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 08:15:02,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:02,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:02,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-02 08:15:02,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 08:15:02,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 08:15:02,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:02,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:02,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:02,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2018-12-02 08:15:02,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-02 08:15:02,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-12-02 08:15:02,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:02,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:02,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 08:15:02,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2018-12-02 08:15:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:15:02,750 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:15:02,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:15:02,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:15:02,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:15:02,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:15:02,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:15:02,752 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 6 states. [2018-12-02 08:15:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:15:02,970 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-12-02 08:15:02,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 08:15:02,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-02 08:15:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:15:02,971 INFO L225 Difference]: With dead ends: 47 [2018-12-02 08:15:02,971 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 08:15:02,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-02 08:15:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 08:15:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-02 08:15:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 08:15:02,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-12-02 08:15:02,974 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 17 [2018-12-02 08:15:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:15:02,974 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-12-02 08:15:02,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:15:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-12-02 08:15:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 08:15:02,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:15:02,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:15:02,975 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:15:02,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:15:02,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1751361992, now seen corresponding path program 1 times [2018-12-02 08:15:02,975 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:15:02,975 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:15:02,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:15:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:15:03,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:15:03,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 08:15:03,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 08:15:03,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 08:15:03,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 08:15:03,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 08:15:03,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 08:15:03,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,109 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2018-12-02 08:15:03,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 08:15:03,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 08:15:03,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-02 08:15:03,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-12-02 08:15:03,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,158 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:11 [2018-12-02 08:15:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:15:03,178 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 08:15:03,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 08:15:03,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 08:15:03,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 08:15:03,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 08:15:03,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 08:15:03,180 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 6 states. [2018-12-02 08:15:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:15:03,508 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-12-02 08:15:03,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 08:15:03,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-02 08:15:03,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:15:03,509 INFO L225 Difference]: With dead ends: 58 [2018-12-02 08:15:03,509 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 08:15:03,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-12-02 08:15:03,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 08:15:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 33. [2018-12-02 08:15:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 08:15:03,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-02 08:15:03,512 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 17 [2018-12-02 08:15:03,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:15:03,512 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-02 08:15:03,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 08:15:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-02 08:15:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 08:15:03,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:15:03,513 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:15:03,513 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:15:03,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:15:03,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1992620578, now seen corresponding path program 1 times [2018-12-02 08:15:03,514 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:15:03,514 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:15:03,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:15:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:15:03,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:15:03,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 08:15:03,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 08:15:03,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 08:15:03,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 08:15:03,606 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-12-02 08:15:03,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 08:15:03,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 08:15:03,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 08:15:03,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 08:15:03,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,652 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-02 08:15:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:15:03,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:15:03,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-02 08:15:03,761 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-02 08:15:03,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 13 treesize of output 11 [2018-12-02 08:15:03,767 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-02 08:15:03,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:15:03,780 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2018-12-02 08:15:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:15:03,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 08:15:03,796 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/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 [2018-12-02 08:15:03,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:15:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 08:15:03,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 08:15:03,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 08:15:03,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 08:15:03,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 08:15:03,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 08:15:03,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,850 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,856 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2018-12-02 08:15:03,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 08:15:03,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 08:15:03,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 08:15:03,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 08:15:03,878 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:03,882 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-02 08:15:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:15:03,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 08:15:04,137 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-12-02 08:15:04,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-12-02 08:15:04,149 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-02 08:15:04,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:04,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:04,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 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 29 treesize of output 27 [2018-12-02 08:15:04,186 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-12-02 08:15:04,186 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 08:15:04,216 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 08:15:04,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 08:15:04,361 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:41 [2018-12-02 08:15:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 08:15:04,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 08:15:04,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8, 9] total 16 [2018-12-02 08:15:04,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 08:15:04,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 08:15:04,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-12-02 08:15:04,561 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 16 states. [2018-12-02 08:15:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 08:15:04,906 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-12-02 08:15:04,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 08:15:04,906 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2018-12-02 08:15:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 08:15:04,907 INFO L225 Difference]: With dead ends: 53 [2018-12-02 08:15:04,907 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 08:15:04,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-12-02 08:15:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 08:15:04,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2018-12-02 08:15:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 08:15:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-12-02 08:15:04,910 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 19 [2018-12-02 08:15:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 08:15:04,910 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-12-02 08:15:04,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 08:15:04,911 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-12-02 08:15:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 08:15:04,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 08:15:04,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 08:15:04,911 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2018-12-02 08:15:04,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 08:15:04,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1641697084, now seen corresponding path program 1 times [2018-12-02 08:15:04,911 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 08:15:04,911 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e689d2d4-4772-4b04-998e-dea4fe80d27b/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 08:15:04,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 08:15:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:15:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 08:15:05,023 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 08:15:05,031 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 08:15:05,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:15:05 BoogieIcfgContainer [2018-12-02 08:15:05,041 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 08:15:05,041 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 08:15:05,041 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 08:15:05,041 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 08:15:05,041 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:15:01" (3/4) ... [2018-12-02 08:15:05,044 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 08:15:05,044 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 08:15:05,044 INFO L168 Benchmark]: Toolchain (without parser) took 3735.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -198.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2018-12-02 08:15:05,045 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:15:05,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. [2018-12-02 08:15:05,045 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:15:05,045 INFO L168 Benchmark]: Boogie Preprocessor took 17.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:15:05,045 INFO L168 Benchmark]: RCFGBuilder took 243.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 08:15:05,046 INFO L168 Benchmark]: TraceAbstraction took 3156.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.6 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2018-12-02 08:15:05,046 INFO L168 Benchmark]: Witness Printer took 2.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 08:15:05,047 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -198.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 243.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3156.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -31.6 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}] [L628] COND FALSE !(a == 0) VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}] [L629] List t; [L630] List p = a; VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={-2147483648:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] p->h = 1 VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={-2147483648:0}] [L639] p->n = 0 VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={-2147483648:0}] [L640] p = a VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={-2147483648:0}] [L641] COND TRUE p!=0 VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={-2147483648:0}] [L642] EXPR p->h VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={-2147483648:0}, p->h=1] [L642] COND FALSE !(p->h != 1) [L645] EXPR p->n VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={-2147483648:0}, p->n={0:0}] [L645] p = p->n [L641] COND FALSE !(p!=0) VAL [a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={0:0}] [L647] return 0; VAL [\result=0, a={-2147483648:0}, malloc(sizeof(struct node))={-2147483648:0}, p={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 15 error locations. UNSAFE Result, 3.1s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 142 SDtfs, 312 SDslu, 276 SDs, 0 SdLazy, 444 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 51 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 16946 SizeOfPredicates, 49 NumberOfNonLiveVariables, 404 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 6/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...