./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.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_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/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 022e5e55adeb2213dd3e7a54e30f105429bff667 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 04:07:40,891 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:07:40,892 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:07:40,898 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:07:40,898 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:07:40,899 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:07:40,900 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:07:40,901 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:07:40,902 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:07:40,903 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:07:40,904 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:07:40,904 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:07:40,904 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:07:40,905 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:07:40,906 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:07:40,906 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:07:40,907 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:07:40,908 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:07:40,910 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:07:40,911 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:07:40,911 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:07:40,912 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:07:40,914 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:07:40,914 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:07:40,914 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:07:40,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:07:40,915 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:07:40,916 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:07:40,917 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:07:40,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:07:40,917 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:07:40,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:07:40,918 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:07:40,918 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:07:40,919 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:07:40,919 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:07:40,919 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 04:07:40,927 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:07:40,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:07:40,928 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 04:07:40,928 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 04:07:40,928 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 04:07:40,928 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 04:07:40,929 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 04:07:40,929 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 04:07:40,929 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 04:07:40,929 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 04:07:40,929 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 04:07:40,929 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 04:07:40,930 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 04:07:40,930 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 04:07:40,930 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 04:07:40,930 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:07:40,931 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:07:40,931 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 04:07:40,931 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:07:40,931 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:07:40,931 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:07:40,931 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 04:07:40,931 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 04:07:40,932 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 04:07:40,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 04:07:40,932 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:07:40,932 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:07:40,932 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:07:40,932 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 04:07:40,932 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 04:07:40,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:07:40,933 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:07:40,933 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 04:07:40,933 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 04:07:40,933 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 04:07:40,933 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 04:07:40,933 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_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/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 -> 022e5e55adeb2213dd3e7a54e30f105429bff667 [2018-12-09 04:07:40,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:07:40,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:07:40,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:07:40,965 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:07:40,966 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:07:40,966 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 04:07:41,001 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/data/9d17b14e7/c6fb7ba4f090475f830dd38877a54482/FLAG73244b2a5 [2018-12-09 04:07:41,456 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:07:41,457 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/sv-benchmarks/c/array-memsafety/cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 04:07:41,462 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/data/9d17b14e7/c6fb7ba4f090475f830dd38877a54482/FLAG73244b2a5 [2018-12-09 04:07:41,470 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/data/9d17b14e7/c6fb7ba4f090475f830dd38877a54482 [2018-12-09 04:07:41,472 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:07:41,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:07:41,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:07:41,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:07:41,475 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:07:41,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:07:41" (1/1) ... [2018-12-09 04:07:41,477 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 09.12 04:07:41, skipping insertion in model container [2018-12-09 04:07:41,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:07:41" (1/1) ... [2018-12-09 04:07:41,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:07:41,499 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:07:41,637 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:07:41,643 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:07:41,699 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:07:41,718 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:07:41,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:41 WrapperNode [2018-12-09 04:07:41,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:07:41,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:07:41,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:07:41,719 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:07:41,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:41" (1/1) ... [2018-12-09 04:07:41,732 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:41" (1/1) ... [2018-12-09 04:07:41,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:07:41,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:07:41,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:07:41,737 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:07:41,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:41" (1/1) ... [2018-12-09 04:07:41,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:41" (1/1) ... [2018-12-09 04:07:41,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:41" (1/1) ... [2018-12-09 04:07:41,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:41" (1/1) ... [2018-12-09 04:07:41,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:41" (1/1) ... [2018-12-09 04:07:41,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:41" (1/1) ... [2018-12-09 04:07:41,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:41" (1/1) ... [2018-12-09 04:07:41,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:07:41,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:07:41,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:07:41,754 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:07:41,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/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-09 04:07:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 04:07:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 04:07:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 04:07:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 04:07:41,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 04:07:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 04:07:41,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 04:07:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure cstrcspn [2018-12-09 04:07:41,786 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrcspn [2018-12-09 04:07:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 04:07:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:07:41,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:07:41,946 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:07:41,946 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-09 04:07:41,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:07:41 BoogieIcfgContainer [2018-12-09 04:07:41,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:07:41,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 04:07:41,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 04:07:41,949 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 04:07:41,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:07:41" (1/3) ... [2018-12-09 04:07:41,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15772733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:07:41, skipping insertion in model container [2018-12-09 04:07:41,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:07:41" (2/3) ... [2018-12-09 04:07:41,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15772733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:07:41, skipping insertion in model container [2018-12-09 04:07:41,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:07:41" (3/3) ... [2018-12-09 04:07:41,951 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-12-09 04:07:41,957 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 04:07:41,961 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 04:07:41,971 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 04:07:41,986 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 04:07:41,986 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 04:07:41,986 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 04:07:41,987 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:07:41,987 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:07:41,987 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 04:07:41,987 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:07:41,987 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 04:07:41,996 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-12-09 04:07:42,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 04:07:42,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:42,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:42,003 INFO L423 AbstractCegarLoop]: === Iteration 1 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:42,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:42,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1987032655, now seen corresponding path program 1 times [2018-12-09 04:07:42,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:42,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:42,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:42,113 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-09 04:07:42,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:07:42,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 04:07:42,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:42,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:07:42,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:07:42,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:07:42,126 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-12-09 04:07:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:42,168 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-12-09 04:07:42,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:07:42,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 04:07:42,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:42,174 INFO L225 Difference]: With dead ends: 48 [2018-12-09 04:07:42,174 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 04:07:42,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:07:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 04:07:42,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 04:07:42,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 04:07:42,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-09 04:07:42,197 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2018-12-09 04:07:42,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:42,197 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-09 04:07:42,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:07:42,197 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-09 04:07:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 04:07:42,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:42,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:42,198 INFO L423 AbstractCegarLoop]: === Iteration 2 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:42,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:42,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1987032656, now seen corresponding path program 1 times [2018-12-09 04:07:42,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:42,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:42,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:42,243 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-09 04:07:42,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:07:42,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:07:42,243 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:42,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:07:42,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:07:42,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:07:42,245 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2018-12-09 04:07:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:42,262 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-09 04:07:42,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:07:42,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 04:07:42,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:42,263 INFO L225 Difference]: With dead ends: 44 [2018-12-09 04:07:42,263 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 04:07:42,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:07:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 04:07:42,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 04:07:42,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 04:07:42,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-09 04:07:42,267 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2018-12-09 04:07:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:42,267 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-09 04:07:42,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:07:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-09 04:07:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 04:07:42,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:42,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:42,268 INFO L423 AbstractCegarLoop]: === Iteration 3 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:42,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:42,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1468470210, now seen corresponding path program 1 times [2018-12-09 04:07:42,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:42,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:42,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:42,305 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-09 04:07:42,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:07:42,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:07:42,305 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:42,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:07:42,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:07:42,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:07:42,306 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2018-12-09 04:07:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:42,316 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-09 04:07:42,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:07:42,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 04:07:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:42,316 INFO L225 Difference]: With dead ends: 43 [2018-12-09 04:07:42,316 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 04:07:42,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:07:42,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 04:07:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 04:07:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 04:07:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 04:07:42,319 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2018-12-09 04:07:42,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:42,320 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 04:07:42,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:07:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 04:07:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 04:07:42,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:42,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:42,320 INFO L423 AbstractCegarLoop]: === Iteration 4 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:42,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:42,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1468470209, now seen corresponding path program 1 times [2018-12-09 04:07:42,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:42,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:42,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:42,337 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-09 04:07:42,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:07:42,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 04:07:42,337 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:42,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:07:42,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:07:42,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:07:42,338 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 3 states. [2018-12-09 04:07:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:42,352 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-09 04:07:42,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:07:42,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 04:07:42,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:42,353 INFO L225 Difference]: With dead ends: 42 [2018-12-09 04:07:42,353 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 04:07:42,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:07:42,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 04:07:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 04:07:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 04:07:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-09 04:07:42,355 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2018-12-09 04:07:42,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:42,356 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-09 04:07:42,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:07:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-09 04:07:42,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 04:07:42,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:42,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:42,356 INFO L423 AbstractCegarLoop]: === Iteration 5 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:42,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:42,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1340824930, now seen corresponding path program 1 times [2018-12-09 04:07:42,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:42,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:42,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:42,385 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-09 04:07:42,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:07:42,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:07:42,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:42,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:07:42,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:07:42,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:07:42,386 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-12-09 04:07:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:42,422 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-09 04:07:42,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:07:42,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 04:07:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:42,422 INFO L225 Difference]: With dead ends: 40 [2018-12-09 04:07:42,422 INFO L226 Difference]: Without dead ends: 40 [2018-12-09 04:07:42,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:07:42,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-09 04:07:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 04:07:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 04:07:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-09 04:07:42,425 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-12-09 04:07:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:42,425 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-09 04:07:42,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:07:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-09 04:07:42,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 04:07:42,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:42,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:42,425 INFO L423 AbstractCegarLoop]: === Iteration 6 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:42,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:42,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1340824929, now seen corresponding path program 1 times [2018-12-09 04:07:42,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:42,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:42,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:42,470 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-09 04:07:42,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:07:42,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:07:42,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:42,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:07:42,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:07:42,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:07:42,471 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2018-12-09 04:07:42,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:42,531 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-12-09 04:07:42,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:07:42,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-09 04:07:42,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:42,533 INFO L225 Difference]: With dead ends: 62 [2018-12-09 04:07:42,533 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 04:07:42,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:07:42,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 04:07:42,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-12-09 04:07:42,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 04:07:42,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-09 04:07:42,538 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2018-12-09 04:07:42,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:42,538 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-09 04:07:42,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:07:42,538 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-09 04:07:42,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 04:07:42,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:42,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:42,538 INFO L423 AbstractCegarLoop]: === Iteration 7 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:42,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:42,539 INFO L82 PathProgramCache]: Analyzing trace with hash 2040408996, now seen corresponding path program 1 times [2018-12-09 04:07:42,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:42,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:42,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:42,564 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-09 04:07:42,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:07:42,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:07:42,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:42,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:07:42,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:07:42,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:07:42,566 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2018-12-09 04:07:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:42,609 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-09 04:07:42,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:07:42,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-09 04:07:42,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:42,609 INFO L225 Difference]: With dead ends: 43 [2018-12-09 04:07:42,610 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 04:07:42,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:07:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 04:07:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-12-09 04:07:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 04:07:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-09 04:07:42,612 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2018-12-09 04:07:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:42,612 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-09 04:07:42,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:07:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-09 04:07:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 04:07:42,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:42,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:42,613 INFO L423 AbstractCegarLoop]: === Iteration 8 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:42,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:42,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2040408997, now seen corresponding path program 1 times [2018-12-09 04:07:42,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:42,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:42,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:42,672 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-09 04:07:42,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:07:42,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:07:42,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:42,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:07:42,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:07:42,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:07:42,673 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2018-12-09 04:07:42,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:42,737 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-12-09 04:07:42,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:07:42,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-09 04:07:42,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:42,738 INFO L225 Difference]: With dead ends: 55 [2018-12-09 04:07:42,738 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 04:07:42,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-09 04:07:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 04:07:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-12-09 04:07:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 04:07:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-12-09 04:07:42,741 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2018-12-09 04:07:42,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:42,741 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-12-09 04:07:42,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:07:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-12-09 04:07:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 04:07:42,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:42,741 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-09 04:07:42,741 INFO L423 AbstractCegarLoop]: === Iteration 9 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:42,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:42,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1984220883, now seen corresponding path program 1 times [2018-12-09 04:07:42,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:42,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:42,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:42,771 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-09 04:07:42,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:07:42,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:07:42,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:42,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:07:42,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:07:42,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:07:42,772 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2018-12-09 04:07:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:42,805 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-12-09 04:07:42,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:07:42,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-09 04:07:42,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:42,806 INFO L225 Difference]: With dead ends: 46 [2018-12-09 04:07:42,806 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 04:07:42,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:07:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 04:07:42,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 04:07:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 04:07:42,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-09 04:07:42,808 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-12-09 04:07:42,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:42,808 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-09 04:07:42,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:07:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-09 04:07:42,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 04:07:42,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:42,809 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, 1] [2018-12-09 04:07:42,810 INFO L423 AbstractCegarLoop]: === Iteration 10 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:42,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:42,810 INFO L82 PathProgramCache]: Analyzing trace with hash -510295044, now seen corresponding path program 1 times [2018-12-09 04:07:42,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:42,828 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-09 04:07:42,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:07:42,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:07:42,828 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:42,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:07:42,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:07:42,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:07:42,829 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-12-09 04:07:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:42,833 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-09 04:07:42,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:07:42,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 04:07:42,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:42,834 INFO L225 Difference]: With dead ends: 43 [2018-12-09 04:07:42,834 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 04:07:42,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:07:42,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 04:07:42,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 04:07:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 04:07:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-09 04:07:42,836 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2018-12-09 04:07:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:42,837 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-09 04:07:42,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:07:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-09 04:07:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 04:07:42,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:42,837 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, 1, 1, 1] [2018-12-09 04:07:42,837 INFO L423 AbstractCegarLoop]: === Iteration 11 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:42,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:42,837 INFO L82 PathProgramCache]: Analyzing trace with hash -773125415, now seen corresponding path program 1 times [2018-12-09 04:07:42,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:42,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:42,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:42,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 04:07:42,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:07:42,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 04:07:42,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:42,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:07:42,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:07:42,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:07:42,917 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 8 states. [2018-12-09 04:07:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:42,992 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-12-09 04:07:42,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:07:42,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-12-09 04:07:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:42,993 INFO L225 Difference]: With dead ends: 51 [2018-12-09 04:07:42,993 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 04:07:42,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 04:07:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 04:07:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 04:07:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 04:07:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 04:07:42,996 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-12-09 04:07:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:42,996 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 04:07:42,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:07:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 04:07:42,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 04:07:42,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:42,997 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, 1, 1, 1] [2018-12-09 04:07:42,997 INFO L423 AbstractCegarLoop]: === Iteration 12 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:42,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:42,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1527697175, now seen corresponding path program 1 times [2018-12-09 04:07:42,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:42,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:42,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:42,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:43,080 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-09 04:07:43,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:07:43,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 04:07:43,080 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:07:43,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 04:07:43,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 04:07:43,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-09 04:07:43,081 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 10 states. [2018-12-09 04:07:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:43,187 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-12-09 04:07:43,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 04:07:43,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-12-09 04:07:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:43,188 INFO L225 Difference]: With dead ends: 64 [2018-12-09 04:07:43,188 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 04:07:43,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 04:07:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 04:07:43,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-12-09 04:07:43,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-09 04:07:43,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-12-09 04:07:43,192 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 24 [2018-12-09 04:07:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:43,192 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-12-09 04:07:43,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 04:07:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-12-09 04:07:43,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 04:07:43,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:43,193 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, 1, 1, 1] [2018-12-09 04:07:43,193 INFO L423 AbstractCegarLoop]: === Iteration 13 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:43,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:43,194 INFO L82 PathProgramCache]: Analyzing trace with hash -60650727, now seen corresponding path program 1 times [2018-12-09 04:07:43,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:43,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:43,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:43,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:43,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:43,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:43,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:43,337 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-09 04:07:43,338 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [13], [14], [17], [22], [24], [25], [28], [29], [32], [40], [61], [66], [72], [74], [75], [78], [85], [86], [87], [89] [2018-12-09 04:07:43,360 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 04:07:43,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 04:07:43,535 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 04:07:43,536 INFO L272 AbstractInterpreter]: Visited 24 different actions 45 times. Merged at 7 different actions 21 times. Widened at 1 different actions 1 times. Performed 407 root evaluator evaluations with a maximum evaluation depth of 6. Performed 407 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-09 04:07:43,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:43,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 04:07:43,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:43,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/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-09 04:07:43,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:43,555 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:07:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:43,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:43,610 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 14 treesize of output 11 [2018-12-09 04:07:43,612 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 11 treesize of output 10 [2018-12-09 04:07:43,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:43,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:43,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:07:43,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 04:07:43,707 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 18 treesize of output 14 [2018-12-09 04:07:43,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 04:07:43,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 04:07:43,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:43,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:43,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-09 04:07:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:43,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:43,988 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 04:07:43,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:43,994 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-09 04:07:44,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 04:07:44,002 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:44,002 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:44,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:44,007 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-09 04:07:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:44,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:07:44,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2018-12-09 04:07:44,026 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:07:44,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 04:07:44,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 04:07:44,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-12-09 04:07:44,027 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 19 states. [2018-12-09 04:07:44,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:44,639 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-12-09 04:07:44,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 04:07:44,639 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-09 04:07:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:44,640 INFO L225 Difference]: With dead ends: 86 [2018-12-09 04:07:44,640 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 04:07:44,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=1044, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 04:07:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 04:07:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2018-12-09 04:07:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 04:07:44,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-09 04:07:44,644 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2018-12-09 04:07:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:44,644 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-09 04:07:44,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 04:07:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-09 04:07:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 04:07:44,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:44,645 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, 1, 1, 1, 1] [2018-12-09 04:07:44,645 INFO L423 AbstractCegarLoop]: === Iteration 14 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:44,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:44,645 INFO L82 PathProgramCache]: Analyzing trace with hash 294426742, now seen corresponding path program 1 times [2018-12-09 04:07:44,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:44,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:44,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:44,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:44,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:44,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:44,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:44,749 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-09 04:07:44,749 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [13], [14], [17], [22], [25], [34], [38], [44], [50], [52], [61], [66], [70], [74], [75], [78], [85], [86], [87], [89] [2018-12-09 04:07:44,750 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 04:07:44,750 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 04:07:44,771 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 04:07:44,771 INFO L272 AbstractInterpreter]: Visited 25 different actions 25 times. Never merged. Never widened. Performed 177 root evaluator evaluations with a maximum evaluation depth of 3. Performed 177 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-12-09 04:07:44,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:44,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 04:07:44,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:44,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:44,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:44,779 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:07:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:44,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:44,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 04:07:44,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:44,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:44,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 04:07:44,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 14 treesize of output 11 [2018-12-09 04:07:44,841 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 11 treesize of output 10 [2018-12-09 04:07:44,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:44,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:44,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:07:44,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-09 04:07:44,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-09 04:07:44,873 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 11 treesize of output 10 [2018-12-09 04:07:44,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:44,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:44,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-09 04:07:44,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-09 04:07:44,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-12-09 04:07:44,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 04:07:44,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 04:07:44,969 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 8 treesize of output 1 [2018-12-09 04:07:44,969 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:44,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:44,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:44,980 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-12-09 04:07:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:45,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:45,160 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 04:07:45,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:45,169 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-09 04:07:45,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 04:07:45,177 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:45,178 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:45,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:45,182 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-12-09 04:07:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:45,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:07:45,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 22 [2018-12-09 04:07:45,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:07:45,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 04:07:45,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 04:07:45,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-12-09 04:07:45,204 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 17 states. [2018-12-09 04:07:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:45,597 INFO L93 Difference]: Finished difference Result 146 states and 167 transitions. [2018-12-09 04:07:45,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 04:07:45,597 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-12-09 04:07:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:45,598 INFO L225 Difference]: With dead ends: 146 [2018-12-09 04:07:45,598 INFO L226 Difference]: Without dead ends: 146 [2018-12-09 04:07:45,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2018-12-09 04:07:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-09 04:07:45,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 107. [2018-12-09 04:07:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-09 04:07:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2018-12-09 04:07:45,601 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 25 [2018-12-09 04:07:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:45,601 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2018-12-09 04:07:45,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 04:07:45,601 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2018-12-09 04:07:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 04:07:45,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:45,602 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:45,602 INFO L423 AbstractCegarLoop]: === Iteration 15 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:45,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:45,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1711340723, now seen corresponding path program 2 times [2018-12-09 04:07:45,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:45,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:45,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:07:45,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:45,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:45,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:45,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:45,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:07:45,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:07:45,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:45,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:45,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 04:07:45,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 04:07:45,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 04:07:45,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:07:45,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:45,794 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 04:07:45,800 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 04:07:45,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 04:07:45,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:45,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:45,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 04:07:45,830 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 16 treesize of output 13 [2018-12-09 04:07:45,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 13 treesize of output 12 [2018-12-09 04:07:45,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:45,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:45,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:07:45,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-12-09 04:07:45,987 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-09 04:07:45,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-12-09 04:07:45,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:45,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:45,996 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-09 04:07:45,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:24 [2018-12-09 04:07:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 04:07:46,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:46,283 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-09 04:07:46,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 04:07:46,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:46,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:46,299 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-09 04:07:46,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-12-09 04:07:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 04:07:46,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:07:46,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2018-12-09 04:07:46,351 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:07:46,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 04:07:46,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 04:07:46,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2018-12-09 04:07:46,352 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand 22 states. [2018-12-09 04:07:47,211 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2018-12-09 04:07:47,435 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 47 [2018-12-09 04:07:47,714 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2018-12-09 04:07:48,156 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2018-12-09 04:07:48,443 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2018-12-09 04:07:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:07:49,264 INFO L93 Difference]: Finished difference Result 159 states and 174 transitions. [2018-12-09 04:07:49,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 04:07:49,265 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2018-12-09 04:07:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:07:49,265 INFO L225 Difference]: With dead ends: 159 [2018-12-09 04:07:49,265 INFO L226 Difference]: Without dead ends: 159 [2018-12-09 04:07:49,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=589, Invalid=2491, Unknown=0, NotChecked=0, Total=3080 [2018-12-09 04:07:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-09 04:07:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 76. [2018-12-09 04:07:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 04:07:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-12-09 04:07:49,270 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 30 [2018-12-09 04:07:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:07:49,270 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-12-09 04:07:49,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 04:07:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-12-09 04:07:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 04:07:49,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:07:49,270 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:07:49,271 INFO L423 AbstractCegarLoop]: === Iteration 16 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:07:49,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:07:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash -841571651, now seen corresponding path program 2 times [2018-12-09 04:07:49,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:07:49,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:49,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:07:49,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:07:49,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:07:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:07:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:49,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:49,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:07:49,431 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 04:07:49,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 04:07:49,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:07:49,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:07:49,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 04:07:49,442 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 04:07:49,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 04:07:49,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:07:49,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:07:49,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 04:07:49,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 04:07:49,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:49,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:49,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 04:07:49,479 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:49,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:49,484 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 04:07:49,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 16 treesize of output 13 [2018-12-09 04:07:49,503 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 13 treesize of output 12 [2018-12-09 04:07:49,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:49,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:49,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:49,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-12-09 04:07:49,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 04:07:49,530 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 13 treesize of output 12 [2018-12-09 04:07:49,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:49,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:07:49,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 04:07:49,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2018-12-09 04:07:51,740 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 40 [2018-12-09 04:07:53,772 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 04:07:53,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 55 [2018-12-09 04:07:53,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2018-12-09 04:07:53,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 04:07:53,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2018-12-09 04:07:53,849 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 04:07:53,885 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 30 treesize of output 20 [2018-12-09 04:07:53,885 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:53,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2018-12-09 04:07:53,921 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 04:07:53,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 16 [2018-12-09 04:07:53,956 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 04:07:54,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 04:07:54,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:07:54,024 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:59, output treesize:40 [2018-12-09 04:07:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:07:54,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:07:56,331 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 42 [2018-12-09 04:07:58,453 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 42 [2018-12-09 04:08:00,617 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 90 [2018-12-09 04:08:00,679 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 12 treesize of output 11 [2018-12-09 04:08:00,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:00,694 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 31 treesize of output 27 [2018-12-09 04:08:00,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-12-09 04:08:00,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:00,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:00,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2018-12-09 04:08:00,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-12-09 04:08:00,709 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:00,717 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 24 treesize of output 18 [2018-12-09 04:08:00,718 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:00,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-09 04:08:00,726 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:00,732 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:08:00,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 04:08:00,802 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 92 [2018-12-09 04:08:00,869 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 12 treesize of output 11 [2018-12-09 04:08:00,870 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:00,885 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 31 treesize of output 27 [2018-12-09 04:08:00,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-12-09 04:08:00,887 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:00,891 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:00,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2018-12-09 04:08:00,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-12-09 04:08:00,899 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:00,908 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 24 treesize of output 18 [2018-12-09 04:08:00,908 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:00,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-09 04:08:00,917 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:00,923 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:08:00,937 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 04:08:01,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 04:08:01,019 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 10 variables, input treesize:291, output treesize:201 [2018-12-09 04:08:01,113 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:08:01,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:08:01,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 35 [2018-12-09 04:08:01,128 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:08:01,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 04:08:01,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 04:08:01,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1114, Unknown=1, NotChecked=0, Total=1260 [2018-12-09 04:08:01,129 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 22 states. [2018-12-09 04:08:02,374 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2018-12-09 04:08:04,476 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2018-12-09 04:08:07,207 WARN L180 SmtUtils]: Spent 1.73 s on a formula simplification that was a NOOP. DAG size: 39 [2018-12-09 04:08:09,618 WARN L180 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-12-09 04:08:11,856 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2018-12-09 04:08:12,748 WARN L180 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-12-09 04:08:16,858 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-12-09 04:08:20,955 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-12-09 04:08:25,020 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2018-12-09 04:08:29,091 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-12-09 04:08:39,827 WARN L180 SmtUtils]: Spent 5.16 s on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-12-09 04:08:43,904 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-12-09 04:08:47,973 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-09 04:08:52,057 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-12-09 04:08:56,134 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-12-09 04:08:57,685 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 36 [2018-12-09 04:09:00,148 WARN L180 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-12-09 04:09:00,557 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-12-09 04:09:02,441 WARN L180 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-09 04:09:04,381 WARN L180 SmtUtils]: Spent 1.92 s on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 04:09:12,481 WARN L180 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-12-09 04:09:16,557 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-12-09 04:09:18,600 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 46 [2018-12-09 04:09:22,712 WARN L180 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-12-09 04:09:22,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:09:22,739 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2018-12-09 04:09:22,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-09 04:09:22,740 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-12-09 04:09:22,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:09:22,740 INFO L225 Difference]: With dead ends: 118 [2018-12-09 04:09:22,740 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 04:09:22,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 85.9s TimeCoverageRelationStatistics Valid=724, Invalid=3831, Unknown=1, NotChecked=0, Total=4556 [2018-12-09 04:09:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 04:09:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2018-12-09 04:09:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-09 04:09:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-12-09 04:09:22,743 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 36 [2018-12-09 04:09:22,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:09:22,743 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-12-09 04:09:22,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 04:09:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-12-09 04:09:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 04:09:22,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:09:22,743 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:09:22,744 INFO L423 AbstractCegarLoop]: === Iteration 17 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:09:22,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:09:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1151922217, now seen corresponding path program 1 times [2018-12-09 04:09:22,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:09:22,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:09:22,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:09:22,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:09:22,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:09:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:09:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 04:09:22,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:09:22,808 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:09:22,808 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-12-09 04:09:22,809 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [13], [14], [17], [22], [25], [28], [29], [32], [34], [38], [44], [50], [52], [61], [66], [72], [74], [75], [78], [85], [86], [87], [89] [2018-12-09 04:09:22,810 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 04:09:22,810 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 04:09:22,840 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 04:09:22,841 INFO L272 AbstractInterpreter]: Visited 28 different actions 29 times. Merged at 1 different actions 1 times. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 6. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 2 fixpoints after 2 different actions. Largest state had 31 variables. [2018-12-09 04:09:22,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:09:22,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 04:09:22,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:09:22,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:09:22,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:09:22,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:09:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:09:22,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:09:22,873 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 14 treesize of output 11 [2018-12-09 04:09:22,874 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 11 treesize of output 10 [2018-12-09 04:09:22,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:09:22,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:09:22,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 04:09:22,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2018-12-09 04:09:29,763 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 04:09:33,839 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 04:09:37,299 WARN L180 SmtUtils]: Spent 1.94 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 04:09:37,302 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 25 treesize of output 19 [2018-12-09 04:09:37,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-12-09 04:09:37,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:09:37,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:09:37,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:09:37,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-12-09 04:09:37,315 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 04:09:37,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:09:39,371 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 04:09:39,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:09:39,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 21 [2018-12-09 04:09:39,385 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:09:39,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 04:09:39,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 04:09:39,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=344, Unknown=9, NotChecked=0, Total=420 [2018-12-09 04:09:39,386 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 18 states. [2018-12-09 04:09:45,840 WARN L180 SmtUtils]: Spent 6.37 s on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-12-09 04:09:46,897 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 43 DAG size of output: 31 [2018-12-09 04:09:50,931 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 33 DAG size of output: 24 [2018-12-09 04:09:52,992 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2018-12-09 04:09:54,044 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2018-12-09 04:09:54,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:09:54,047 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2018-12-09 04:09:54,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 04:09:54,048 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-12-09 04:09:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:09:54,048 INFO L225 Difference]: With dead ends: 115 [2018-12-09 04:09:54,048 INFO L226 Difference]: Without dead ends: 93 [2018-12-09 04:09:54,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 88 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=190, Invalid=671, Unknown=9, NotChecked=0, Total=870 [2018-12-09 04:09:54,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-09 04:09:54,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 68. [2018-12-09 04:09:54,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 04:09:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2018-12-09 04:09:54,050 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 49 [2018-12-09 04:09:54,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:09:54,050 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2018-12-09 04:09:54,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 04:09:54,050 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2018-12-09 04:09:54,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 04:09:54,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:09:54,051 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:09:54,051 INFO L423 AbstractCegarLoop]: === Iteration 18 === [cstrcspnErr2REQUIRES_VIOLATION, cstrcspnErr7REQUIRES_VIOLATION, cstrcspnErr8REQUIRES_VIOLATION, cstrcspnErr3REQUIRES_VIOLATION, cstrcspnErr4REQUIRES_VIOLATION, cstrcspnErr9REQUIRES_VIOLATION, cstrcspnErr0REQUIRES_VIOLATION, cstrcspnErr5REQUIRES_VIOLATION, cstrcspnErr6REQUIRES_VIOLATION, cstrcspnErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION]=== [2018-12-09 04:09:54,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:09:54,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1126710711, now seen corresponding path program 1 times [2018-12-09 04:09:54,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:09:54,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:09:54,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:09:54,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:09:54,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:09:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:09:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 04:09:54,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:09:54,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 04:09:54,134 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 54 with the following transitions: [2018-12-09 04:09:54,134 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [13], [14], [17], [22], [25], [28], [29], [32], [38], [44], [50], [52], [61], [66], [72], [74], [75], [78], [85], [86], [87], [89] [2018-12-09 04:09:54,135 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 04:09:54,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 04:09:54,152 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 04:09:54,153 INFO L272 AbstractInterpreter]: Visited 27 different actions 27 times. Never merged. Never widened. Performed 192 root evaluator evaluations with a maximum evaluation depth of 6. Performed 192 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-12-09 04:09:54,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:09:54,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 04:09:54,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:09:54,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:09:54,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:09:54,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 04:09:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:09:54,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:09:54,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 04:09:54,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-09 04:09:54,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:09:54,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:09:54,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-09 04:09:54,211 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:09:54,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:09:54,215 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 04:09:54,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 12 [2018-12-09 04:09:54,227 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 12 treesize of output 11 [2018-12-09 04:09:54,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:09:54,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:09:54,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:09:54,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-09 04:09:54,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-09 04:09:54,246 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 13 treesize of output 12 [2018-12-09 04:09:54,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:09:54,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:09:54,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 04:09:54,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-09 04:09:54,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-12-09 04:09:54,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 04:09:54,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 04:09:54,361 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 10 treesize of output 1 [2018-12-09 04:09:54,361 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:09:54,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:09:54,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:09:54,369 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-12-09 04:09:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:09:54,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 04:09:54,635 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 13 [2018-12-09 04:09:54,643 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-09 04:09:54,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:09:54,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:09:54,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 04:09:54,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:35 [2018-12-09 04:09:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:09:54,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 04:09:54,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 30 [2018-12-09 04:09:54,701 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 04:09:54,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-09 04:09:54,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-09 04:09:54,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2018-12-09 04:09:54,702 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand 21 states. [2018-12-09 04:09:58,225 WARN L180 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-12-09 04:09:59,340 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2018-12-09 04:10:02,151 WARN L180 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-12-09 04:10:04,271 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-12-09 04:10:05,304 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-12-09 04:10:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:10:05,463 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-12-09 04:10:05,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 04:10:05,464 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-12-09 04:10:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:10:05,464 INFO L225 Difference]: With dead ends: 90 [2018-12-09 04:10:05,464 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 04:10:05,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=409, Invalid=1571, Unknown=0, NotChecked=0, Total=1980 [2018-12-09 04:10:05,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 04:10:05,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 04:10:05,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 04:10:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 04:10:05,465 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2018-12-09 04:10:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:10:05,465 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 04:10:05,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-09 04:10:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 04:10:05,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 04:10:05,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:10:05 BoogieIcfgContainer [2018-12-09 04:10:05,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 04:10:05,468 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:10:05,468 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:10:05,468 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:10:05,469 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:07:41" (3/4) ... [2018-12-09 04:10:05,471 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 04:10:05,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 04:10:05,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrcspn [2018-12-09 04:10:05,475 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 04:10:05,478 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-09 04:10:05,478 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 04:10:05,478 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 04:10:05,504 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_93e2ed21-25eb-4d1e-b097-cbd937ff83f9/bin-2019/utaipan/witness.graphml [2018-12-09 04:10:05,504 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:10:05,504 INFO L168 Benchmark]: Toolchain (without parser) took 144032.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2018-12-09 04:10:05,505 INFO L168 Benchmark]: CDTParser took 0.14 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-09 04:10:05,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-09 04:10:05,505 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.46 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 04:10:05,505 INFO L168 Benchmark]: Boogie Preprocessor took 16.94 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-09 04:10:05,506 INFO L168 Benchmark]: RCFGBuilder took 192.63 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-09 04:10:05,506 INFO L168 Benchmark]: TraceAbstraction took 143521.24 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 98.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -73.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-09 04:10:05,506 INFO L168 Benchmark]: Witness Printer took 35.77 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-09 04:10:05,507 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 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 245.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.46 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.94 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 192.63 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 143521.24 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 98.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -73.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Witness Printer took 35.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 15 error locations. SAFE Result, 143.4s OverallTime, 18 OverallIterations, 3 TraceHistogramMax, 111.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 574 SDtfs, 1495 SDslu, 2146 SDs, 0 SdLazy, 2726 SolverSat, 217 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 345 SyntacticMatches, 17 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2021 ImplicationChecksByTransitivity, 132.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 218 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 31.1s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 817 ConstructedInterpolants, 162 QuantifiedInterpolants, 416019 SizeOfPredicates, 105 NumberOfNonLiveVariables, 1021 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 30 InterpolantComputations, 12 PerfectInterpolantSequences, 111/306 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...