./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/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 b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/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 b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 09:26:15,156 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:26:15,157 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:26:15,163 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:26:15,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:26:15,164 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:26:15,165 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:26:15,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:26:15,167 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:26:15,167 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:26:15,168 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:26:15,168 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:26:15,169 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:26:15,169 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:26:15,170 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:26:15,170 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:26:15,171 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:26:15,172 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:26:15,172 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:26:15,173 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:26:15,174 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:26:15,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:26:15,176 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:26:15,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:26:15,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:26:15,177 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:26:15,177 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:26:15,178 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:26:15,178 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:26:15,179 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:26:15,179 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:26:15,179 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:26:15,179 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:26:15,179 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:26:15,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:26:15,181 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:26:15,181 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 09:26:15,188 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:26:15,188 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:26:15,189 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 09:26:15,189 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 09:26:15,189 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 09:26:15,189 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 09:26:15,189 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 09:26:15,190 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 09:26:15,190 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 09:26:15,190 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 09:26:15,190 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 09:26:15,190 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 09:26:15,190 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 09:26:15,191 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 09:26:15,191 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 09:26:15,191 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:26:15,191 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 09:26:15,191 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 09:26:15,191 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 09:26:15,192 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 09:26:15,192 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:26:15,192 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 09:26:15,192 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 09:26:15,192 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 09:26:15,192 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 09:26:15,192 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 09:26:15,192 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:26:15,193 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:26:15,193 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 09:26:15,193 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 09:26:15,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:26:15,193 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:26:15,193 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 09:26:15,193 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 09:26:15,193 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 09:26:15,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 09:26:15,194 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_278a991c-5dab-41c4-b226-2e4caf9fc79d/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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-12-02 09:26:15,211 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:26:15,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:26:15,224 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:26:15,225 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:26:15,225 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:26:15,226 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-02 09:26:15,263 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/data/fa2a8ffee/708b38220df94b71bae4231cd54e720b/FLAG57a14669e [2018-12-02 09:26:15,583 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:26:15,583 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-02 09:26:15,589 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/data/fa2a8ffee/708b38220df94b71bae4231cd54e720b/FLAG57a14669e [2018-12-02 09:26:15,597 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/data/fa2a8ffee/708b38220df94b71bae4231cd54e720b [2018-12-02 09:26:15,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:26:15,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:26:15,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:26:15,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:26:15,602 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:26:15,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:26:15" (1/1) ... [2018-12-02 09:26:15,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5c87c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:15, skipping insertion in model container [2018-12-02 09:26:15,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:26:15" (1/1) ... [2018-12-02 09:26:15,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:26:15,627 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:26:15,770 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:26:15,808 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:26:15,833 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:26:15,853 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:26:15,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:15 WrapperNode [2018-12-02 09:26:15,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:26:15,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:26:15,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:26:15,854 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:26:15,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:15" (1/1) ... [2018-12-02 09:26:15,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:15" (1/1) ... [2018-12-02 09:26:15,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:26:15,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:26:15,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:26:15,873 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:26:15,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:15" (1/1) ... [2018-12-02 09:26:15,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:15" (1/1) ... [2018-12-02 09:26:15,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:15" (1/1) ... [2018-12-02 09:26:15,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:15" (1/1) ... [2018-12-02 09:26:15,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:15" (1/1) ... [2018-12-02 09:26:15,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:15" (1/1) ... [2018-12-02 09:26:15,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:15" (1/1) ... [2018-12-02 09:26:15,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:26:15,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:26:15,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:26:15,896 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:26:15,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:26:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 09:26:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 09:26:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 09:26:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 09:26:15,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 09:26:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 09:26:15,928 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 09:26:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 09:26:15,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 09:26:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 09:26:15,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:26:15,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:26:16,213 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:26:16,213 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-02 09:26:16,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:26:16 BoogieIcfgContainer [2018-12-02 09:26:16,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:26:16,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 09:26:16,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 09:26:16,216 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 09:26:16,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:26:15" (1/3) ... [2018-12-02 09:26:16,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e73530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:26:16, skipping insertion in model container [2018-12-02 09:26:16,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:15" (2/3) ... [2018-12-02 09:26:16,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e73530 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:26:16, skipping insertion in model container [2018-12-02 09:26:16,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:26:16" (3/3) ... [2018-12-02 09:26:16,218 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-02 09:26:16,224 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 09:26:16,229 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-12-02 09:26:16,239 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-12-02 09:26:16,255 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 09:26:16,255 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 09:26:16,255 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 09:26:16,255 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:26:16,255 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:26:16,255 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 09:26:16,255 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:26:16,255 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 09:26:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2018-12-02 09:26:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-02 09:26:16,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:16,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:16,275 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:16,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:16,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1288008672, now seen corresponding path program 1 times [2018-12-02 09:26:16,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:16,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:16,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:16,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:16,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:16,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:16,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:16,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:26:16,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:16,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:26:16,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:26:16,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:26:16,383 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2018-12-02 09:26:16,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:16,499 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2018-12-02 09:26:16,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:26:16,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-02 09:26:16,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:16,506 INFO L225 Difference]: With dead ends: 171 [2018-12-02 09:26:16,506 INFO L226 Difference]: Without dead ends: 167 [2018-12-02 09:26:16,507 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-02 09:26:16,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-02 09:26:16,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 143. [2018-12-02 09:26:16,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-02 09:26:16,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 148 transitions. [2018-12-02 09:26:16,532 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 148 transitions. Word has length 7 [2018-12-02 09:26:16,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:16,533 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 148 transitions. [2018-12-02 09:26:16,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:26:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 148 transitions. [2018-12-02 09:26:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-02 09:26:16,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:16,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:16,533 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:16,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:16,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1288008673, now seen corresponding path program 1 times [2018-12-02 09:26:16,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:16,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:16,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:16,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:16,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:16,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:16,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:26:16,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:16,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:26:16,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:26:16,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:26:16,561 INFO L87 Difference]: Start difference. First operand 143 states and 148 transitions. Second operand 3 states. [2018-12-02 09:26:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:16,633 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2018-12-02 09:26:16,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:26:16,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-02 09:26:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:16,634 INFO L225 Difference]: With dead ends: 140 [2018-12-02 09:26:16,634 INFO L226 Difference]: Without dead ends: 140 [2018-12-02 09:26:16,635 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-02 09:26:16,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-02 09:26:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-02 09:26:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-02 09:26:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 145 transitions. [2018-12-02 09:26:16,640 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 145 transitions. Word has length 7 [2018-12-02 09:26:16,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:16,640 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 145 transitions. [2018-12-02 09:26:16,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:26:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 145 transitions. [2018-12-02 09:26:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 09:26:16,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:16,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:16,640 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:16,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:16,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1021398364, now seen corresponding path program 1 times [2018-12-02 09:26:16,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:16,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:16,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:16,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:16,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:16,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:16,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:26:16,668 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:16,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:26:16,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:26:16,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:26:16,668 INFO L87 Difference]: Start difference. First operand 140 states and 145 transitions. Second operand 3 states. [2018-12-02 09:26:16,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:16,737 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2018-12-02 09:26:16,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:26:16,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 09:26:16,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:16,738 INFO L225 Difference]: With dead ends: 139 [2018-12-02 09:26:16,738 INFO L226 Difference]: Without dead ends: 139 [2018-12-02 09:26:16,738 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-02 09:26:16,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-02 09:26:16,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-12-02 09:26:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-02 09:26:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2018-12-02 09:26:16,742 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 11 [2018-12-02 09:26:16,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:16,743 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2018-12-02 09:26:16,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:26:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2018-12-02 09:26:16,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 09:26:16,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:16,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:16,743 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:16,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:16,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1021398363, now seen corresponding path program 1 times [2018-12-02 09:26:16,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:16,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:16,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:16,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:16,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:16,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:16,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:26:16,775 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:16,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:26:16,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:26:16,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:26:16,776 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand 3 states. [2018-12-02 09:26:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:16,849 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2018-12-02 09:26:16,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:26:16,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 09:26:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:16,850 INFO L225 Difference]: With dead ends: 148 [2018-12-02 09:26:16,851 INFO L226 Difference]: Without dead ends: 148 [2018-12-02 09:26:16,851 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-02 09:26:16,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-02 09:26:16,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2018-12-02 09:26:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-02 09:26:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2018-12-02 09:26:16,855 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 11 [2018-12-02 09:26:16,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:16,856 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-12-02 09:26:16,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:26:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2018-12-02 09:26:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 09:26:16,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:16,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:16,857 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:16,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:16,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1511446413, now seen corresponding path program 1 times [2018-12-02 09:26:16,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:16,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:16,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:16,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:16,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:16,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:16,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:26:16,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:16,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:26:16,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:26:16,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:26:16,911 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 4 states. [2018-12-02 09:26:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:17,014 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-12-02 09:26:17,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:26:17,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-02 09:26:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:17,015 INFO L225 Difference]: With dead ends: 140 [2018-12-02 09:26:17,015 INFO L226 Difference]: Without dead ends: 140 [2018-12-02 09:26:17,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-02 09:26:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 126. [2018-12-02 09:26:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-02 09:26:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-12-02 09:26:17,019 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 17 [2018-12-02 09:26:17,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:17,019 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-12-02 09:26:17,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:26:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-12-02 09:26:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 09:26:17,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:17,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:17,020 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:17,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:17,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1511446414, now seen corresponding path program 1 times [2018-12-02 09:26:17,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:17,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:17,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:17,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:17,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:17,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:17,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:26:17,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:17,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:26:17,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:26:17,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:26:17,062 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 4 states. [2018-12-02 09:26:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:17,190 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2018-12-02 09:26:17,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:26:17,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-02 09:26:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:17,191 INFO L225 Difference]: With dead ends: 160 [2018-12-02 09:26:17,191 INFO L226 Difference]: Without dead ends: 160 [2018-12-02 09:26:17,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-02 09:26:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 135. [2018-12-02 09:26:17,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-02 09:26:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2018-12-02 09:26:17,194 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 17 [2018-12-02 09:26:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:17,195 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2018-12-02 09:26:17,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:26:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2018-12-02 09:26:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 09:26:17,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:17,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:17,195 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:17,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:17,196 INFO L82 PathProgramCache]: Analyzing trace with hash 801057136, now seen corresponding path program 1 times [2018-12-02 09:26:17,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:17,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:17,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:17,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:17,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:17,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:26:17,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:17,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:26:17,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:26:17,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:17,235 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 5 states. [2018-12-02 09:26:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:17,375 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2018-12-02 09:26:17,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:26:17,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-02 09:26:17,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:17,375 INFO L225 Difference]: With dead ends: 177 [2018-12-02 09:26:17,376 INFO L226 Difference]: Without dead ends: 177 [2018-12-02 09:26:17,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:26:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-02 09:26:17,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 134. [2018-12-02 09:26:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-02 09:26:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-12-02 09:26:17,379 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 19 [2018-12-02 09:26:17,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:17,379 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-12-02 09:26:17,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:26:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-12-02 09:26:17,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 09:26:17,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:17,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:17,380 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:17,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:17,380 INFO L82 PathProgramCache]: Analyzing trace with hash 801057137, now seen corresponding path program 1 times [2018-12-02 09:26:17,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:17,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:17,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:17,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:17,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:17,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:17,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:17,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:26:17,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:17,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:26:17,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:26:17,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:17,424 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 5 states. [2018-12-02 09:26:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:17,628 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2018-12-02 09:26:17,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:26:17,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-02 09:26:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:17,630 INFO L225 Difference]: With dead ends: 198 [2018-12-02 09:26:17,630 INFO L226 Difference]: Without dead ends: 198 [2018-12-02 09:26:17,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:26:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-02 09:26:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 133. [2018-12-02 09:26:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-02 09:26:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2018-12-02 09:26:17,634 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 19 [2018-12-02 09:26:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:17,634 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2018-12-02 09:26:17,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:26:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2018-12-02 09:26:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 09:26:17,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:17,635 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] [2018-12-02 09:26:17,635 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:17,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:17,635 INFO L82 PathProgramCache]: Analyzing trace with hash -2144075406, now seen corresponding path program 1 times [2018-12-02 09:26:17,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:17,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:17,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:17,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:17,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:17,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:17,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 09:26:17,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:17,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 09:26:17,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 09:26:17,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 09:26:17,733 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 9 states. [2018-12-02 09:26:17,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:17,958 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2018-12-02 09:26:17,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 09:26:17,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-02 09:26:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:17,958 INFO L225 Difference]: With dead ends: 145 [2018-12-02 09:26:17,959 INFO L226 Difference]: Without dead ends: 145 [2018-12-02 09:26:17,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-12-02 09:26:17,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-02 09:26:17,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2018-12-02 09:26:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-02 09:26:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-12-02 09:26:17,961 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 23 [2018-12-02 09:26:17,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:17,961 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-12-02 09:26:17,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 09:26:17,961 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-12-02 09:26:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 09:26:17,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:17,961 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] [2018-12-02 09:26:17,962 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:17,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2144075405, now seen corresponding path program 1 times [2018-12-02 09:26:17,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:17,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:17,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:18,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:18,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 09:26:18,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:18,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 09:26:18,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 09:26:18,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:26:18,068 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 10 states. [2018-12-02 09:26:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:18,462 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2018-12-02 09:26:18,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 09:26:18,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-12-02 09:26:18,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:18,463 INFO L225 Difference]: With dead ends: 156 [2018-12-02 09:26:18,464 INFO L226 Difference]: Without dead ends: 156 [2018-12-02 09:26:18,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-12-02 09:26:18,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-02 09:26:18,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 134. [2018-12-02 09:26:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-02 09:26:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2018-12-02 09:26:18,466 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 23 [2018-12-02 09:26:18,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:18,466 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2018-12-02 09:26:18,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 09:26:18,467 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2018-12-02 09:26:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 09:26:18,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:18,467 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, 1] [2018-12-02 09:26:18,467 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:18,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:18,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2060363479, now seen corresponding path program 1 times [2018-12-02 09:26:18,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:18,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:18,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:18,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:18,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:18,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:18,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 09:26:18,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:18,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 09:26:18,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 09:26:18,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:26:18,490 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 6 states. [2018-12-02 09:26:18,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:18,610 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2018-12-02 09:26:18,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:26:18,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-12-02 09:26:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:18,611 INFO L225 Difference]: With dead ends: 159 [2018-12-02 09:26:18,611 INFO L226 Difference]: Without dead ends: 159 [2018-12-02 09:26:18,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:26:18,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-02 09:26:18,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2018-12-02 09:26:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-02 09:26:18,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2018-12-02 09:26:18,614 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 26 [2018-12-02 09:26:18,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:18,614 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2018-12-02 09:26:18,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 09:26:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2018-12-02 09:26:18,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 09:26:18,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:18,615 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1] [2018-12-02 09:26:18,615 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:18,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash -875183104, now seen corresponding path program 1 times [2018-12-02 09:26:18,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:18,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:18,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:18,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:18,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:18,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:26:18,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:26:18,665 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-02 09:26:18,666 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [15], [16], [19], [22], [25], [30], [33], [141], [149], [153], [160], [167], [171], [183], [184], [185], [229], [231], [234], [285], [286], [287] [2018-12-02 09:26:18,688 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:26:18,688 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:26:18,784 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:26:18,785 INFO L272 AbstractInterpreter]: Visited 28 different actions 28 times. Never merged. Never widened. Performed 192 root evaluator evaluations with a maximum evaluation depth of 3. Performed 192 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-02 09:26:18,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:18,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:26:18,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:26:18,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:26:18,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:18,802 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:26:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:18,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:18,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:26:18,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:18,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:26:18,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:18,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,880 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-12-02 09:26:18,891 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 26 treesize of output 21 [2018-12-02 09:26:18,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:18,897 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 16 treesize of output 23 [2018-12-02 09:26:18,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,920 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 26 treesize of output 21 [2018-12-02 09:26:18,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:18,926 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 16 treesize of output 23 [2018-12-02 09:26:18,926 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,935 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:33 [2018-12-02 09:26:18,950 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 36 treesize of output 29 [2018-12-02 09:26:18,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:18,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:18,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:18,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-02 09:26:18,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,976 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 36 treesize of output 29 [2018-12-02 09:26:18,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:18,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:18,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:18,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-02 09:26:18,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:18,992 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:33 [2018-12-02 09:26:19,010 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 24 treesize of output 18 [2018-12-02 09:26:19,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:19,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-02 09:26:19,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:19,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:19,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 09:26:19,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:19,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-02 09:26:19,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:19,028 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:19,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:19,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-12-02 09:26:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:19,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:26:19,069 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:19,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:19,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:19,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:19,101 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:19,103 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:19,114 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:19,115 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:19,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 09:26:19,118 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:107, output treesize:25 [2018-12-02 09:26:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:19,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:26:19,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 8 [2018-12-02 09:26:19,148 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:26:19,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 09:26:19,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 09:26:19,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:26:19,149 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand 8 states. [2018-12-02 09:26:19,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:19,451 INFO L93 Difference]: Finished difference Result 190 states and 203 transitions. [2018-12-02 09:26:19,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 09:26:19,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-12-02 09:26:19,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:19,452 INFO L225 Difference]: With dead ends: 190 [2018-12-02 09:26:19,452 INFO L226 Difference]: Without dead ends: 190 [2018-12-02 09:26:19,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 11 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-02 09:26:19,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-02 09:26:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 148. [2018-12-02 09:26:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-02 09:26:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-12-02 09:26:19,456 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 29 [2018-12-02 09:26:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:19,456 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-12-02 09:26:19,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 09:26:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-12-02 09:26:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 09:26:19,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:19,458 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, 1, 1, 1, 1, 1] [2018-12-02 09:26:19,458 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:19,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:19,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1749861147, now seen corresponding path program 1 times [2018-12-02 09:26:19,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:19,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:19,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:19,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:19,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:19,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:19,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:26:19,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:19,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:26:19,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:26:19,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:19,530 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 5 states. [2018-12-02 09:26:19,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:19,628 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-12-02 09:26:19,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:26:19,629 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-02 09:26:19,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:19,629 INFO L225 Difference]: With dead ends: 151 [2018-12-02 09:26:19,629 INFO L226 Difference]: Without dead ends: 151 [2018-12-02 09:26:19,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:26:19,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-02 09:26:19,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2018-12-02 09:26:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-02 09:26:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-12-02 09:26:19,632 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 30 [2018-12-02 09:26:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:19,632 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-12-02 09:26:19,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:26:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-12-02 09:26:19,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 09:26:19,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:19,633 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, 1, 1, 1, 1, 1] [2018-12-02 09:26:19,633 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:19,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:19,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1205351030, now seen corresponding path program 1 times [2018-12-02 09:26:19,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:19,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:19,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:19,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:19,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:19,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:19,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:26:19,660 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:19,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:26:19,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:26:19,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:19,661 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 5 states. [2018-12-02 09:26:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:19,788 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2018-12-02 09:26:19,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:26:19,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-02 09:26:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:19,789 INFO L225 Difference]: With dead ends: 210 [2018-12-02 09:26:19,789 INFO L226 Difference]: Without dead ends: 210 [2018-12-02 09:26:19,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:26:19,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-02 09:26:19,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 146. [2018-12-02 09:26:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-02 09:26:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2018-12-02 09:26:19,792 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 30 [2018-12-02 09:26:19,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:19,792 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2018-12-02 09:26:19,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:26:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2018-12-02 09:26:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 09:26:19,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:19,793 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, 1, 1, 1, 1, 1] [2018-12-02 09:26:19,793 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:19,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:19,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1205351029, now seen corresponding path program 1 times [2018-12-02 09:26:19,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:19,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:19,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:19,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:19,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:19,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:19,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:26:19,839 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:19,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:26:19,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:26:19,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:19,840 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand 5 states. [2018-12-02 09:26:19,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:19,986 INFO L93 Difference]: Finished difference Result 231 states and 247 transitions. [2018-12-02 09:26:19,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:26:19,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-12-02 09:26:19,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:19,986 INFO L225 Difference]: With dead ends: 231 [2018-12-02 09:26:19,986 INFO L226 Difference]: Without dead ends: 231 [2018-12-02 09:26:19,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:26:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-02 09:26:19,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 145. [2018-12-02 09:26:19,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-02 09:26:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2018-12-02 09:26:19,990 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 30 [2018-12-02 09:26:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:19,990 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2018-12-02 09:26:19,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:26:19,990 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2018-12-02 09:26:19,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 09:26:19,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:19,991 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, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:19,991 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:19,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:19,991 INFO L82 PathProgramCache]: Analyzing trace with hash 762632254, now seen corresponding path program 1 times [2018-12-02 09:26:19,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:19,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:19,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:20,020 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-02 09:26:20,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:20,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 09:26:20,020 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:20,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 09:26:20,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 09:26:20,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:26:20,021 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 6 states. [2018-12-02 09:26:20,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:20,128 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2018-12-02 09:26:20,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:26:20,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-12-02 09:26:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:20,129 INFO L225 Difference]: With dead ends: 158 [2018-12-02 09:26:20,129 INFO L226 Difference]: Without dead ends: 158 [2018-12-02 09:26:20,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:26:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-02 09:26:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 145. [2018-12-02 09:26:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-02 09:26:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 153 transitions. [2018-12-02 09:26:20,131 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 153 transitions. Word has length 31 [2018-12-02 09:26:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:20,131 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 153 transitions. [2018-12-02 09:26:20,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 09:26:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 153 transitions. [2018-12-02 09:26:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 09:26:20,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:20,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:20,132 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:20,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:20,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1658380276, now seen corresponding path program 1 times [2018-12-02 09:26:20,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:20,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:20,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:20,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:20,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:20,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:20,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:20,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 09:26:20,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:20,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 09:26:20,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 09:26:20,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:26:20,189 INFO L87 Difference]: Start difference. First operand 145 states and 153 transitions. Second operand 8 states. [2018-12-02 09:26:20,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:20,404 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-12-02 09:26:20,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 09:26:20,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-12-02 09:26:20,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:20,404 INFO L225 Difference]: With dead ends: 145 [2018-12-02 09:26:20,404 INFO L226 Difference]: Without dead ends: 145 [2018-12-02 09:26:20,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-12-02 09:26:20,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-02 09:26:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-12-02 09:26:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-02 09:26:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2018-12-02 09:26:20,406 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 34 [2018-12-02 09:26:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:20,407 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2018-12-02 09:26:20,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 09:26:20,407 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2018-12-02 09:26:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 09:26:20,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:20,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:20,407 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:20,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:20,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1658380275, now seen corresponding path program 1 times [2018-12-02 09:26:20,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:20,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:20,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:20,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:20,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:20,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:20,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:20,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 09:26:20,488 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:20,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 09:26:20,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 09:26:20,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-02 09:26:20,489 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 9 states. [2018-12-02 09:26:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:20,987 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-12-02 09:26:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 09:26:20,988 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-12-02 09:26:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:20,989 INFO L225 Difference]: With dead ends: 140 [2018-12-02 09:26:20,989 INFO L226 Difference]: Without dead ends: 140 [2018-12-02 09:26:20,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-02 09:26:20,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-02 09:26:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2018-12-02 09:26:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-02 09:26:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-12-02 09:26:20,993 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 34 [2018-12-02 09:26:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:20,993 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-12-02 09:26:20,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 09:26:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-12-02 09:26:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 09:26:20,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:20,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:20,995 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:20,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:20,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1359456605, now seen corresponding path program 1 times [2018-12-02 09:26:20,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:20,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:20,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:20,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:20,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:21,065 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-02 09:26:21,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:26:21,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:26:21,065 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-12-02 09:26:21,065 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [15], [16], [19], [22], [25], [30], [33], [141], [149], [153], [160], [167], [171], [181], [183], [184], [229], [231], [234], [245], [246], [251], [252], [255], [257], [259], [261], [285], [286], [287] [2018-12-02 09:26:21,066 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:26:21,066 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:26:21,112 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:26:21,112 INFO L272 AbstractInterpreter]: Visited 36 different actions 36 times. Never merged. Never widened. Performed 232 root evaluator evaluations with a maximum evaluation depth of 3. Performed 232 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 34 variables. [2018-12-02 09:26:21,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:21,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:26:21,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:26:21,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/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-02 09:26:21,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:21,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:26:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:21,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:21,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 09:26:21,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 09:26:21,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 09:26:21,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 09:26:21,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 09:26:21,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-02 09:26:21,162 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-02 09:26:21,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:26:21,178 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-02 09:26:21,193 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 09:26:21,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 9 [2018-12-02 09:26:21,193 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:26:21,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:26:21,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:26:21,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 09:26:21,193 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 4 states. [2018-12-02 09:26:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:21,234 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2018-12-02 09:26:21,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:26:21,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-02 09:26:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:21,235 INFO L225 Difference]: With dead ends: 130 [2018-12-02 09:26:21,235 INFO L226 Difference]: Without dead ends: 130 [2018-12-02 09:26:21,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:26:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-02 09:26:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2018-12-02 09:26:21,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-02 09:26:21,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-12-02 09:26:21,237 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 36 [2018-12-02 09:26:21,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:21,237 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-12-02 09:26:21,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:26:21,237 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-12-02 09:26:21,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 09:26:21,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:21,238 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:21,238 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:21,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:21,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1478819748, now seen corresponding path program 1 times [2018-12-02 09:26:21,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:21,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:21,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:21,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:21,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:21,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:26:21,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:26:21,335 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-12-02 09:26:21,335 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [12], [15], [16], [19], [22], [25], [30], [33], [141], [149], [153], [160], [167], [171], [181], [183], [184], [229], [231], [234], [245], [246], [247], [269], [270], [273], [275], [277], [285], [286], [287] [2018-12-02 09:26:21,337 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:26:21,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:26:21,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:26:21,390 INFO L272 AbstractInterpreter]: Visited 36 different actions 42 times. Merged at 6 different actions 6 times. Never widened. Performed 296 root evaluator evaluations with a maximum evaluation depth of 3. Performed 296 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 34 variables. [2018-12-02 09:26:21,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:21,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:26:21,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:26:21,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/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-02 09:26:21,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:21,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:26:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:21,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:21,452 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 19 treesize of output 16 [2018-12-02 09:26:21,454 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 16 treesize of output 1 [2018-12-02 09:26:21,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,460 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 19 treesize of output 16 [2018-12-02 09:26:21,461 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 16 treesize of output 1 [2018-12-02 09:26:21,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,463 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:3 [2018-12-02 09:26:21,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 09:26:21,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:26:21,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 09:26:21,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:26:21,522 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:21,526 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2018-12-02 09:26:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:21,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:26:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:21,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:26:21,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 20 [2018-12-02 09:26:21,657 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:26:21,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 09:26:21,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 09:26:21,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-12-02 09:26:21,657 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 14 states. [2018-12-02 09:26:22,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:22,069 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2018-12-02 09:26:22,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 09:26:22,070 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-12-02 09:26:22,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:22,070 INFO L225 Difference]: With dead ends: 162 [2018-12-02 09:26:22,070 INFO L226 Difference]: Without dead ends: 162 [2018-12-02 09:26:22,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-12-02 09:26:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-02 09:26:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 135. [2018-12-02 09:26:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-02 09:26:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2018-12-02 09:26:22,072 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 37 [2018-12-02 09:26:22,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:22,072 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2018-12-02 09:26:22,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 09:26:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2018-12-02 09:26:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 09:26:22,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:22,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:22,073 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr59REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr53REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr34REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION]=== [2018-12-02 09:26:22,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:22,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1401227515, now seen corresponding path program 1 times [2018-12-02 09:26:22,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:26:22,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:22,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:22,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:26:22,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:26:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:26:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:26:22,102 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 09:26:22,115 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 09:26:22,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:26:22 BoogieIcfgContainer [2018-12-02 09:26:22,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 09:26:22,133 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 09:26:22,133 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 09:26:22,133 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 09:26:22,134 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:26:16" (3/4) ... [2018-12-02 09:26:22,137 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 09:26:22,137 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 09:26:22,138 INFO L168 Benchmark]: Toolchain (without parser) took 6538.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.3 MB). Free memory was 953.5 MB in the beginning and 1.2 GB in the end (delta: -209.2 MB). Peak memory consumption was 89.1 MB. Max. memory is 11.5 GB. [2018-12-02 09:26:22,139 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:26:22,139 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 09:26:22,139 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:26:22,140 INFO L168 Benchmark]: Boogie Preprocessor took 23.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-02 09:26:22,140 INFO L168 Benchmark]: RCFGBuilder took 317.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. [2018-12-02 09:26:22,140 INFO L168 Benchmark]: TraceAbstraction took 5919.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -101.4 MB). Peak memory consumption was 70.5 MB. Max. memory is 11.5 GB. [2018-12-02 09:26:22,141 INFO L168 Benchmark]: Witness Printer took 3.93 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:26:22,142 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 253.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.76 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. * Boogie Preprocessor took 23.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 317.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.1 MB). Peak memory consumption was 40.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5919.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -101.4 MB). Peak memory consumption was 70.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.93 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L988] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L989] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L990] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={20:0}, null={20:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L993] list->next = null VAL [list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L994] list->prev = null VAL [list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L995] list->colour = BLACK VAL [list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L997] struct TSLL* end = list; VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1031] EXPR end->colour VAL [end={19:0}, end->colour=1, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1034] EXPR end->colour VAL [end={19:0}, end->colour=1, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next VAL [end={19:0}, end->next={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1045] COND TRUE null != list VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1047] EXPR list->colour VAL [end={20:0}, list={19:0}, list->colour=1, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next VAL [end={20:0}, list={19:0}, list->next={20:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1056] end = list->next [L1057] free(list) VAL [end={20:0}, list={19:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1057] free(list) [L1058] list = end VAL [end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1045] COND FALSE !(null != list) VAL [end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] [L1062] return 0; VAL [\result=0, end={20:0}, list={20:0}, malloc(sizeof(struct TSLL))={20:0}, malloc(sizeof(struct TSLL))={19:0}, null={20:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 149 locations, 67 error locations. UNSAFE Result, 5.8s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 3.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1736 SDtfs, 2572 SDslu, 3134 SDs, 0 SdLazy, 4829 SolverSat, 223 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 198 SyntacticMatches, 25 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 504 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 611 NumberOfCodeBlocks, 611 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 649 ConstructedInterpolants, 0 QuantifiedInterpolants, 132555 SizeOfPredicates, 35 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 26 InterpolantComputations, 19 PerfectInterpolantSequences, 9/19 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 09:26:23,423 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:26:23,424 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:26:23,430 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:26:23,431 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:26:23,431 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:26:23,432 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:26:23,433 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:26:23,433 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:26:23,434 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:26:23,434 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:26:23,434 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:26:23,435 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:26:23,435 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:26:23,436 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:26:23,436 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:26:23,437 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:26:23,438 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:26:23,439 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:26:23,439 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:26:23,440 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:26:23,441 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:26:23,442 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:26:23,442 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:26:23,442 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:26:23,443 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:26:23,443 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:26:23,444 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:26:23,444 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:26:23,444 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:26:23,445 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:26:23,445 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:26:23,445 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:26:23,445 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:26:23,446 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:26:23,446 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:26:23,446 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-12-02 09:26:23,454 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:26:23,454 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:26:23,454 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 09:26:23,455 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 09:26:23,455 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 09:26:23,455 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 09:26:23,455 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 09:26:23,455 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 09:26:23,455 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 09:26:23,455 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 09:26:23,456 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 09:26:23,456 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 09:26:23,457 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:26:23,457 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 09:26:23,457 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 09:26:23,457 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 09:26:23,457 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 09:26:23,457 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:26:23,458 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 09:26:23,458 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 09:26:23,458 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 09:26:23,458 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 09:26:23,458 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 09:26:23,458 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 09:26:23,458 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 09:26:23,458 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 09:26:23,459 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:26:23,459 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:26:23,459 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 09:26:23,459 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 09:26:23,459 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:26:23,459 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:26:23,459 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 09:26:23,459 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 09:26:23,460 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 09:26:23,460 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 09:26:23,460 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/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 -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-12-02 09:26:23,483 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:26:23,493 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:26:23,495 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:26:23,496 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:26:23,497 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:26:23,497 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-02 09:26:23,542 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/data/fe88dc6a0/7d7c05e02b644f84afc57b7844eadf31/FLAG47bbb6999 [2018-12-02 09:26:23,958 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:26:23,958 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-02 09:26:23,965 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/data/fe88dc6a0/7d7c05e02b644f84afc57b7844eadf31/FLAG47bbb6999 [2018-12-02 09:26:23,973 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/data/fe88dc6a0/7d7c05e02b644f84afc57b7844eadf31 [2018-12-02 09:26:23,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:26:23,976 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:26:23,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:26:23,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:26:23,978 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:26:23,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:26:23" (1/1) ... [2018-12-02 09:26:23,980 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645c2029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:23, skipping insertion in model container [2018-12-02 09:26:23,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:26:23" (1/1) ... [2018-12-02 09:26:23,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:26:24,004 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:26:24,156 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:26:24,163 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:26:24,191 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:26:24,261 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:26:24,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:24 WrapperNode [2018-12-02 09:26:24,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:26:24,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:26:24,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:26:24,262 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:26:24,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:24" (1/1) ... [2018-12-02 09:26:24,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:24" (1/1) ... [2018-12-02 09:26:24,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:26:24,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:26:24,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:26:24,287 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:26:24,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:24" (1/1) ... [2018-12-02 09:26:24,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:24" (1/1) ... [2018-12-02 09:26:24,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:24" (1/1) ... [2018-12-02 09:26:24,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:24" (1/1) ... [2018-12-02 09:26:24,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:24" (1/1) ... [2018-12-02 09:26:24,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:24" (1/1) ... [2018-12-02 09:26:24,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:24" (1/1) ... [2018-12-02 09:26:24,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:26:24,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:26:24,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:26:24,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:26:24,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:26:24,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 09:26:24,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-02 09:26:24,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 09:26:24,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 09:26:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 09:26:24,341 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 09:26:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 09:26:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 09:26:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 09:26:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-02 09:26:24,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:26:24,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:26:24,778 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:26:24,779 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-02 09:26:24,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:26:24 BoogieIcfgContainer [2018-12-02 09:26:24,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:26:24,779 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 09:26:24,779 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 09:26:24,781 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 09:26:24,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:26:23" (1/3) ... [2018-12-02 09:26:24,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cc3331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:26:24, skipping insertion in model container [2018-12-02 09:26:24,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:26:24" (2/3) ... [2018-12-02 09:26:24,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32cc3331 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:26:24, skipping insertion in model container [2018-12-02 09:26:24,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:26:24" (3/3) ... [2018-12-02 09:26:24,783 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-02 09:26:24,788 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 09:26:24,792 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-12-02 09:26:24,801 INFO L257 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2018-12-02 09:26:24,815 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 09:26:24,815 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 09:26:24,815 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 09:26:24,815 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 09:26:24,815 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:26:24,815 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:26:24,815 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 09:26:24,815 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:26:24,816 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 09:26:24,826 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-12-02 09:26:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-02 09:26:24,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:24,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:24,832 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:24,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:24,835 INFO L82 PathProgramCache]: Analyzing trace with hash -487060194, now seen corresponding path program 1 times [2018-12-02 09:26:24,838 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:24,838 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:24,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:24,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:24,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:24,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:24,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:24,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:26:24,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:24,923 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:24,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:24,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:26:24,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:26:24,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:26:24,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:26:24,937 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 3 states. [2018-12-02 09:26:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:25,207 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2018-12-02 09:26:25,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:26:25,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-02 09:26:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:25,215 INFO L225 Difference]: With dead ends: 169 [2018-12-02 09:26:25,215 INFO L226 Difference]: Without dead ends: 165 [2018-12-02 09:26:25,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-02 09:26:25,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-02 09:26:25,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 141. [2018-12-02 09:26:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-02 09:26:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2018-12-02 09:26:25,243 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 7 [2018-12-02 09:26:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:25,243 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2018-12-02 09:26:25,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:26:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2018-12-02 09:26:25,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-02 09:26:25,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:25,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:25,244 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:25,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:25,244 INFO L82 PathProgramCache]: Analyzing trace with hash -487060193, now seen corresponding path program 1 times [2018-12-02 09:26:25,245 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:25,245 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:25,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:25,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:25,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:25,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:25,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:25,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 09:26:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:25,295 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:25,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:25,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:26:25,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:26:25,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:26:25,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:26:25,298 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand 3 states. [2018-12-02 09:26:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:25,538 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2018-12-02 09:26:25,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:26:25,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-02 09:26:25,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:25,540 INFO L225 Difference]: With dead ends: 138 [2018-12-02 09:26:25,540 INFO L226 Difference]: Without dead ends: 138 [2018-12-02 09:26:25,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-02 09:26:25,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-02 09:26:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-02 09:26:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-02 09:26:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 143 transitions. [2018-12-02 09:26:25,546 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 143 transitions. Word has length 7 [2018-12-02 09:26:25,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:25,546 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 143 transitions. [2018-12-02 09:26:25,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:26:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 143 transitions. [2018-12-02 09:26:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 09:26:25,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:25,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:25,547 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:25,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:25,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1606843618, now seen corresponding path program 1 times [2018-12-02 09:26:25,547 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:25,547 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:25,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:25,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:25,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 09:26:25,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:25,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:25,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-02 09:26:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:25,617 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:25,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:25,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:26:25,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:26:25,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:26:25,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:26:25,619 INFO L87 Difference]: Start difference. First operand 138 states and 143 transitions. Second operand 4 states. [2018-12-02 09:26:25,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:25,836 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-12-02 09:26:25,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:26:25,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 09:26:25,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:25,837 INFO L225 Difference]: With dead ends: 137 [2018-12-02 09:26:25,837 INFO L226 Difference]: Without dead ends: 137 [2018-12-02 09:26:25,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-02 09:26:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-02 09:26:25,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-12-02 09:26:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-02 09:26:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2018-12-02 09:26:25,842 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 11 [2018-12-02 09:26:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:25,842 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2018-12-02 09:26:25,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:26:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2018-12-02 09:26:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 09:26:25,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:25,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:25,843 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:25,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1606843619, now seen corresponding path program 1 times [2018-12-02 09:26:25,843 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:25,843 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:25,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:25,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:25,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:25,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:25,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:25,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 09:26:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:25,904 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:25,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:25,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 09:26:25,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:26:25,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:26:25,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:26:25,906 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 3 states. [2018-12-02 09:26:26,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:26,145 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2018-12-02 09:26:26,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:26:26,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 09:26:26,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:26,147 INFO L225 Difference]: With dead ends: 146 [2018-12-02 09:26:26,147 INFO L226 Difference]: Without dead ends: 146 [2018-12-02 09:26:26,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-02 09:26:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-02 09:26:26,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2018-12-02 09:26:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-02 09:26:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 144 transitions. [2018-12-02 09:26:26,152 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 144 transitions. Word has length 11 [2018-12-02 09:26:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:26,152 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 144 transitions. [2018-12-02 09:26:26,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:26:26,152 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 144 transitions. [2018-12-02 09:26:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 09:26:26,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:26,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:26,153 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:26,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:26,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1511028585, now seen corresponding path program 1 times [2018-12-02 09:26:26,154 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:26,154 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:26,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:26,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:26,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 09:26:26,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:26,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:26,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-02 09:26:26,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 09:26:26,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:26,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:26,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-02 09:26:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:26,272 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:26,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:26,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:26:26,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:26:26,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:26:26,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:26,274 INFO L87 Difference]: Start difference. First operand 137 states and 144 transitions. Second operand 5 states. [2018-12-02 09:26:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:26,569 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-12-02 09:26:26,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:26:26,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-02 09:26:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:26,570 INFO L225 Difference]: With dead ends: 138 [2018-12-02 09:26:26,570 INFO L226 Difference]: Without dead ends: 138 [2018-12-02 09:26:26,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:26:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-02 09:26:26,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2018-12-02 09:26:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-02 09:26:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-12-02 09:26:26,573 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 16 [2018-12-02 09:26:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:26,573 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-12-02 09:26:26,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:26:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-12-02 09:26:26,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 09:26:26,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:26,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:26,574 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:26,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:26,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1511028584, now seen corresponding path program 1 times [2018-12-02 09:26:26,575 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:26,575 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:26,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:26,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:26,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:26,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:26,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:26,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:26,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:26,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 09:26:26,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:26,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:26,700 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 09:26:26,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:26,714 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 14 treesize of output 17 [2018-12-02 09:26:26,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:26,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:26,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-12-02 09:26:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:26,739 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:26,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:26,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:26:26,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:26:26,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:26:26,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:26,741 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 5 states. [2018-12-02 09:26:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:27,371 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2018-12-02 09:26:27,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:26:27,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-02 09:26:27,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:27,373 INFO L225 Difference]: With dead ends: 153 [2018-12-02 09:26:27,373 INFO L226 Difference]: Without dead ends: 153 [2018-12-02 09:26:27,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:26:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-02 09:26:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 132. [2018-12-02 09:26:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-02 09:26:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2018-12-02 09:26:27,377 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 16 [2018-12-02 09:26:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:27,377 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2018-12-02 09:26:27,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:26:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2018-12-02 09:26:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 09:26:27,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:27,378 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-02 09:26:27,378 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:27,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:27,378 INFO L82 PathProgramCache]: Analyzing trace with hash -399523878, now seen corresponding path program 1 times [2018-12-02 09:26:27,379 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:27,379 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:27,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:27,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:27,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:27,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:27,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:27,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:26:27,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:26:27,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:27,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:27,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:27,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:27,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2018-12-02 09:26:27,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 09:26:27,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-12-02 09:26:27,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:27,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:27,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:27,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2018-12-02 09:26:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:27,498 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:27,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:27,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:26:27,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:26:27,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:26:27,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:27,500 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand 5 states. [2018-12-02 09:26:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:27,965 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2018-12-02 09:26:27,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:26:27,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-02 09:26:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:27,966 INFO L225 Difference]: With dead ends: 174 [2018-12-02 09:26:27,966 INFO L226 Difference]: Without dead ends: 174 [2018-12-02 09:26:27,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:26:27,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-02 09:26:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2018-12-02 09:26:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-02 09:26:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-12-02 09:26:27,969 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 18 [2018-12-02 09:26:27,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:27,969 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-12-02 09:26:27,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:26:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-12-02 09:26:27,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 09:26:27,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:27,970 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-02 09:26:27,970 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:27,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:27,970 INFO L82 PathProgramCache]: Analyzing trace with hash -399523877, now seen corresponding path program 1 times [2018-12-02 09:26:27,970 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:27,970 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:27,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:28,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:28,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:28,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 09:26:28,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:26:28,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:28,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:26:28,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:28,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,088 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-02 09:26:28,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 09:26:28,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:26:28,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,109 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 17 treesize of output 13 [2018-12-02 09:26:28,111 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 13 treesize of output 5 [2018-12-02 09:26:28,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-12-02 09:26:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:28,125 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:28,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:28,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:26:28,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:26:28,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:26:28,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:28,128 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 5 states. [2018-12-02 09:26:28,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:28,678 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2018-12-02 09:26:28,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:26:28,678 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-02 09:26:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:28,679 INFO L225 Difference]: With dead ends: 195 [2018-12-02 09:26:28,679 INFO L226 Difference]: Without dead ends: 195 [2018-12-02 09:26:28,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:26:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-02 09:26:28,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 130. [2018-12-02 09:26:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-02 09:26:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2018-12-02 09:26:28,682 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2018-12-02 09:26:28,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:28,682 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2018-12-02 09:26:28,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:26:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2018-12-02 09:26:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 09:26:28,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:28,682 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-02 09:26:28,683 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:28,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:28,683 INFO L82 PathProgramCache]: Analyzing trace with hash -935404900, now seen corresponding path program 1 times [2018-12-02 09:26:28,683 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:28,683 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:28,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:28,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:28,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 09:26:28,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:28,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-02 09:26:28,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:28,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:28,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 09:26:28,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-02 09:26:28,818 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 11 treesize of output 8 [2018-12-02 09:26:28,821 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:28,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-12-02 09:26:28,872 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-02 09:26:28,876 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 14 treesize of output 13 [2018-12-02 09:26:28,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,896 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-02 09:26:28,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-02 09:26:28,932 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 40 treesize of output 28 [2018-12-02 09:26:28,935 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 21 treesize of output 12 [2018-12-02 09:26:28,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,945 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 7 treesize of output 1 [2018-12-02 09:26:28,945 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:28,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:28,956 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-12-02 09:26:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:28,993 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:28,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:28,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 09:26:28,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 09:26:28,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 09:26:28,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-02 09:26:28,996 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand 11 states. [2018-12-02 09:26:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:30,396 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2018-12-02 09:26:30,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 09:26:30,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-12-02 09:26:30,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:30,397 INFO L225 Difference]: With dead ends: 176 [2018-12-02 09:26:30,397 INFO L226 Difference]: Without dead ends: 176 [2018-12-02 09:26:30,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2018-12-02 09:26:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-02 09:26:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 129. [2018-12-02 09:26:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-02 09:26:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-12-02 09:26:30,400 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 22 [2018-12-02 09:26:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:30,400 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-12-02 09:26:30,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 09:26:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-12-02 09:26:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 09:26:30,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:30,400 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-02 09:26:30,400 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:30,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash -935404899, now seen corresponding path program 1 times [2018-12-02 09:26:30,401 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:30,401 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:30,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:30,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:30,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:30,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:26:30,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:30,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:30,545 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 09:26:30,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,557 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:30,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-12-02 09:26:30,587 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 11 treesize of output 8 [2018-12-02 09:26:30,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:30,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,609 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 11 treesize of output 8 [2018-12-02 09:26:30,611 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:30,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,624 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-12-02 09:26:30,673 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-02 09:26:30,676 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 14 treesize of output 13 [2018-12-02 09:26:30,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,717 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-12-02 09:26:30,720 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 14 treesize of output 13 [2018-12-02 09:26:30,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:30,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-12-02 09:26:30,787 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-02 09:26:30,790 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 7 treesize of output 1 [2018-12-02 09:26:30,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:26:30,802 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,823 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 38 treesize of output 26 [2018-12-02 09:26:30,826 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 7 treesize of output 1 [2018-12-02 09:26:30,827 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,835 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 19 treesize of output 10 [2018-12-02 09:26:30,835 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,839 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:30,843 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-12-02 09:26:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:30,873 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:30,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:30,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 09:26:30,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 09:26:30,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 09:26:30,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:26:30,876 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 10 states. [2018-12-02 09:26:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:32,213 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-12-02 09:26:32,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-02 09:26:32,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-02 09:26:32,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:32,215 INFO L225 Difference]: With dead ends: 152 [2018-12-02 09:26:32,215 INFO L226 Difference]: Without dead ends: 152 [2018-12-02 09:26:32,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-12-02 09:26:32,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-02 09:26:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 131. [2018-12-02 09:26:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-02 09:26:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-12-02 09:26:32,218 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 22 [2018-12-02 09:26:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:32,218 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-12-02 09:26:32,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 09:26:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-12-02 09:26:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 09:26:32,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:32,219 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-02 09:26:32,219 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:32,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:32,219 INFO L82 PathProgramCache]: Analyzing trace with hash 75907902, now seen corresponding path program 1 times [2018-12-02 09:26:32,220 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:32,220 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:32,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:32,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:32,264 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:32,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:32,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 09:26:32,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 09:26:32,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 09:26:32,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 09:26:32,266 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand 3 states. [2018-12-02 09:26:32,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:32,445 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-12-02 09:26:32,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 09:26:32,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 09:26:32,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:32,446 INFO L225 Difference]: With dead ends: 139 [2018-12-02 09:26:32,446 INFO L226 Difference]: Without dead ends: 139 [2018-12-02 09:26:32,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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-02 09:26:32,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-02 09:26:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2018-12-02 09:26:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-02 09:26:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-12-02 09:26:32,448 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 25 [2018-12-02 09:26:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:32,449 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-12-02 09:26:32,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 09:26:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-12-02 09:26:32,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 09:26:32,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:32,449 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1] [2018-12-02 09:26:32,450 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:32,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:32,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2039865847, now seen corresponding path program 1 times [2018-12-02 09:26:32,450 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:32,450 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:32,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:32,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:32,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:32,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:26:32,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 09:26:32,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-02 09:26:32,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:26:32,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:32,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-02 09:26:32,623 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 27 treesize of output 20 [2018-12-02 09:26:32,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:32,627 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 20 treesize of output 29 [2018-12-02 09:26:32,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-12-02 09:26:32,658 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 44 treesize of output 35 [2018-12-02 09:26:32,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:32,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:32,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:32,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 45 [2018-12-02 09:26:32,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:33 [2018-12-02 09:26:32,712 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 28 treesize of output 20 [2018-12-02 09:26:32,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-12-02 09:26:32,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,719 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-02 09:26:32,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:11 [2018-12-02 09:26:32,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:32,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:26:32,778 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:32,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:32,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:32,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:16 [2018-12-02 09:26:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:32,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:26:32,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:26:32,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:32,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:32,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:26:32,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:32,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:26:32,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:32,916 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2018-12-02 09:26:32,954 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 21 treesize of output 16 [2018-12-02 09:26:32,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:32,959 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 16 treesize of output 23 [2018-12-02 09:26:32,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:32,990 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 21 treesize of output 16 [2018-12-02 09:26:32,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:32,994 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 16 treesize of output 23 [2018-12-02 09:26:32,994 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:39 [2018-12-02 09:26:33,061 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 36 treesize of output 29 [2018-12-02 09:26:33,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:33,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:33,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:33,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-02 09:26:33,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,132 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 36 treesize of output 29 [2018-12-02 09:26:33,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:33,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:33,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:33,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-02 09:26:33,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,157 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,173 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:39 [2018-12-02 09:26:33,213 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 22 treesize of output 16 [2018-12-02 09:26:33,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-12-02 09:26:33,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,231 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 22 treesize of output 16 [2018-12-02 09:26:33,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-02 09:26:33,233 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,240 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:10 [2018-12-02 09:26:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:33,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:26:33,417 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:33,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:33,490 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,492 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,527 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:33,536 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:33,554 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,556 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-02 09:26:33,562 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:97, output treesize:25 [2018-12-02 09:26:33,635 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 09:26:33,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:33,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:53, output treesize:1 [2018-12-02 09:26:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:33,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 09:26:33,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 9, 7] total 23 [2018-12-02 09:26:33,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 09:26:33,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 09:26:33,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2018-12-02 09:26:33,655 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 23 states. [2018-12-02 09:26:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:36,041 INFO L93 Difference]: Finished difference Result 188 states and 201 transitions. [2018-12-02 09:26:36,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 09:26:36,042 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 28 [2018-12-02 09:26:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:36,043 INFO L225 Difference]: With dead ends: 188 [2018-12-02 09:26:36,043 INFO L226 Difference]: Without dead ends: 188 [2018-12-02 09:26:36,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 83 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=308, Invalid=1098, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 09:26:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-02 09:26:36,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 144. [2018-12-02 09:26:36,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-02 09:26:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2018-12-02 09:26:36,049 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 28 [2018-12-02 09:26:36,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:36,049 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2018-12-02 09:26:36,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 09:26:36,049 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2018-12-02 09:26:36,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 09:26:36,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:36,050 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, 1, 1, 1] [2018-12-02 09:26:36,050 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:36,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1615706815, now seen corresponding path program 1 times [2018-12-02 09:26:36,051 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:36,051 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:36,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:36,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:36,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:36,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:26:36,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:26:36,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:36,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-12-02 09:26:36,171 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 17 treesize of output 13 [2018-12-02 09:26:36,172 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 13 treesize of output 5 [2018-12-02 09:26:36,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-02 09:26:36,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:36,180 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:36,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:36,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:26:36,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:26:36,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:26:36,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:36,183 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand 5 states. [2018-12-02 09:26:36,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:36,715 INFO L93 Difference]: Finished difference Result 206 states and 223 transitions. [2018-12-02 09:26:36,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:26:36,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-02 09:26:36,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:36,716 INFO L225 Difference]: With dead ends: 206 [2018-12-02 09:26:36,716 INFO L226 Difference]: Without dead ends: 206 [2018-12-02 09:26:36,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 09:26:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-02 09:26:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 143. [2018-12-02 09:26:36,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-02 09:26:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-12-02 09:26:36,719 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 28 [2018-12-02 09:26:36,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:36,720 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-12-02 09:26:36,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:26:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-12-02 09:26:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 09:26:36,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:36,720 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, 1, 1, 1] [2018-12-02 09:26:36,721 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:36,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:36,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1615706814, now seen corresponding path program 1 times [2018-12-02 09:26:36,721 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:36,721 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:36,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:36,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:36,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:36,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 09:26:36,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:26:36,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:36,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:26:36,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:36,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,863 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-12-02 09:26:36,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 09:26:36,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:26:36,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,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 17 treesize of output 13 [2018-12-02 09:26:36,886 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 13 treesize of output 5 [2018-12-02 09:26:36,886 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:36,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:9 [2018-12-02 09:26:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:36,899 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:36,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:36,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:26:36,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:26:36,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:26:36,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:36,901 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 5 states. [2018-12-02 09:26:37,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:37,549 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2018-12-02 09:26:37,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 09:26:37,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-12-02 09:26:37,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:37,550 INFO L225 Difference]: With dead ends: 227 [2018-12-02 09:26:37,550 INFO L226 Difference]: Without dead ends: 227 [2018-12-02 09:26:37,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 09:26:37,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-02 09:26:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 142. [2018-12-02 09:26:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-02 09:26:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2018-12-02 09:26:37,553 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 28 [2018-12-02 09:26:37,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:37,553 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2018-12-02 09:26:37,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:26:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2018-12-02 09:26:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 09:26:37,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:37,554 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, 1, 1, 1, 1] [2018-12-02 09:26:37,554 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:37,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:37,554 INFO L82 PathProgramCache]: Analyzing trace with hash 4434480, now seen corresponding path program 1 times [2018-12-02 09:26:37,555 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:37,555 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:37,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:37,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:37,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 09:26:37,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 09:26:37,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:37,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:37,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:37,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-02 09:26:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:37,614 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:37,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:37,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:26:37,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:26:37,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:26:37,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:37,616 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 5 states. [2018-12-02 09:26:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:37,986 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-12-02 09:26:37,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:26:37,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-02 09:26:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:37,987 INFO L225 Difference]: With dead ends: 145 [2018-12-02 09:26:37,987 INFO L226 Difference]: Without dead ends: 145 [2018-12-02 09:26:37,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 09:26:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-02 09:26:37,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-12-02 09:26:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-02 09:26:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2018-12-02 09:26:37,989 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 29 [2018-12-02 09:26:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:37,989 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2018-12-02 09:26:37,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:26:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2018-12-02 09:26:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 09:26:37,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:37,989 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, 1, 1, 1, 1, 1] [2018-12-02 09:26:37,990 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:37,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:37,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1805986873, now seen corresponding path program 1 times [2018-12-02 09:26:37,990 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:37,990 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:38,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:38,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:38,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:38,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:26:38,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:38,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:38,070 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 09:26:38,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-02 09:26:38,078 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 7 treesize of output 5 [2018-12-02 09:26:38,079 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 5 treesize of output 1 [2018-12-02 09:26:38,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:12, output treesize:4 [2018-12-02 09:26:38,082 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-02 09:26:38,082 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:38,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:38,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:26:38,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:26:38,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:26:38,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:26:38,084 INFO L87 Difference]: Start difference. First operand 141 states and 150 transitions. Second operand 4 states. [2018-12-02 09:26:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:38,289 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2018-12-02 09:26:38,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:26:38,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-12-02 09:26:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:38,290 INFO L225 Difference]: With dead ends: 170 [2018-12-02 09:26:38,290 INFO L226 Difference]: Without dead ends: 170 [2018-12-02 09:26:38,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-02 09:26:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 141. [2018-12-02 09:26:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-02 09:26:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-12-02 09:26:38,292 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 30 [2018-12-02 09:26:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:38,293 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-12-02 09:26:38,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:26:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-12-02 09:26:38,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 09:26:38,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:38,293 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:38,294 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:38,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:38,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1185936324, now seen corresponding path program 1 times [2018-12-02 09:26:38,294 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:38,294 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:38,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:38,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:38,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:38,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 09:26:38,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:38,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:38,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 09:26:38,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-02 09:26:38,534 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 11 treesize of output 8 [2018-12-02 09:26:38,536 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:38,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-12-02 09:26:38,588 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-02 09:26:38,591 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 14 treesize of output 13 [2018-12-02 09:26:38,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,611 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-02 09:26:38,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-02 09:26:38,642 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 40 treesize of output 28 [2018-12-02 09:26:38,644 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 21 treesize of output 12 [2018-12-02 09:26:38,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,654 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 7 treesize of output 1 [2018-12-02 09:26:38,654 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:38,662 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-12-02 09:26:38,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:26:38,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,706 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:38,706 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:26:38,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 09:26:38,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:13 [2018-12-02 09:26:38,739 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 11 treesize of output 8 [2018-12-02 09:26:38,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:38,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,757 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 11 treesize of output 8 [2018-12-02 09:26:38,759 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:38,759 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,770 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-12-02 09:26:38,832 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-12-02 09:26:38,836 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 14 treesize of output 13 [2018-12-02 09:26:38,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,878 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-02 09:26:38,881 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 14 treesize of output 13 [2018-12-02 09:26:38,882 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:38,906 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-12-02 09:26:38,955 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-02 09:26:38,958 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 7 treesize of output 1 [2018-12-02 09:26:38,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:26:38,968 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,989 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 38 treesize of output 26 [2018-12-02 09:26:38,991 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 7 treesize of output 1 [2018-12-02 09:26:38,991 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:38,999 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 19 treesize of output 10 [2018-12-02 09:26:38,999 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:39,003 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:39,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:39,007 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-12-02 09:26:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:39,048 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:39,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:39,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-12-02 09:26:39,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 09:26:39,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 09:26:39,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-12-02 09:26:39,052 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 16 states. [2018-12-02 09:26:40,248 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-12-02 09:26:40,518 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-12-02 09:26:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:41,384 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2018-12-02 09:26:41,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 09:26:41,384 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-12-02 09:26:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:41,385 INFO L225 Difference]: With dead ends: 146 [2018-12-02 09:26:41,385 INFO L226 Difference]: Without dead ends: 146 [2018-12-02 09:26:41,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=318, Invalid=1088, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 09:26:41,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-02 09:26:41,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 120. [2018-12-02 09:26:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-02 09:26:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2018-12-02 09:26:41,387 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 32 [2018-12-02 09:26:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:41,388 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2018-12-02 09:26:41,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 09:26:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-12-02 09:26:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 09:26:41,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:41,388 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:41,388 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:41,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:41,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1185936323, now seen corresponding path program 1 times [2018-12-02 09:26:41,389 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:41,389 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:41,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:41,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:41,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 09:26:41,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:41,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-12-02 09:26:41,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:41,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:41,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 09:26:41,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-02 09:26:41,599 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 11 treesize of output 8 [2018-12-02 09:26:41,601 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:41,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-12-02 09:26:41,649 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-12-02 09:26:41,651 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 14 treesize of output 13 [2018-12-02 09:26:41,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,670 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-02 09:26:41,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-12-02 09:26:41,701 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 40 treesize of output 28 [2018-12-02 09:26:41,703 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 7 treesize of output 1 [2018-12-02 09:26:41,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,710 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 21 treesize of output 12 [2018-12-02 09:26:41,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:41,718 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-12-02 09:26:41,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:26:41,753 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:26:41,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2018-12-02 09:26:41,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:41,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:31 [2018-12-02 09:26:41,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:26:41,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 09:26:41,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:41,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:43 [2018-12-02 09:26:41,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-12-02 09:26:41,901 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-02 09:26:41,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:41,932 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-02 09:26:41,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:56 [2018-12-02 09:26:41,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2018-12-02 09:26:41,994 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 7 treesize of output 1 [2018-12-02 09:26:41,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:42,004 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-12-02 09:26:42,004 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:42,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:42,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 09:26:42,018 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:63, output treesize:31 [2018-12-02 09:26:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:42,128 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:42,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:42,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-02 09:26:42,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 09:26:42,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 09:26:42,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-12-02 09:26:42,131 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 17 states. [2018-12-02 09:26:46,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:46,903 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-12-02 09:26:46,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 09:26:46,904 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-02 09:26:46,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:46,904 INFO L225 Difference]: With dead ends: 151 [2018-12-02 09:26:46,905 INFO L226 Difference]: Without dead ends: 151 [2018-12-02 09:26:46,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=386, Invalid=1020, Unknown=0, NotChecked=0, Total=1406 [2018-12-02 09:26:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-02 09:26:46,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 119. [2018-12-02 09:26:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-02 09:26:46,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-12-02 09:26:46,907 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 32 [2018-12-02 09:26:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:46,908 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-12-02 09:26:46,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 09:26:46,908 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-12-02 09:26:46,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 09:26:46,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:46,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:46,908 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:46,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:46,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1420731406, now seen corresponding path program 1 times [2018-12-02 09:26:46,909 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:46,909 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:46,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:46,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:46,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 09:26:46,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 09:26:46,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:46,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:46,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:46,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-02 09:26:47,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 09:26:47,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 09:26:47,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-02 09:26:47,016 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-02 09:26:47,016 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:26:47,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:26:47,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:26:47,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:26:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:26:47,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:26:47,018 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 4 states. [2018-12-02 09:26:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:47,213 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2018-12-02 09:26:47,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:26:47,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-02 09:26:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:47,214 INFO L225 Difference]: With dead ends: 127 [2018-12-02 09:26:47,214 INFO L226 Difference]: Without dead ends: 127 [2018-12-02 09:26:47,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:26:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-02 09:26:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-12-02 09:26:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-02 09:26:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-12-02 09:26:47,216 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 35 [2018-12-02 09:26:47,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:47,216 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-12-02 09:26:47,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:26:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-12-02 09:26:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 09:26:47,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:47,216 INFO L402 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:47,216 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:47,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:47,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1765302171, now seen corresponding path program 1 times [2018-12-02 09:26:47,217 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:47,217 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:47,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:47,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:47,320 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 19 treesize of output 16 [2018-12-02 09:26:47,323 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 16 treesize of output 1 [2018-12-02 09:26:47,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,335 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 19 treesize of output 16 [2018-12-02 09:26:47,337 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 16 treesize of output 1 [2018-12-02 09:26:47,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,338 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:3 [2018-12-02 09:26:47,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 09:26:47,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:26:47,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 09:26:47,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:26:47,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-02 09:26:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:47,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:26:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:47,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:26:47,546 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:26:47,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:26:47,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:26:47,579 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 19 treesize of output 16 [2018-12-02 09:26:47,582 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 16 treesize of output 1 [2018-12-02 09:26:47,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,591 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 19 treesize of output 16 [2018-12-02 09:26:47,592 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 16 treesize of output 1 [2018-12-02 09:26:47,593 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,594 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:1 [2018-12-02 09:26:47,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 09:26:47,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:26:47,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 09:26:47,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:26:47,631 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:26:47,637 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-02 09:26:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:47,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:26:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:26:47,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 09:26:47,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9, 9] total 15 [2018-12-02 09:26:47,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 09:26:47,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 09:26:47,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-12-02 09:26:47,660 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 15 states. [2018-12-02 09:26:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:26:49,121 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2018-12-02 09:26:49,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 09:26:49,122 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2018-12-02 09:26:49,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:26:49,122 INFO L225 Difference]: With dead ends: 170 [2018-12-02 09:26:49,122 INFO L226 Difference]: Without dead ends: 170 [2018-12-02 09:26:49,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2018-12-02 09:26:49,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-02 09:26:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 132. [2018-12-02 09:26:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-02 09:26:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2018-12-02 09:26:49,124 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 36 [2018-12-02 09:26:49,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:26:49,124 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2018-12-02 09:26:49,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 09:26:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2018-12-02 09:26:49,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 09:26:49,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:26:49,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:26:49,125 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr58REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr62REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr66ENSURES_VIOLATIONMEMORY_LEAK, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr64ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr65ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr59REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr63REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr61ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION]=== [2018-12-02 09:26:49,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:26:49,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1110206992, now seen corresponding path program 1 times [2018-12-02 09:26:49,126 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:26:49,126 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_278a991c-5dab-41c4-b226-2e4caf9fc79d/bin-2019/utaipan/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:26:49,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:26:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:26:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 09:26:49,382 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 09:26:49,393 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 09:26:49,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:26:49 BoogieIcfgContainer [2018-12-02 09:26:49,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 09:26:49,410 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 09:26:49,410 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 09:26:49,410 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 09:26:49,410 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:26:24" (3/4) ... [2018-12-02 09:26:49,413 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 09:26:49,413 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 09:26:49,414 INFO L168 Benchmark]: Toolchain (without parser) took 25438.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.0 MB). Free memory was 939.3 MB in the beginning and 829.1 MB in the end (delta: 110.2 MB). Peak memory consumption was 444.2 MB. Max. memory is 11.5 GB. [2018-12-02 09:26:49,414 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:26:49,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2018-12-02 09:26:49,414 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-02 09:26:49,414 INFO L168 Benchmark]: Boogie Preprocessor took 22.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:26:49,414 INFO L168 Benchmark]: RCFGBuilder took 469.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. [2018-12-02 09:26:49,415 INFO L168 Benchmark]: TraceAbstraction took 24630.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 829.1 MB in the end (delta: 233.1 MB). Peak memory consumption was 425.0 MB. Max. memory is 11.5 GB. [2018-12-02 09:26:49,415 INFO L168 Benchmark]: Witness Printer took 3.36 ms. Allocated memory is still 1.4 GB. Free memory is still 829.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:26:49,416 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 285.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 469.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.6 MB). Peak memory consumption was 52.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24630.09 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.1 GB in the beginning and 829.1 MB in the end (delta: 233.1 MB). Peak memory consumption was 425.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.36 ms. Allocated memory is still 1.4 GB. Free memory is still 829.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 985. Possible FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L988] null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L989] null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L990] null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L993] list->next = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L994] list->prev = null VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L995] list->colour = BLACK VAL [list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L997] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1031] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1034] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next VAL [end={-2:0}, end->next={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1041] end = end->next [L1032] COND FALSE !(null != end) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1045] COND TRUE null != list VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1047] EXPR list->colour VAL [end={1:0}, list={-2:0}, list->colour=1, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1047] COND FALSE !(RED == list->colour) [L1056] EXPR list->next VAL [end={1:0}, list={-2:0}, list->next={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1056] end = list->next [L1057] free(list) VAL [end={1:0}, list={-2:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1057] free(list) [L1058] list = end VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1045] COND FALSE !(null != list) VAL [end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] [L1062] return 0; VAL [\result=0, end={1:0}, list={1:0}, malloc(sizeof(struct TSLL))={-2:0}, malloc(sizeof(struct TSLL))={1:0}, null={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 147 locations, 67 error locations. UNSAFE Result, 24.5s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 18.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1626 SDtfs, 3611 SDslu, 3147 SDs, 0 SdLazy, 5454 SolverSat, 400 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 727 GetRequests, 502 SyntacticMatches, 10 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 877 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 582 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 617 ConstructedInterpolants, 34 QuantifiedInterpolants, 141628 SizeOfPredicates, 165 NumberOfNonLiveVariables, 2405 ConjunctsInSsa, 218 ConjunctsInUnsatCore, 26 InterpolantComputations, 18 PerfectInterpolantSequences, 8/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...